./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.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_b631c09c-f46a-4005-81b6-b0c1b4daa618/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b631c09c-f46a-4005-81b6-b0c1b4daa618/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_b631c09c-f46a-4005-81b6-b0c1b4daa618/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b631c09c-f46a-4005-81b6-b0c1b4daa618/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b631c09c-f46a-4005-81b6-b0c1b4daa618/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_b631c09c-f46a-4005-81b6-b0c1b4daa618/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 bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 --- 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 21:11:36,889 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:11:36,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:11:36,902 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:11:36,902 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:11:36,903 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:11:36,904 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:11:36,905 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:11:36,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:11:36,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:11:36,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:11:36,907 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:11:36,908 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:11:36,908 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:11:36,909 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:11:36,910 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:11:36,910 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:11:36,911 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:11:36,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:11:36,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:11:36,914 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:11:36,915 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:11:36,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:11:36,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:11:36,918 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:11:36,918 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:11:36,918 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:11:36,919 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:11:36,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:11:36,920 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:11:36,920 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:11:36,920 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:11:36,921 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:11:36,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:11:36,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:11:36,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:11:36,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:11:36,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:11:36,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:11:36,923 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:11:36,924 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:11:36,925 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b631c09c-f46a-4005-81b6-b0c1b4daa618/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 21:11:36,939 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:11:36,939 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:11:36,939 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:11:36,939 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:11:36,940 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:11:36,940 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:11:36,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:11:36,940 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:11:36,940 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:11:36,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:11:36,941 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:11:36,941 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:11:36,941 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:11:36,941 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:11:36,941 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:11:36,941 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:11:36,941 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:11:36,941 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:11:36,942 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:11:36,942 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:11:36,942 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:11:36,942 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:11:36,942 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:11:36,942 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:11:36,942 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:11:36,942 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:11:36,943 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:11:36,943 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:11:36,943 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:11:36,943 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:11:36,943 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:11:36,943 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:11:36,943 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:11:36,943 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:11:36,943 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:11:36,943 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_b631c09c-f46a-4005-81b6-b0c1b4daa618/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_b631c09c-f46a-4005-81b6-b0c1b4daa618/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 -> bd5019d3aed54929cd262296b7eb8866c696444f31311cf49176222c13f665a6 [2022-12-13 21:11:37,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:11:37,155 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:11:37,157 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:11:37,158 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:11:37,158 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:11:37,159 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b631c09c-f46a-4005-81b6-b0c1b4daa618/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 21:11:39,699 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:11:39,880 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:11:39,880 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b631c09c-f46a-4005-81b6-b0c1b4daa618/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 21:11:39,891 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b631c09c-f46a-4005-81b6-b0c1b4daa618/bin/uautomizer-uyxdKDjOR8/data/b191c9c3e/4960fb1b01db410595b8eec6aed870c2/FLAG01a1bd809 [2022-12-13 21:11:40,272 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b631c09c-f46a-4005-81b6-b0c1b4daa618/bin/uautomizer-uyxdKDjOR8/data/b191c9c3e/4960fb1b01db410595b8eec6aed870c2 [2022-12-13 21:11:40,279 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:11:40,282 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:11:40,285 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:11:40,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:11:40,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:11:40,297 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:11:40" (1/1) ... [2022-12-13 21:11:40,300 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@114a680e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:40, skipping insertion in model container [2022-12-13 21:11:40,300 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:11:40" (1/1) ... [2022-12-13 21:11:40,311 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:11:40,340 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:11:40,448 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_b631c09c-f46a-4005-81b6-b0c1b4daa618/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-13 21:11:40,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,539 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:11:40,569 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:11:40,577 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_b631c09c-f46a-4005-81b6-b0c1b4daa618/sv-benchmarks/c/pthread-wmm/safe030_power.oepc_pso.oepc_rmo.oepc.i[970,983] [2022-12-13 21:11:40,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:40,611 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:40,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:11:40,631 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:11:40,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:40 WrapperNode [2022-12-13 21:11:40,632 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:11:40,633 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:11:40,633 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:11:40,633 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:11:40,638 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:40" (1/1) ... [2022-12-13 21:11:40,648 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:40" (1/1) ... [2022-12-13 21:11:40,666 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-12-13 21:11:40,666 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:11:40,666 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:11:40,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:11:40,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:11:40,673 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:40" (1/1) ... [2022-12-13 21:11:40,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:40" (1/1) ... [2022-12-13 21:11:40,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:40" (1/1) ... [2022-12-13 21:11:40,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:40" (1/1) ... [2022-12-13 21:11:40,681 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:40" (1/1) ... [2022-12-13 21:11:40,682 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:40" (1/1) ... [2022-12-13 21:11:40,684 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:40" (1/1) ... [2022-12-13 21:11:40,685 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:40" (1/1) ... [2022-12-13 21:11:40,687 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:11:40,687 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:11:40,687 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:11:40,687 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:11:40,688 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:40" (1/1) ... [2022-12-13 21:11:40,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:11:40,701 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b631c09c-f46a-4005-81b6-b0c1b4daa618/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:11:40,710 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b631c09c-f46a-4005-81b6-b0c1b4daa618/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:11:40,712 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b631c09c-f46a-4005-81b6-b0c1b4daa618/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:11:40,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:11:40,738 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 21:11:40,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:11:40,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:11:40,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:11:40,738 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 21:11:40,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 21:11:40,739 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 21:11:40,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 21:11:40,739 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 21:11:40,739 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 21:11:40,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:11:40,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 21:11:40,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:11:40,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:11:40,741 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 21:11:40,843 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:11:40,845 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:11:41,110 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:11:41,187 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:11:41,187 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 21:11:41,189 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:11:41 BoogieIcfgContainer [2022-12-13 21:11:41,189 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:11:41,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:11:41,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:11:41,194 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:11:41,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:11:40" (1/3) ... [2022-12-13 21:11:41,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa70da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:11:41, skipping insertion in model container [2022-12-13 21:11:41,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:40" (2/3) ... [2022-12-13 21:11:41,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fa70da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:11:41, skipping insertion in model container [2022-12-13 21:11:41,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:11:41" (3/3) ... [2022-12-13 21:11:41,196 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 21:11:41,202 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 21:11:41,211 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:11:41,211 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 21:11:41,211 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 21:11:41,253 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 21:11:41,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-12-13 21:11:41,314 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-13 21:11:41,314 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:11:41,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-13 21:11:41,318 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-12-13 21:11:41,321 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-12-13 21:11:41,323 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:11:41,331 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-13 21:11:41,333 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-13 21:11:41,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 229 flow [2022-12-13 21:11:41,350 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-13 21:11:41,350 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:11:41,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-12-13 21:11:41,352 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2022-12-13 21:11:45,145 INFO L134 LiptonReduction]: Checked pairs total: 4965 [2022-12-13 21:11:45,146 INFO L136 LiptonReduction]: Total number of compositions: 98 [2022-12-13 21:11:45,157 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:11:45,161 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;@7397182e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:11:45,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 21:11:45,163 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2022-12-13 21:11:45,163 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:11:45,163 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:45,164 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 21:11:45,164 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 21:11:45,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:45,168 INFO L85 PathProgramCache]: Analyzing trace with hash 484428, now seen corresponding path program 1 times [2022-12-13 21:11:45,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:45,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396344430] [2022-12-13 21:11:45,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:45,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:45,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:45,412 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 21:11:45,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:45,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396344430] [2022-12-13 21:11:45,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396344430] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:45,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:45,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:11:45,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510020770] [2022-12-13 21:11:45,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:45,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:11:45,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:45,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:11:45,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:11:45,444 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 211 [2022-12-13 21:11:45,446 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 23 transitions, 55 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 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 21:11:45,446 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:45,446 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 211 [2022-12-13 21:11:45,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:45,673 INFO L130 PetriNetUnfolder]: 711/1102 cut-off events. [2022-12-13 21:11:45,674 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-12-13 21:11:45,675 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2221 conditions, 1102 events. 711/1102 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 4813 event pairs, 299 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 2210. Up to 871 conditions per place. [2022-12-13 21:11:45,679 INFO L137 encePairwiseOnDemand]: 208/211 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2022-12-13 21:11:45,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 36 transitions, 153 flow [2022-12-13 21:11:45,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:11:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:11:45,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2022-12-13 21:11:45,692 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5229067930489731 [2022-12-13 21:11:45,692 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2022-12-13 21:11:45,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2022-12-13 21:11:45,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:45,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2022-12-13 21:11:45,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 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 21:11:45,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:45,703 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:45,704 INFO L175 Difference]: Start difference. First operand has 33 places, 23 transitions, 55 flow. Second operand 3 states and 331 transitions. [2022-12-13 21:11:45,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 36 transitions, 153 flow [2022-12-13 21:11:45,706 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 21:11:45,708 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2022-12-13 21:11:45,710 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=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 21:11:45,713 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-12-13 21:11:45,714 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2022-12-13 21:11:45,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 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 21:11:45,714 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:45,714 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:45,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:11:45,715 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 21:11:45,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:45,716 INFO L85 PathProgramCache]: Analyzing trace with hash -252099078, now seen corresponding path program 1 times [2022-12-13 21:11:45,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:45,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121435490] [2022-12-13 21:11:45,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:45,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:46,271 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 21:11:46,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:46,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121435490] [2022-12-13 21:11:46,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121435490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:46,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:46,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:11:46,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886923764] [2022-12-13 21:11:46,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:46,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:11:46,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:46,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:11:46,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:11:46,305 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 211 [2022-12-13 21:11:46,305 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 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 21:11:46,306 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:46,306 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 211 [2022-12-13 21:11:46,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:46,563 INFO L130 PetriNetUnfolder]: 1170/1834 cut-off events. [2022-12-13 21:11:46,563 INFO L131 PetriNetUnfolder]: For 102/102 co-relation queries the response was YES. [2022-12-13 21:11:46,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3772 conditions, 1834 events. 1170/1834 cut-off events. For 102/102 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 8671 event pairs, 189 based on Foata normal form. 44/1878 useless extension candidates. Maximal degree in co-relation 3762. Up to 1324 conditions per place. [2022-12-13 21:11:46,569 INFO L137 encePairwiseOnDemand]: 200/211 looper letters, 34 selfloop transitions, 12 changer transitions 0/47 dead transitions. [2022-12-13 21:11:46,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 47 transitions, 204 flow [2022-12-13 21:11:46,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:11:46,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:11:46,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 408 transitions. [2022-12-13 21:11:46,571 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4834123222748815 [2022-12-13 21:11:46,572 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 408 transitions. [2022-12-13 21:11:46,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 408 transitions. [2022-12-13 21:11:46,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:46,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 408 transitions. [2022-12-13 21:11:46,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.0) internal successors, (408), 4 states have internal predecessors, (408), 0 states have call successors, (0), 0 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 21:11:46,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:46,575 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:46,575 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 4 states and 408 transitions. [2022-12-13 21:11:46,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 47 transitions, 204 flow [2022-12-13 21:11:46,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 47 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:11:46,576 INFO L231 Difference]: Finished difference. Result has 34 places, 32 transitions, 140 flow [2022-12-13 21:11:46,576 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, 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=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=140, PETRI_PLACES=34, PETRI_TRANSITIONS=32} [2022-12-13 21:11:46,576 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2022-12-13 21:11:46,576 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 32 transitions, 140 flow [2022-12-13 21:11:46,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 states have internal predecessors, (369), 0 states have call successors, (0), 0 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 21:11:46,577 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:46,577 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:46,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:11:46,577 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 21:11:46,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:46,577 INFO L85 PathProgramCache]: Analyzing trace with hash 774861771, now seen corresponding path program 1 times [2022-12-13 21:11:46,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:46,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794576677] [2022-12-13 21:11:46,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:46,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:46,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:46,688 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 21:11:46,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:46,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794576677] [2022-12-13 21:11:46,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794576677] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:46,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:46,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:11:46,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525004434] [2022-12-13 21:11:46,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:46,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:11:46,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:46,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:11:46,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:11:46,692 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 211 [2022-12-13 21:11:46,693 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 32 transitions, 140 flow. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:46,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:46,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 211 [2022-12-13 21:11:46,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:46,904 INFO L130 PetriNetUnfolder]: 1079/1710 cut-off events. [2022-12-13 21:11:46,904 INFO L131 PetriNetUnfolder]: For 1040/1076 co-relation queries the response was YES. [2022-12-13 21:11:46,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5049 conditions, 1710 events. 1079/1710 cut-off events. For 1040/1076 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 8216 event pairs, 372 based on Foata normal form. 26/1734 useless extension candidates. Maximal degree in co-relation 5036. Up to 1511 conditions per place. [2022-12-13 21:11:46,911 INFO L137 encePairwiseOnDemand]: 207/211 looper letters, 37 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2022-12-13 21:11:46,911 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 270 flow [2022-12-13 21:11:46,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:11:46,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:11:46,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 323 transitions. [2022-12-13 21:11:46,912 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5102685624012638 [2022-12-13 21:11:46,912 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 323 transitions. [2022-12-13 21:11:46,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 323 transitions. [2022-12-13 21:11:46,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:46,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 323 transitions. [2022-12-13 21:11:46,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.66666666666667) internal successors, (323), 3 states have internal predecessors, (323), 0 states have call successors, (0), 0 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 21:11:46,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:46,915 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:46,915 INFO L175 Difference]: Start difference. First operand has 34 places, 32 transitions, 140 flow. Second operand 3 states and 323 transitions. [2022-12-13 21:11:46,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 270 flow [2022-12-13 21:11:46,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 45 transitions, 270 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 21:11:46,917 INFO L231 Difference]: Finished difference. Result has 37 places, 35 transitions, 174 flow [2022-12-13 21:11:46,917 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=37, PETRI_TRANSITIONS=35} [2022-12-13 21:11:46,917 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 4 predicate places. [2022-12-13 21:11:46,917 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 35 transitions, 174 flow [2022-12-13 21:11:46,917 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:46,918 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:46,918 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:46,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:11:46,918 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 21:11:46,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:46,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1750536707, now seen corresponding path program 1 times [2022-12-13 21:11:46,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:46,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014803039] [2022-12-13 21:11:46,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:46,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:47,327 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 21:11:47,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:47,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014803039] [2022-12-13 21:11:47,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014803039] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:47,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:47,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:11:47,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717921875] [2022-12-13 21:11:47,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:47,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:11:47,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:47,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:11:47,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:11:47,365 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 211 [2022-12-13 21:11:47,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 35 transitions, 174 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 21:11:47,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:47,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 211 [2022-12-13 21:11:47,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:47,714 INFO L130 PetriNetUnfolder]: 1465/2293 cut-off events. [2022-12-13 21:11:47,714 INFO L131 PetriNetUnfolder]: For 1657/1657 co-relation queries the response was YES. [2022-12-13 21:11:47,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7058 conditions, 2293 events. 1465/2293 cut-off events. For 1657/1657 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 11619 event pairs, 264 based on Foata normal form. 60/2353 useless extension candidates. Maximal degree in co-relation 7042. Up to 1152 conditions per place. [2022-12-13 21:11:47,723 INFO L137 encePairwiseOnDemand]: 200/211 looper letters, 43 selfloop transitions, 22 changer transitions 0/66 dead transitions. [2022-12-13 21:11:47,724 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 66 transitions, 431 flow [2022-12-13 21:11:47,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:11:47,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:11:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 409 transitions. [2022-12-13 21:11:47,725 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48459715639810425 [2022-12-13 21:11:47,725 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 409 transitions. [2022-12-13 21:11:47,725 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 409 transitions. [2022-12-13 21:11:47,725 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:47,725 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 409 transitions. [2022-12-13 21:11:47,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 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 21:11:47,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:47,727 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:47,728 INFO L175 Difference]: Start difference. First operand has 37 places, 35 transitions, 174 flow. Second operand 4 states and 409 transitions. [2022-12-13 21:11:47,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 66 transitions, 431 flow [2022-12-13 21:11:47,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 426 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:11:47,730 INFO L231 Difference]: Finished difference. Result has 42 places, 48 transitions, 358 flow [2022-12-13 21:11:47,730 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=358, PETRI_PLACES=42, PETRI_TRANSITIONS=48} [2022-12-13 21:11:47,730 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 9 predicate places. [2022-12-13 21:11:47,730 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 48 transitions, 358 flow [2022-12-13 21:11:47,731 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 21:11:47,731 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:47,731 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:47,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:11:47,731 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 21:11:47,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:47,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1750488657, now seen corresponding path program 1 times [2022-12-13 21:11:47,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:47,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68170118] [2022-12-13 21:11:47,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:47,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:47,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:48,115 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 21:11:48,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:48,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68170118] [2022-12-13 21:11:48,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68170118] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:48,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:48,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:11:48,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586049653] [2022-12-13 21:11:48,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:48,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:11:48,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:48,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:11:48,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:11:48,136 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 211 [2022-12-13 21:11:48,137 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 48 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:48,137 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:48,137 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 211 [2022-12-13 21:11:48,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:48,476 INFO L130 PetriNetUnfolder]: 1684/2584 cut-off events. [2022-12-13 21:11:48,476 INFO L131 PetriNetUnfolder]: For 4522/4706 co-relation queries the response was YES. [2022-12-13 21:11:48,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9465 conditions, 2584 events. 1684/2584 cut-off events. For 4522/4706 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 12904 event pairs, 581 based on Foata normal form. 125/2662 useless extension candidates. Maximal degree in co-relation 9445. Up to 2276 conditions per place. [2022-12-13 21:11:48,488 INFO L137 encePairwiseOnDemand]: 203/211 looper letters, 54 selfloop transitions, 12 changer transitions 2/78 dead transitions. [2022-12-13 21:11:48,488 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 78 transitions, 664 flow [2022-12-13 21:11:48,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:11:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:11:48,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2022-12-13 21:11:48,490 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5071090047393365 [2022-12-13 21:11:48,490 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2022-12-13 21:11:48,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2022-12-13 21:11:48,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:48,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2022-12-13 21:11:48,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 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 21:11:48,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:48,493 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:48,493 INFO L175 Difference]: Start difference. First operand has 42 places, 48 transitions, 358 flow. Second operand 4 states and 428 transitions. [2022-12-13 21:11:48,493 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 78 transitions, 664 flow [2022-12-13 21:11:48,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 78 transitions, 664 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 21:11:48,498 INFO L231 Difference]: Finished difference. Result has 47 places, 58 transitions, 475 flow [2022-12-13 21:11:48,499 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=475, PETRI_PLACES=47, PETRI_TRANSITIONS=58} [2022-12-13 21:11:48,499 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2022-12-13 21:11:48,499 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 58 transitions, 475 flow [2022-12-13 21:11:48,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:48,500 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:48,500 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:48,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:11:48,500 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 21:11:48,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:48,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1555721218, now seen corresponding path program 1 times [2022-12-13 21:11:48,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:48,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453324834] [2022-12-13 21:11:48,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:48,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:48,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:48,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:11:48,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:48,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453324834] [2022-12-13 21:11:48,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453324834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:48,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:48,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:11:48,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647504590] [2022-12-13 21:11:48,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:48,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:11:48,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:48,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:11:48,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:11:48,598 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 211 [2022-12-13 21:11:48,599 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 58 transitions, 475 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 21:11:48,599 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:48,599 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 211 [2022-12-13 21:11:48,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:48,984 INFO L130 PetriNetUnfolder]: 2132/3419 cut-off events. [2022-12-13 21:11:48,984 INFO L131 PetriNetUnfolder]: For 9394/9489 co-relation queries the response was YES. [2022-12-13 21:11:48,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13671 conditions, 3419 events. 2132/3419 cut-off events. For 9394/9489 co-relation queries the response was YES. Maximal size of possible extension queue 220. Compared 19557 event pairs, 657 based on Foata normal form. 116/3503 useless extension candidates. Maximal degree in co-relation 13647. Up to 1790 conditions per place. [2022-12-13 21:11:48,996 INFO L137 encePairwiseOnDemand]: 208/211 looper letters, 59 selfloop transitions, 8 changer transitions 7/79 dead transitions. [2022-12-13 21:11:48,996 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 79 transitions, 749 flow [2022-12-13 21:11:48,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:11:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:11:48,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 325 transitions. [2022-12-13 21:11:48,998 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5134281200631912 [2022-12-13 21:11:48,998 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 325 transitions. [2022-12-13 21:11:48,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 325 transitions. [2022-12-13 21:11:48,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:48,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 325 transitions. [2022-12-13 21:11:48,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 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 21:11:49,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:49,001 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:49,001 INFO L175 Difference]: Start difference. First operand has 47 places, 58 transitions, 475 flow. Second operand 3 states and 325 transitions. [2022-12-13 21:11:49,001 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 79 transitions, 749 flow [2022-12-13 21:11:49,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 79 transitions, 741 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-13 21:11:49,011 INFO L231 Difference]: Finished difference. Result has 50 places, 54 transitions, 455 flow [2022-12-13 21:11:49,011 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=50, PETRI_TRANSITIONS=54} [2022-12-13 21:11:49,011 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2022-12-13 21:11:49,012 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 54 transitions, 455 flow [2022-12-13 21:11:49,012 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 21:11:49,012 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:49,012 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:49,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:11:49,012 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 21:11:49,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:49,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1903076838, now seen corresponding path program 1 times [2022-12-13 21:11:49,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:49,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186536240] [2022-12-13 21:11:49,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:49,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:49,527 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 21:11:49,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:49,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186536240] [2022-12-13 21:11:49,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186536240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:49,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:49,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:11:49,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021798721] [2022-12-13 21:11:49,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:49,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:11:49,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:49,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:11:49,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:11:49,551 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 211 [2022-12-13 21:11:49,552 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 54 transitions, 455 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:49,552 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:49,552 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 211 [2022-12-13 21:11:49,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:49,971 INFO L130 PetriNetUnfolder]: 2298/3597 cut-off events. [2022-12-13 21:11:49,971 INFO L131 PetriNetUnfolder]: For 9789/10016 co-relation queries the response was YES. [2022-12-13 21:11:49,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14533 conditions, 3597 events. 2298/3597 cut-off events. For 9789/10016 co-relation queries the response was YES. Maximal size of possible extension queue 226. Compared 19926 event pairs, 631 based on Foata normal form. 195/3749 useless extension candidates. Maximal degree in co-relation 14507. Up to 3246 conditions per place. [2022-12-13 21:11:49,982 INFO L137 encePairwiseOnDemand]: 204/211 looper letters, 69 selfloop transitions, 17 changer transitions 1/95 dead transitions. [2022-12-13 21:11:49,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 95 transitions, 934 flow [2022-12-13 21:11:49,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:11:49,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:11:49,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 426 transitions. [2022-12-13 21:11:49,984 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.504739336492891 [2022-12-13 21:11:49,984 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 426 transitions. [2022-12-13 21:11:49,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 426 transitions. [2022-12-13 21:11:49,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:49,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 426 transitions. [2022-12-13 21:11:49,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.5) internal successors, (426), 4 states have internal predecessors, (426), 0 states have call successors, (0), 0 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 21:11:49,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:49,986 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:49,986 INFO L175 Difference]: Start difference. First operand has 50 places, 54 transitions, 455 flow. Second operand 4 states and 426 transitions. [2022-12-13 21:11:49,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 95 transitions, 934 flow [2022-12-13 21:11:49,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 95 transitions, 915 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 21:11:49,993 INFO L231 Difference]: Finished difference. Result has 54 places, 69 transitions, 645 flow [2022-12-13 21:11:49,993 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=645, PETRI_PLACES=54, PETRI_TRANSITIONS=69} [2022-12-13 21:11:49,993 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 21 predicate places. [2022-12-13 21:11:49,994 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 69 transitions, 645 flow [2022-12-13 21:11:49,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:49,994 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:49,994 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:49,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:11:49,994 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 21:11:49,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:49,994 INFO L85 PathProgramCache]: Analyzing trace with hash 165139212, now seen corresponding path program 2 times [2022-12-13 21:11:49,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:49,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104614255] [2022-12-13 21:11:49,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:49,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:50,284 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 21:11:50,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:50,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104614255] [2022-12-13 21:11:50,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104614255] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:50,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:50,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:11:50,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652687217] [2022-12-13 21:11:50,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:50,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:11:50,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:50,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:11:50,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:11:50,302 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 211 [2022-12-13 21:11:50,303 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 69 transitions, 645 flow. Second operand has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:50,303 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:50,303 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 211 [2022-12-13 21:11:50,303 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:50,802 INFO L130 PetriNetUnfolder]: 2329/3652 cut-off events. [2022-12-13 21:11:50,802 INFO L131 PetriNetUnfolder]: For 13575/13859 co-relation queries the response was YES. [2022-12-13 21:11:50,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16392 conditions, 3652 events. 2329/3652 cut-off events. For 13575/13859 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 20255 event pairs, 624 based on Foata normal form. 248/3876 useless extension candidates. Maximal degree in co-relation 16363. Up to 3127 conditions per place. [2022-12-13 21:11:50,814 INFO L137 encePairwiseOnDemand]: 205/211 looper letters, 74 selfloop transitions, 22 changer transitions 1/105 dead transitions. [2022-12-13 21:11:50,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 105 transitions, 1103 flow [2022-12-13 21:11:50,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:11:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:11:50,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 428 transitions. [2022-12-13 21:11:50,816 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5071090047393365 [2022-12-13 21:11:50,816 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 428 transitions. [2022-12-13 21:11:50,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 428 transitions. [2022-12-13 21:11:50,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:50,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 428 transitions. [2022-12-13 21:11:50,817 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.0) internal successors, (428), 4 states have internal predecessors, (428), 0 states have call successors, (0), 0 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 21:11:50,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:50,818 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:50,818 INFO L175 Difference]: Start difference. First operand has 54 places, 69 transitions, 645 flow. Second operand 4 states and 428 transitions. [2022-12-13 21:11:50,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 105 transitions, 1103 flow [2022-12-13 21:11:50,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 105 transitions, 1101 flow, removed 1 selfloop flow, removed 0 redundant places. [2022-12-13 21:11:50,826 INFO L231 Difference]: Finished difference. Result has 58 places, 75 transitions, 778 flow [2022-12-13 21:11:50,826 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=778, PETRI_PLACES=58, PETRI_TRANSITIONS=75} [2022-12-13 21:11:50,826 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 25 predicate places. [2022-12-13 21:11:50,826 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 75 transitions, 778 flow [2022-12-13 21:11:50,827 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.4) internal successors, (492), 5 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:50,827 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:50,827 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:50,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:11:50,827 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 21:11:50,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:50,827 INFO L85 PathProgramCache]: Analyzing trace with hash 165044011, now seen corresponding path program 1 times [2022-12-13 21:11:50,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:50,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672696262] [2022-12-13 21:11:50,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:50,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:50,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:51,047 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 21:11:51,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:51,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672696262] [2022-12-13 21:11:51,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672696262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:51,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:51,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:11:51,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425719466] [2022-12-13 21:11:51,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:51,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:11:51,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:51,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:11:51,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:11:51,059 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 211 [2022-12-13 21:11:51,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 75 transitions, 778 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 21:11:51,060 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:51,060 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 211 [2022-12-13 21:11:51,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:51,502 INFO L130 PetriNetUnfolder]: 2284/3584 cut-off events. [2022-12-13 21:11:51,502 INFO L131 PetriNetUnfolder]: For 17050/17361 co-relation queries the response was YES. [2022-12-13 21:11:51,509 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17402 conditions, 3584 events. 2284/3584 cut-off events. For 17050/17361 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 19870 event pairs, 844 based on Foata normal form. 189/3740 useless extension candidates. Maximal degree in co-relation 17370. Up to 3064 conditions per place. [2022-12-13 21:11:51,518 INFO L137 encePairwiseOnDemand]: 204/211 looper letters, 71 selfloop transitions, 19 changer transitions 4/102 dead transitions. [2022-12-13 21:11:51,518 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 102 transitions, 1164 flow [2022-12-13 21:11:51,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:11:51,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:11:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 429 transitions. [2022-12-13 21:11:51,520 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5082938388625592 [2022-12-13 21:11:51,520 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 429 transitions. [2022-12-13 21:11:51,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 429 transitions. [2022-12-13 21:11:51,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:51,520 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 429 transitions. [2022-12-13 21:11:51,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 107.25) internal successors, (429), 4 states have internal predecessors, (429), 0 states have call successors, (0), 0 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 21:11:51,523 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:51,523 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:51,523 INFO L175 Difference]: Start difference. First operand has 58 places, 75 transitions, 778 flow. Second operand 4 states and 429 transitions. [2022-12-13 21:11:51,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 102 transitions, 1164 flow [2022-12-13 21:11:51,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 102 transitions, 1125 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-13 21:11:51,539 INFO L231 Difference]: Finished difference. Result has 61 places, 80 transitions, 860 flow [2022-12-13 21:11:51,539 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=860, PETRI_PLACES=61, PETRI_TRANSITIONS=80} [2022-12-13 21:11:51,539 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 28 predicate places. [2022-12-13 21:11:51,539 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 80 transitions, 860 flow [2022-12-13 21:11:51,540 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 21:11:51,540 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:51,540 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:51,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:11:51,540 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 21:11:51,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:51,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1043842054, now seen corresponding path program 1 times [2022-12-13 21:11:51,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:51,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854059946] [2022-12-13 21:11:51,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:51,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:51,985 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 21:11:51,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:51,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854059946] [2022-12-13 21:11:51,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854059946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:51,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:51,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:11:51,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182811023] [2022-12-13 21:11:51,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:51,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:11:51,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:51,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:11:51,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:11:52,024 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 211 [2022-12-13 21:11:52,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 80 transitions, 860 flow. Second operand has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 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 21:11:52,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:52,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 211 [2022-12-13 21:11:52,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:52,583 INFO L130 PetriNetUnfolder]: 2946/4549 cut-off events. [2022-12-13 21:11:52,583 INFO L131 PetriNetUnfolder]: For 19856/19856 co-relation queries the response was YES. [2022-12-13 21:11:52,590 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21994 conditions, 4549 events. 2946/4549 cut-off events. For 19856/19856 co-relation queries the response was YES. Maximal size of possible extension queue 263. Compared 24940 event pairs, 759 based on Foata normal form. 16/4565 useless extension candidates. Maximal degree in co-relation 21960. Up to 3193 conditions per place. [2022-12-13 21:11:52,596 INFO L137 encePairwiseOnDemand]: 201/211 looper letters, 60 selfloop transitions, 44 changer transitions 7/111 dead transitions. [2022-12-13 21:11:52,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 111 transitions, 1337 flow [2022-12-13 21:11:52,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:11:52,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:11:52,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 392 transitions. [2022-12-13 21:11:52,598 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46445497630331756 [2022-12-13 21:11:52,598 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 392 transitions. [2022-12-13 21:11:52,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 392 transitions. [2022-12-13 21:11:52,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:52,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 392 transitions. [2022-12-13 21:11:52,598 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.0) internal successors, (392), 4 states have internal predecessors, (392), 0 states have call successors, (0), 0 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 21:11:52,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:52,599 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:52,599 INFO L175 Difference]: Start difference. First operand has 61 places, 80 transitions, 860 flow. Second operand 4 states and 392 transitions. [2022-12-13 21:11:52,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 111 transitions, 1337 flow [2022-12-13 21:11:52,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 111 transitions, 1316 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 21:11:52,616 INFO L231 Difference]: Finished difference. Result has 65 places, 93 transitions, 1169 flow [2022-12-13 21:11:52,616 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=841, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1169, PETRI_PLACES=65, PETRI_TRANSITIONS=93} [2022-12-13 21:11:52,616 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 32 predicate places. [2022-12-13 21:11:52,616 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 93 transitions, 1169 flow [2022-12-13 21:11:52,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.16666666666667) internal successors, (541), 6 states have internal predecessors, (541), 0 states have call successors, (0), 0 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 21:11:52,617 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:52,617 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:52,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 21:11:52,617 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 21:11:52,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:52,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1243029668, now seen corresponding path program 2 times [2022-12-13 21:11:52,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:52,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531806155] [2022-12-13 21:11:52,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:52,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:52,907 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 21:11:52,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:52,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531806155] [2022-12-13 21:11:52,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531806155] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:52,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:52,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:11:52,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230064469] [2022-12-13 21:11:52,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:52,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:11:52,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:52,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:11:52,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:11:52,930 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 211 [2022-12-13 21:11:52,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 93 transitions, 1169 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 21:11:52,931 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:52,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 211 [2022-12-13 21:11:52,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:53,543 INFO L130 PetriNetUnfolder]: 2847/4510 cut-off events. [2022-12-13 21:11:53,544 INFO L131 PetriNetUnfolder]: For 30203/30431 co-relation queries the response was YES. [2022-12-13 21:11:53,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25975 conditions, 4510 events. 2847/4510 cut-off events. For 30203/30431 co-relation queries the response was YES. Maximal size of possible extension queue 312. Compared 26242 event pairs, 723 based on Foata normal form. 186/4653 useless extension candidates. Maximal degree in co-relation 25938. Up to 3130 conditions per place. [2022-12-13 21:11:53,558 INFO L137 encePairwiseOnDemand]: 204/211 looper letters, 97 selfloop transitions, 27 changer transitions 12/147 dead transitions. [2022-12-13 21:11:53,558 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 147 transitions, 2019 flow [2022-12-13 21:11:53,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:11:53,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:11:53,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 630 transitions. [2022-12-13 21:11:53,559 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4976303317535545 [2022-12-13 21:11:53,560 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 630 transitions. [2022-12-13 21:11:53,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 630 transitions. [2022-12-13 21:11:53,560 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:53,560 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 630 transitions. [2022-12-13 21:11:53,561 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 105.0) internal successors, (630), 6 states have internal predecessors, (630), 0 states have call successors, (0), 0 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 21:11:53,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:53,562 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:53,562 INFO L175 Difference]: Start difference. First operand has 65 places, 93 transitions, 1169 flow. Second operand 6 states and 630 transitions. [2022-12-13 21:11:53,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 147 transitions, 2019 flow [2022-12-13 21:11:53,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 147 transitions, 2018 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 21:11:53,582 INFO L231 Difference]: Finished difference. Result has 70 places, 102 transitions, 1393 flow [2022-12-13 21:11:53,583 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=1168, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1393, PETRI_PLACES=70, PETRI_TRANSITIONS=102} [2022-12-13 21:11:53,583 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 37 predicate places. [2022-12-13 21:11:53,583 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 102 transitions, 1393 flow [2022-12-13 21:11:53,583 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 21:11:53,583 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:53,583 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:53,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 21:11:53,584 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 21:11:53,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:53,584 INFO L85 PathProgramCache]: Analyzing trace with hash 294474699, now seen corresponding path program 1 times [2022-12-13 21:11:53,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:53,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300100946] [2022-12-13 21:11:53,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:53,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:53,675 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 21:11:53,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:53,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300100946] [2022-12-13 21:11:53,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300100946] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:53,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:53,676 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:11:53,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854435634] [2022-12-13 21:11:53,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:53,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:11:53,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:53,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:11:53,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:11:53,687 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 211 [2022-12-13 21:11:53,688 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 102 transitions, 1393 flow. Second operand has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 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 21:11:53,688 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:53,688 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 211 [2022-12-13 21:11:53,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:54,139 INFO L130 PetriNetUnfolder]: 1931/3281 cut-off events. [2022-12-13 21:11:54,140 INFO L131 PetriNetUnfolder]: For 37918/38759 co-relation queries the response was YES. [2022-12-13 21:11:54,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20623 conditions, 3281 events. 1931/3281 cut-off events. For 37918/38759 co-relation queries the response was YES. Maximal size of possible extension queue 284. Compared 21039 event pairs, 167 based on Foata normal form. 974/4226 useless extension candidates. Maximal degree in co-relation 20584. Up to 1803 conditions per place. [2022-12-13 21:11:54,150 INFO L137 encePairwiseOnDemand]: 205/211 looper letters, 120 selfloop transitions, 5 changer transitions 26/169 dead transitions. [2022-12-13 21:11:54,150 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 169 transitions, 2582 flow [2022-12-13 21:11:54,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:11:54,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:11:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 419 transitions. [2022-12-13 21:11:54,151 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49644549763033174 [2022-12-13 21:11:54,151 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 419 transitions. [2022-12-13 21:11:54,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 419 transitions. [2022-12-13 21:11:54,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:54,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 419 transitions. [2022-12-13 21:11:54,152 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.75) internal successors, (419), 4 states have internal predecessors, (419), 0 states have call successors, (0), 0 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 21:11:54,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:54,153 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:54,153 INFO L175 Difference]: Start difference. First operand has 70 places, 102 transitions, 1393 flow. Second operand 4 states and 419 transitions. [2022-12-13 21:11:54,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 169 transitions, 2582 flow [2022-12-13 21:11:54,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 169 transitions, 2518 flow, removed 27 selfloop flow, removed 2 redundant places. [2022-12-13 21:11:54,171 INFO L231 Difference]: Finished difference. Result has 73 places, 90 transitions, 1199 flow [2022-12-13 21:11:54,171 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=1220, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1199, PETRI_PLACES=73, PETRI_TRANSITIONS=90} [2022-12-13 21:11:54,172 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 40 predicate places. [2022-12-13 21:11:54,172 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 90 transitions, 1199 flow [2022-12-13 21:11:54,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 0 states have call successors, (0), 0 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 21:11:54,172 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:54,172 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:54,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 21:11:54,172 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 21:11:54,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:54,173 INFO L85 PathProgramCache]: Analyzing trace with hash -570549339, now seen corresponding path program 1 times [2022-12-13 21:11:54,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:54,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6525582] [2022-12-13 21:11:54,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:54,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:54,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 21:11:54,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:54,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6525582] [2022-12-13 21:11:54,264 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6525582] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:54,264 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:54,264 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:11:54,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652783164] [2022-12-13 21:11:54,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:54,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:11:54,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:54,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:11:54,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:11:54,277 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 211 [2022-12-13 21:11:54,278 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 90 transitions, 1199 flow. Second operand has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 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 21:11:54,278 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:54,278 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 211 [2022-12-13 21:11:54,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:54,672 INFO L130 PetriNetUnfolder]: 1445/2537 cut-off events. [2022-12-13 21:11:54,673 INFO L131 PetriNetUnfolder]: For 29345/29987 co-relation queries the response was YES. [2022-12-13 21:11:54,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16512 conditions, 2537 events. 1445/2537 cut-off events. For 29345/29987 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 16130 event pairs, 159 based on Foata normal form. 691/3194 useless extension candidates. Maximal degree in co-relation 16471. Up to 1288 conditions per place. [2022-12-13 21:11:54,681 INFO L137 encePairwiseOnDemand]: 205/211 looper letters, 98 selfloop transitions, 8 changer transitions 35/155 dead transitions. [2022-12-13 21:11:54,681 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 155 transitions, 2270 flow [2022-12-13 21:11:54,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:11:54,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:11:54,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-12-13 21:11:54,682 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4976303317535545 [2022-12-13 21:11:54,682 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2022-12-13 21:11:54,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2022-12-13 21:11:54,682 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:54,682 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2022-12-13 21:11:54,683 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 21:11:54,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:54,684 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:54,684 INFO L175 Difference]: Start difference. First operand has 73 places, 90 transitions, 1199 flow. Second operand 5 states and 525 transitions. [2022-12-13 21:11:54,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 155 transitions, 2270 flow [2022-12-13 21:11:54,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 155 transitions, 2259 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 21:11:54,704 INFO L231 Difference]: Finished difference. Result has 77 places, 76 transitions, 978 flow [2022-12-13 21:11:54,704 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=1175, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=978, PETRI_PLACES=77, PETRI_TRANSITIONS=76} [2022-12-13 21:11:54,705 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 44 predicate places. [2022-12-13 21:11:54,705 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 76 transitions, 978 flow [2022-12-13 21:11:54,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 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 21:11:54,705 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:54,705 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 21:11:54,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 21:11:54,705 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 21:11:54,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:54,705 INFO L85 PathProgramCache]: Analyzing trace with hash 101126209, now seen corresponding path program 1 times [2022-12-13 21:11:54,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:54,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257499012] [2022-12-13 21:11:54,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:54,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:54,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 21:11:54,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:54,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257499012] [2022-12-13 21:11:54,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257499012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:54,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:54,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:11:54,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301016197] [2022-12-13 21:11:54,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:54,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:11:54,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:54,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:11:54,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:11:54,829 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 211 [2022-12-13 21:11:54,830 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 76 transitions, 978 flow. Second operand has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 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 21:11:54,830 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:54,830 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 211 [2022-12-13 21:11:54,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:55,170 INFO L130 PetriNetUnfolder]: 1182/2179 cut-off events. [2022-12-13 21:11:55,170 INFO L131 PetriNetUnfolder]: For 22832/23234 co-relation queries the response was YES. [2022-12-13 21:11:55,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14398 conditions, 2179 events. 1182/2179 cut-off events. For 22832/23234 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 14432 event pairs, 154 based on Foata normal form. 343/2498 useless extension candidates. Maximal degree in co-relation 14355. Up to 1011 conditions per place. [2022-12-13 21:11:55,177 INFO L137 encePairwiseOnDemand]: 205/211 looper letters, 45 selfloop transitions, 11 changer transitions 56/116 dead transitions. [2022-12-13 21:11:55,177 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 116 transitions, 1665 flow [2022-12-13 21:11:55,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:11:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:11:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 611 transitions. [2022-12-13 21:11:55,179 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4826224328593997 [2022-12-13 21:11:55,179 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 611 transitions. [2022-12-13 21:11:55,179 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 611 transitions. [2022-12-13 21:11:55,179 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:55,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 611 transitions. [2022-12-13 21:11:55,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.83333333333333) internal successors, (611), 6 states have internal predecessors, (611), 0 states have call successors, (0), 0 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 21:11:55,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:55,181 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:55,181 INFO L175 Difference]: Start difference. First operand has 77 places, 76 transitions, 978 flow. Second operand 6 states and 611 transitions. [2022-12-13 21:11:55,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 116 transitions, 1665 flow [2022-12-13 21:11:55,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 116 transitions, 1560 flow, removed 35 selfloop flow, removed 5 redundant places. [2022-12-13 21:11:55,202 INFO L231 Difference]: Finished difference. Result has 79 places, 39 transitions, 453 flow [2022-12-13 21:11:55,202 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=904, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=453, PETRI_PLACES=79, PETRI_TRANSITIONS=39} [2022-12-13 21:11:55,202 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 46 predicate places. [2022-12-13 21:11:55,202 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 39 transitions, 453 flow [2022-12-13 21:11:55,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 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 21:11:55,203 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:55,203 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 21:11:55,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 21:11:55,203 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 21:11:55,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:55,203 INFO L85 PathProgramCache]: Analyzing trace with hash 723872445, now seen corresponding path program 1 times [2022-12-13 21:11:55,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:55,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379859012] [2022-12-13 21:11:55,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:55,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:55,670 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 21:11:55,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:55,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379859012] [2022-12-13 21:11:55,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379859012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:55,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:55,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:11:55,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631914035] [2022-12-13 21:11:55,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:55,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:11:55,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:55,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:11:55,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:11:55,717 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 211 [2022-12-13 21:11:55,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 39 transitions, 453 flow. Second operand has 7 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:55,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:55,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 211 [2022-12-13 21:11:55,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:55,879 INFO L130 PetriNetUnfolder]: 130/263 cut-off events. [2022-12-13 21:11:55,879 INFO L131 PetriNetUnfolder]: For 1815/1815 co-relation queries the response was YES. [2022-12-13 21:11:55,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1688 conditions, 263 events. 130/263 cut-off events. For 1815/1815 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 862 event pairs, 13 based on Foata normal form. 1/264 useless extension candidates. Maximal degree in co-relation 1645. Up to 181 conditions per place. [2022-12-13 21:11:55,881 INFO L137 encePairwiseOnDemand]: 205/211 looper letters, 41 selfloop transitions, 12 changer transitions 6/61 dead transitions. [2022-12-13 21:11:55,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 61 transitions, 753 flow [2022-12-13 21:11:55,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:11:55,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:11:55,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2022-12-13 21:11:55,883 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4824644549763033 [2022-12-13 21:11:55,883 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2022-12-13 21:11:55,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2022-12-13 21:11:55,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:55,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2022-12-13 21:11:55,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 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 21:11:55,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:55,886 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:55,886 INFO L175 Difference]: Start difference. First operand has 79 places, 39 transitions, 453 flow. Second operand 5 states and 509 transitions. [2022-12-13 21:11:55,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 61 transitions, 753 flow [2022-12-13 21:11:55,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 61 transitions, 425 flow, removed 58 selfloop flow, removed 34 redundant places. [2022-12-13 21:11:55,892 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 269 flow [2022-12-13 21:11:55,893 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=269, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2022-12-13 21:11:55,893 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 15 predicate places. [2022-12-13 21:11:55,893 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 269 flow [2022-12-13 21:11:55,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.71428571428571) internal successors, (677), 7 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:55,894 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:55,894 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 21:11:55,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 21:11:55,894 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 21:11:55,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:55,894 INFO L85 PathProgramCache]: Analyzing trace with hash -922695875, now seen corresponding path program 2 times [2022-12-13 21:11:55,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:55,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624762084] [2022-12-13 21:11:55,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:55,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:55,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:56,388 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 21:11:56,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:56,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624762084] [2022-12-13 21:11:56,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624762084] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:56,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:56,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 21:11:56,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694734258] [2022-12-13 21:11:56,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:56,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 21:11:56,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:56,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 21:11:56,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-12-13 21:11:56,428 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 211 [2022-12-13 21:11:56,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 269 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 21:11:56,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:56,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 211 [2022-12-13 21:11:56,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:56,568 INFO L130 PetriNetUnfolder]: 132/279 cut-off events. [2022-12-13 21:11:56,568 INFO L131 PetriNetUnfolder]: For 665/665 co-relation queries the response was YES. [2022-12-13 21:11:56,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1172 conditions, 279 events. 132/279 cut-off events. For 665/665 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 976 event pairs, 13 based on Foata normal form. 1/280 useless extension candidates. Maximal degree in co-relation 1153. Up to 145 conditions per place. [2022-12-13 21:11:56,569 INFO L137 encePairwiseOnDemand]: 205/211 looper letters, 35 selfloop transitions, 10 changer transitions 21/68 dead transitions. [2022-12-13 21:11:56,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 68 transitions, 520 flow [2022-12-13 21:11:56,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:11:56,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:11:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2022-12-13 21:11:56,571 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4881516587677725 [2022-12-13 21:11:56,571 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 618 transitions. [2022-12-13 21:11:56,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 618 transitions. [2022-12-13 21:11:56,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:56,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 618 transitions. [2022-12-13 21:11:56,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 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 21:11:56,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:56,575 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:56,575 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 269 flow. Second operand 6 states and 618 transitions. [2022-12-13 21:11:56,575 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 68 transitions, 520 flow [2022-12-13 21:11:56,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 68 transitions, 467 flow, removed 20 selfloop flow, removed 4 redundant places. [2022-12-13 21:11:56,578 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 238 flow [2022-12-13 21:11:56,578 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=227, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=238, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2022-12-13 21:11:56,578 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2022-12-13 21:11:56,578 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 238 flow [2022-12-13 21:11:56,579 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 21:11:56,579 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:56,579 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 21:11:56,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 21:11:56,579 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 21:11:56,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:56,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1758033383, now seen corresponding path program 3 times [2022-12-13 21:11:56,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:56,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665064150] [2022-12-13 21:11:56,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:56,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:56,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:11:56,609 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:11:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:11:56,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:11:56,657 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:11:56,658 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 21:11:56,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 21:11:56,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 21:11:56,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 21:11:56,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 21:11:56,660 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 21:11:56,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 21:11:56,661 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:56,666 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 21:11:56,666 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:11:56,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:11:56 BasicIcfg [2022-12-13 21:11:56,701 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:11:56,701 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:11:56,701 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:11:56,701 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:11:56,702 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:11:41" (3/4) ... [2022-12-13 21:11:56,703 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 21:11:56,747 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b631c09c-f46a-4005-81b6-b0c1b4daa618/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 21:11:56,747 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:11:56,748 INFO L158 Benchmark]: Toolchain (without parser) took 16466.70ms. Allocated memory was 130.0MB in the beginning and 501.2MB in the end (delta: 371.2MB). Free memory was 98.0MB in the beginning and 205.5MB in the end (delta: -107.5MB). Peak memory consumption was 265.9MB. Max. memory is 16.1GB. [2022-12-13 21:11:56,748 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 130.0MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:11:56,749 INFO L158 Benchmark]: CACSL2BoogieTranslator took 346.85ms. Allocated memory is still 130.0MB. Free memory was 97.6MB in the beginning and 71.4MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 21:11:56,749 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.51ms. Allocated memory is still 130.0MB. Free memory was 71.4MB in the beginning and 68.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:11:56,749 INFO L158 Benchmark]: Boogie Preprocessor took 20.28ms. Allocated memory is still 130.0MB. Free memory was 68.5MB in the beginning and 66.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:11:56,750 INFO L158 Benchmark]: RCFGBuilder took 502.32ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 66.9MB in the beginning and 110.6MB in the end (delta: -43.7MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2022-12-13 21:11:56,750 INFO L158 Benchmark]: TraceAbstraction took 15509.82ms. Allocated memory was 157.3MB in the beginning and 501.2MB in the end (delta: 343.9MB). Free memory was 110.4MB in the beginning and 214.9MB in the end (delta: -104.5MB). Peak memory consumption was 239.4MB. Max. memory is 16.1GB. [2022-12-13 21:11:56,750 INFO L158 Benchmark]: Witness Printer took 46.27ms. Allocated memory is still 501.2MB. Free memory was 214.9MB in the beginning and 205.5MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 21:11:56,752 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.12ms. Allocated memory is still 130.0MB. Free memory is still 102.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 346.85ms. Allocated memory is still 130.0MB. Free memory was 97.6MB in the beginning and 71.4MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.51ms. Allocated memory is still 130.0MB. Free memory was 71.4MB in the beginning and 68.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.28ms. Allocated memory is still 130.0MB. Free memory was 68.5MB in the beginning and 66.9MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 502.32ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 66.9MB in the beginning and 110.6MB in the end (delta: -43.7MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * TraceAbstraction took 15509.82ms. Allocated memory was 157.3MB in the beginning and 501.2MB in the end (delta: 343.9MB). Free memory was 110.4MB in the beginning and 214.9MB in the end (delta: -104.5MB). Peak memory consumption was 239.4MB. Max. memory is 16.1GB. * Witness Printer took 46.27ms. Allocated memory is still 501.2MB. Free memory was 214.9MB in the beginning and 205.5MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.8s, 118 PlacesBefore, 33 PlacesAfterwards, 110 TransitionsBefore, 23 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 6 FixpointIterations, 39 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 98 TotalNumberOfCompositions, 4965 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2384, independent: 2232, independent conditional: 0, independent unconditional: 2232, dependent: 152, dependent conditional: 0, dependent unconditional: 152, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1138, independent: 1099, independent conditional: 0, independent unconditional: 1099, dependent: 39, dependent conditional: 0, dependent unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2384, independent: 1133, independent conditional: 0, independent unconditional: 1133, dependent: 113, dependent conditional: 0, dependent unconditional: 113, unknown: 1138, unknown conditional: 0, unknown unconditional: 1138] , Statistics on independence cache: Total cache size (in pairs): 76, Positive cache size: 62, Positive conditional cache size: 0, Positive unconditional cache size: 62, 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L717] 0 int z = 0; [L718] 0 _Bool z$flush_delayed; [L719] 0 int z$mem_tmp; [L720] 0 _Bool z$r_buff0_thd0; [L721] 0 _Bool z$r_buff0_thd1; [L722] 0 _Bool z$r_buff0_thd2; [L723] 0 _Bool z$r_buff0_thd3; [L724] 0 _Bool z$r_buff1_thd0; [L725] 0 _Bool z$r_buff1_thd1; [L726] 0 _Bool z$r_buff1_thd2; [L727] 0 _Bool z$r_buff1_thd3; [L728] 0 _Bool z$read_delayed; [L729] 0 int *z$read_delayed_var; [L730] 0 int z$w_buff0; [L731] 0 _Bool z$w_buff0_used; [L732] 0 int z$w_buff1; [L733] 0 _Bool z$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L816] 0 pthread_t t2489; [L817] FCALL, FORK 0 pthread_create(&t2489, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2489, ((void *)0), P0, ((void *)0))=-1, t2489={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] [L818] 0 pthread_t t2490; [L819] FCALL, FORK 0 pthread_create(&t2490, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2490, ((void *)0), P1, ((void *)0))=0, t2489={5:0}, t2490={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] [L820] 0 pthread_t t2491; [L821] FCALL, FORK 0 pthread_create(&t2491, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2491, ((void *)0), P2, ((void *)0))=1, t2489={5:0}, t2490={6:0}, t2491={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] [L739] 1 z$w_buff1 = z$w_buff0 [L740] 1 z$w_buff0 = 2 [L741] 1 z$w_buff1_used = z$w_buff0_used [L742] 1 z$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L744] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L745] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L746] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L747] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L748] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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] [L751] 1 x = 1 VAL [__unbuffered_cnt=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] [L768] 2 x = 2 VAL [__unbuffered_cnt=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] [L771] 2 y = 1 VAL [__unbuffered_cnt=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] [L774] 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) [L775] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L776] 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 [L777] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L778] 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, 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] [L788] 3 y = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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] [L791] 3 z = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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] [L794] 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) [L795] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] 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 [L797] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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] [L754] 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) [L755] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L756] 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 [L757] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L758] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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] [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 2 return 0; [L801] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 3 return 0; [L823] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L825] RET 0 assume_abort_if_not(main$tmp_guard0) [L827] 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) [L828] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] 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 [L830] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2489={5:0}, t2490={6:0}, t2491={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=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] [L834] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L835] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L836] 0 z$flush_delayed = weak$$choice2 [L837] 0 z$mem_tmp = z [L838] 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) [L839] 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)) [L840] 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)) [L841] 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)) [L842] 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)) [L843] 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)) [L844] 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)) [L845] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L846] 0 z = z$flush_delayed ? z$mem_tmp : z [L847] 0 z$flush_delayed = (_Bool)0 [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, 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: 817]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 140 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: 15.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 737 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 571 mSDsluCounter, 316 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 199 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1353 IncrementalHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 117 mSDtfsCounter, 1353 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1393occurred in iteration=11, InterpolantAutomatonStates: 69, 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, 4.4s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 191 ConstructedInterpolants, 0 QuantifiedInterpolants, 1976 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 21:11:56,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b631c09c-f46a-4005-81b6-b0c1b4daa618/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