./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix044_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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5817b44-b4e3-45e7-b190-0d929114d85d/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5817b44-b4e3-45e7-b190-0d929114d85d/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_f5817b44-b4e3-45e7-b190-0d929114d85d/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5817b44-b4e3-45e7-b190-0d929114d85d/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5817b44-b4e3-45e7-b190-0d929114d85d/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_f5817b44-b4e3-45e7-b190-0d929114d85d/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 40f0a1ff0b59c9897722e1cc89a9065b61569e5c28581990c7adb84261d57e0b --- 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 17:15:18,750 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:15:18,751 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:15:18,764 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:15:18,764 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:15:18,765 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:15:18,765 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:15:18,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:15:18,768 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:15:18,768 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:15:18,769 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:15:18,770 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:15:18,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:15:18,771 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:15:18,772 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:15:18,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:15:18,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:15:18,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:15:18,775 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:15:18,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:15:18,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:15:18,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:15:18,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:15:18,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:15:18,782 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:15:18,782 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:15:18,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:15:18,783 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:15:18,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:15:18,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:15:18,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:15:18,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:15:18,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:15:18,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:15:18,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:15:18,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:15:18,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:15:18,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:15:18,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:15:18,794 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:15:18,794 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:15:18,795 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5817b44-b4e3-45e7-b190-0d929114d85d/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 17:15:18,808 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:15:18,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:15:18,808 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:15:18,809 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:15:18,809 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:15:18,809 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:15:18,810 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:15:18,810 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:15:18,810 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:15:18,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:15:18,810 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:15:18,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:15:18,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:15:18,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:15:18,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:15:18,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:15:18,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:15:18,811 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:15:18,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:15:18,811 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:15:18,811 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:15:18,811 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:15:18,811 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:15:18,812 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:15:18,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:15:18,812 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:15:18,812 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:15:18,812 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:15:18,812 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:15:18,812 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:15:18,812 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:15:18,812 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:15:18,812 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:15:18,813 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:15:18,813 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:15:18,813 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_f5817b44-b4e3-45e7-b190-0d929114d85d/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_f5817b44-b4e3-45e7-b190-0d929114d85d/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 -> 40f0a1ff0b59c9897722e1cc89a9065b61569e5c28581990c7adb84261d57e0b [2022-12-13 17:15:19,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:15:19,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:15:19,049 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:15:19,050 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:15:19,051 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:15:19,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5817b44-b4e3-45e7-b190-0d929114d85d/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 17:15:21,697 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:15:21,905 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:15:21,906 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5817b44-b4e3-45e7-b190-0d929114d85d/sv-benchmarks/c/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 17:15:21,914 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5817b44-b4e3-45e7-b190-0d929114d85d/bin/uautomizer-uyxdKDjOR8/data/bc14afc05/1c3aa4d63fb445ab9138e5e642cd1fd0/FLAGc6dc549c8 [2022-12-13 17:15:21,925 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5817b44-b4e3-45e7-b190-0d929114d85d/bin/uautomizer-uyxdKDjOR8/data/bc14afc05/1c3aa4d63fb445ab9138e5e642cd1fd0 [2022-12-13 17:15:21,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:15:21,928 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:15:21,928 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:15:21,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:15:21,931 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:15:21,931 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:15:21" (1/1) ... [2022-12-13 17:15:21,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2301b592 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:21, skipping insertion in model container [2022-12-13 17:15:21,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:15:21" (1/1) ... [2022-12-13 17:15:21,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:15:21,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:15:22,073 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_f5817b44-b4e3-45e7-b190-0d929114d85d/sv-benchmarks/c/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 17:15:22,174 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,176 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,180 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,183 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:15:22,214 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:15:22,224 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_f5817b44-b4e3-45e7-b190-0d929114d85d/sv-benchmarks/c/pthread-wmm/mix044_power.oepc_pso.oepc_rmo.oepc.i[969,982] [2022-12-13 17:15:22,240 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,241 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,243 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,244 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,261 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,262 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:15:22,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:15:22,265 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:15:22,287 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:15:22,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:22 WrapperNode [2022-12-13 17:15:22,287 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:15:22,288 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:15:22,288 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:15:22,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:15:22,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:22" (1/1) ... [2022-12-13 17:15:22,304 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:22" (1/1) ... [2022-12-13 17:15:22,322 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 145 [2022-12-13 17:15:22,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:15:22,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:15:22,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:15:22,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:15:22,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:22" (1/1) ... [2022-12-13 17:15:22,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:22" (1/1) ... [2022-12-13 17:15:22,332 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:22" (1/1) ... [2022-12-13 17:15:22,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:22" (1/1) ... [2022-12-13 17:15:22,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:22" (1/1) ... [2022-12-13 17:15:22,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:22" (1/1) ... [2022-12-13 17:15:22,342 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:22" (1/1) ... [2022-12-13 17:15:22,343 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:22" (1/1) ... [2022-12-13 17:15:22,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:15:22,346 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:15:22,346 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:15:22,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:15:22,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:22" (1/1) ... [2022-12-13 17:15:22,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:15:22,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5817b44-b4e3-45e7-b190-0d929114d85d/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:15:22,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5817b44-b4e3-45e7-b190-0d929114d85d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:15:22,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5817b44-b4e3-45e7-b190-0d929114d85d/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:15:22,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 17:15:22,406 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 17:15:22,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:15:22,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 17:15:22,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 17:15:22,407 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 17:15:22,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 17:15:22,407 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 17:15:22,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 17:15:22,407 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 17:15:22,407 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 17:15:22,408 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 17:15:22,408 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 17:15:22,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:15:22,408 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 17:15:22,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:15:22,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:15:22,410 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 17:15:22,526 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:15:22,528 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:15:22,751 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:15:22,898 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:15:22,898 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 17:15:22,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:15:22 BoogieIcfgContainer [2022-12-13 17:15:22,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:15:22,903 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:15:22,903 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:15:22,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:15:22,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:15:21" (1/3) ... [2022-12-13 17:15:22,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d64ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:15:22, skipping insertion in model container [2022-12-13 17:15:22,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:15:22" (2/3) ... [2022-12-13 17:15:22,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d64ad7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:15:22, skipping insertion in model container [2022-12-13 17:15:22,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:15:22" (3/3) ... [2022-12-13 17:15:22,909 INFO L112 eAbstractionObserver]: Analyzing ICFG mix044_power.oepc_pso.oepc_rmo.oepc.i [2022-12-13 17:15:22,917 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 17:15:22,925 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:15:22,926 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 17:15:22,926 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 17:15:22,982 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 17:15:23,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 139 transitions, 298 flow [2022-12-13 17:15:23,065 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2022-12-13 17:15:23,066 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:15:23,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-12-13 17:15:23,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 139 transitions, 298 flow [2022-12-13 17:15:23,074 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 146 places, 135 transitions, 282 flow [2022-12-13 17:15:23,078 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 17:15:23,089 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 146 places, 135 transitions, 282 flow [2022-12-13 17:15:23,092 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 146 places, 135 transitions, 282 flow [2022-12-13 17:15:23,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 135 transitions, 282 flow [2022-12-13 17:15:23,121 INFO L130 PetriNetUnfolder]: 2/135 cut-off events. [2022-12-13 17:15:23,121 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:15:23,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 148 conditions, 135 events. 2/135 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 73 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2022-12-13 17:15:23,124 INFO L119 LiptonReduction]: Number of co-enabled transitions 3518 [2022-12-13 17:15:26,184 INFO L134 LiptonReduction]: Checked pairs total: 10158 [2022-12-13 17:15:26,185 INFO L136 LiptonReduction]: Total number of compositions: 116 [2022-12-13 17:15:26,198 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:15:26,203 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;@61b6536c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:15:26,203 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 17:15:26,206 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 17:15:26,206 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:15:26,206 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:26,206 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 17:15:26,207 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:26,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:26,211 INFO L85 PathProgramCache]: Analyzing trace with hash 573137, now seen corresponding path program 1 times [2022-12-13 17:15:26,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:26,218 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597187188] [2022-12-13 17:15:26,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:26,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:26,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:26,526 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 17:15:26,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:26,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597187188] [2022-12-13 17:15:26,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597187188] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:26,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:26,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 17:15:26,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892941672] [2022-12-13 17:15:26,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:26,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:15:26,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:26,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:15:26,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:15:26,557 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 255 [2022-12-13 17:15:26,560 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:26,560 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:15:26,560 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 255 [2022-12-13 17:15:26,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:15:27,871 INFO L130 PetriNetUnfolder]: 8247/11290 cut-off events. [2022-12-13 17:15:27,871 INFO L131 PetriNetUnfolder]: For 71/71 co-relation queries the response was YES. [2022-12-13 17:15:27,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22570 conditions, 11290 events. 8247/11290 cut-off events. For 71/71 co-relation queries the response was YES. Maximal size of possible extension queue 491. Compared 58647 event pairs, 3119 based on Foata normal form. 384/10901 useless extension candidates. Maximal degree in co-relation 22558. Up to 8863 conditions per place. [2022-12-13 17:15:27,924 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 45 selfloop transitions, 2 changer transitions 4/54 dead transitions. [2022-12-13 17:15:27,925 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 54 transitions, 231 flow [2022-12-13 17:15:27,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:15:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:15:27,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 423 transitions. [2022-12-13 17:15:27,939 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5529411764705883 [2022-12-13 17:15:27,940 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 423 transitions. [2022-12-13 17:15:27,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 423 transitions. [2022-12-13 17:15:27,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:15:27,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 423 transitions. [2022-12-13 17:15:27,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:27,954 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:27,955 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:27,957 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 78 flow. Second operand 3 states and 423 transitions. [2022-12-13 17:15:27,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 54 transitions, 231 flow [2022-12-13 17:15:27,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 17:15:27,963 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 70 flow [2022-12-13 17:15:27,965 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=70, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-12-13 17:15:27,968 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, -3 predicate places. [2022-12-13 17:15:27,969 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 70 flow [2022-12-13 17:15:27,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:27,969 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:27,970 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:15:27,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:15:27,970 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:27,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:27,971 INFO L85 PathProgramCache]: Analyzing trace with hash -51293540, now seen corresponding path program 1 times [2022-12-13 17:15:27,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:27,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090760070] [2022-12-13 17:15:27,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:27,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:28,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:28,167 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 17:15:28,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:28,168 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090760070] [2022-12-13 17:15:28,168 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090760070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:28,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:28,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:15:28,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929791698] [2022-12-13 17:15:28,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:28,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:15:28,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:28,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:15:28,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:15:28,199 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 255 [2022-12-13 17:15:28,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 70 flow. Second operand has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:28,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:15:28,201 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 255 [2022-12-13 17:15:28,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:15:30,878 INFO L130 PetriNetUnfolder]: 24272/32879 cut-off events. [2022-12-13 17:15:30,879 INFO L131 PetriNetUnfolder]: For 1497/1497 co-relation queries the response was YES. [2022-12-13 17:15:30,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67764 conditions, 32879 events. 24272/32879 cut-off events. For 1497/1497 co-relation queries the response was YES. Maximal size of possible extension queue 1054. Compared 180899 event pairs, 7272 based on Foata normal form. 1359/34238 useless extension candidates. Maximal degree in co-relation 67754. Up to 16693 conditions per place. [2022-12-13 17:15:30,987 INFO L137 encePairwiseOnDemand]: 245/255 looper letters, 45 selfloop transitions, 8 changer transitions 35/88 dead transitions. [2022-12-13 17:15:30,987 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 88 transitions, 374 flow [2022-12-13 17:15:30,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:15:30,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:15:30,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 650 transitions. [2022-12-13 17:15:30,990 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5098039215686274 [2022-12-13 17:15:30,990 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 650 transitions. [2022-12-13 17:15:30,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 650 transitions. [2022-12-13 17:15:30,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:15:30,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 650 transitions. [2022-12-13 17:15:30,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.0) internal successors, (650), 5 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:30,993 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:30,994 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:30,994 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 70 flow. Second operand 5 states and 650 transitions. [2022-12-13 17:15:30,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 88 transitions, 374 flow [2022-12-13 17:15:30,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 88 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:15:30,996 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 146 flow [2022-12-13 17:15:30,996 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=146, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2022-12-13 17:15:30,997 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 1 predicate places. [2022-12-13 17:15:30,997 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 146 flow [2022-12-13 17:15:30,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:30,997 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:30,997 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:15:30,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:15:30,998 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:30,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:30,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1590157164, now seen corresponding path program 1 times [2022-12-13 17:15:30,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:30,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101094375] [2022-12-13 17:15:30,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:30,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:31,111 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 17:15:31,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:31,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101094375] [2022-12-13 17:15:31,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101094375] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:31,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:31,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:15:31,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695901266] [2022-12-13 17:15:31,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:31,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:15:31,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:31,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:15:31,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:15:31,120 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 255 [2022-12-13 17:15:31,121 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 146 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 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 17:15:31,121 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:15:31,121 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 255 [2022-12-13 17:15:31,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:15:33,466 INFO L130 PetriNetUnfolder]: 17280/24287 cut-off events. [2022-12-13 17:15:33,466 INFO L131 PetriNetUnfolder]: For 15248/15779 co-relation queries the response was YES. [2022-12-13 17:15:33,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62495 conditions, 24287 events. 17280/24287 cut-off events. For 15248/15779 co-relation queries the response was YES. Maximal size of possible extension queue 993. Compared 144024 event pairs, 5157 based on Foata normal form. 1232/24868 useless extension candidates. Maximal degree in co-relation 62481. Up to 14730 conditions per place. [2022-12-13 17:15:33,553 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 39 selfloop transitions, 3 changer transitions 29/77 dead transitions. [2022-12-13 17:15:33,553 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 77 transitions, 420 flow [2022-12-13 17:15:33,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:15:33,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:15:33,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 668 transitions. [2022-12-13 17:15:33,555 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.523921568627451 [2022-12-13 17:15:33,556 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 668 transitions. [2022-12-13 17:15:33,556 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 668 transitions. [2022-12-13 17:15:33,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:15:33,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 668 transitions. [2022-12-13 17:15:33,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 133.6) internal successors, (668), 5 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:33,559 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:33,559 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:33,559 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 146 flow. Second operand 5 states and 668 transitions. [2022-12-13 17:15:33,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 77 transitions, 420 flow [2022-12-13 17:15:33,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 77 transitions, 392 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:15:33,587 INFO L231 Difference]: Finished difference. Result has 49 places, 36 transitions, 145 flow [2022-12-13 17:15:33,587 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=49, PETRI_TRANSITIONS=36} [2022-12-13 17:15:33,587 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2022-12-13 17:15:33,588 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 36 transitions, 145 flow [2022-12-13 17:15:33,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 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 17:15:33,588 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:33,588 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:15:33,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:15:33,589 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:33,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:33,589 INFO L85 PathProgramCache]: Analyzing trace with hash -66319380, now seen corresponding path program 1 times [2022-12-13 17:15:33,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:33,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928768189] [2022-12-13 17:15:33,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:33,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:33,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:33,695 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 17:15:33,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:33,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928768189] [2022-12-13 17:15:33,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928768189] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:33,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:33,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:15:33,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539549614] [2022-12-13 17:15:33,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:33,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:15:33,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:33,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:15:33,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:15:33,704 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 255 [2022-12-13 17:15:33,704 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 36 transitions, 145 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:33,704 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:15:33,705 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 255 [2022-12-13 17:15:33,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:15:35,619 INFO L130 PetriNetUnfolder]: 16978/23919 cut-off events. [2022-12-13 17:15:35,620 INFO L131 PetriNetUnfolder]: For 22527/22651 co-relation queries the response was YES. [2022-12-13 17:15:35,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61917 conditions, 23919 events. 16978/23919 cut-off events. For 22527/22651 co-relation queries the response was YES. Maximal size of possible extension queue 839. Compared 139675 event pairs, 6730 based on Foata normal form. 923/24715 useless extension candidates. Maximal degree in co-relation 61900. Up to 19605 conditions per place. [2022-12-13 17:15:35,714 INFO L137 encePairwiseOnDemand]: 250/255 looper letters, 50 selfloop transitions, 5 changer transitions 29/88 dead transitions. [2022-12-13 17:15:35,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 88 transitions, 495 flow [2022-12-13 17:15:35,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:15:35,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:15:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 671 transitions. [2022-12-13 17:15:35,716 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5262745098039215 [2022-12-13 17:15:35,717 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 671 transitions. [2022-12-13 17:15:35,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 671 transitions. [2022-12-13 17:15:35,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:15:35,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 671 transitions. [2022-12-13 17:15:35,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.2) internal successors, (671), 5 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:35,721 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:35,721 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:35,721 INFO L175 Difference]: Start difference. First operand has 49 places, 36 transitions, 145 flow. Second operand 5 states and 671 transitions. [2022-12-13 17:15:35,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 88 transitions, 495 flow [2022-12-13 17:15:35,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 88 transitions, 481 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 17:15:35,881 INFO L231 Difference]: Finished difference. Result has 50 places, 40 transitions, 192 flow [2022-12-13 17:15:35,881 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=50, PETRI_TRANSITIONS=40} [2022-12-13 17:15:35,882 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2022-12-13 17:15:35,882 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 40 transitions, 192 flow [2022-12-13 17:15:35,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:35,883 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:35,883 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:15:35,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:15:35,883 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:35,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:35,883 INFO L85 PathProgramCache]: Analyzing trace with hash 865673560, now seen corresponding path program 1 times [2022-12-13 17:15:35,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:35,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550553747] [2022-12-13 17:15:35,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:35,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:35,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:15:35,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:35,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550553747] [2022-12-13 17:15:35,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550553747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:35,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:35,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:15:35,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668256815] [2022-12-13 17:15:35,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:35,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:15:35,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:35,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:15:35,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:15:35,983 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-12-13 17:15:35,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 40 transitions, 192 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:35,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:15:35,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-12-13 17:15:35,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:15:37,370 INFO L130 PetriNetUnfolder]: 8558/12553 cut-off events. [2022-12-13 17:15:37,370 INFO L131 PetriNetUnfolder]: For 11664/12019 co-relation queries the response was YES. [2022-12-13 17:15:37,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34175 conditions, 12553 events. 8558/12553 cut-off events. For 11664/12019 co-relation queries the response was YES. Maximal size of possible extension queue 484. Compared 73179 event pairs, 1926 based on Foata normal form. 498/12878 useless extension candidates. Maximal degree in co-relation 34157. Up to 10472 conditions per place. [2022-12-13 17:15:37,435 INFO L137 encePairwiseOnDemand]: 249/255 looper letters, 53 selfloop transitions, 5 changer transitions 0/66 dead transitions. [2022-12-13 17:15:37,436 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 66 transitions, 412 flow [2022-12-13 17:15:37,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:15:37,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:15:37,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2022-12-13 17:15:37,438 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5281045751633987 [2022-12-13 17:15:37,438 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2022-12-13 17:15:37,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2022-12-13 17:15:37,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:15:37,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2022-12-13 17:15:37,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:37,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:37,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 255.0) internal successors, (1020), 4 states have internal predecessors, (1020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:37,441 INFO L175 Difference]: Start difference. First operand has 50 places, 40 transitions, 192 flow. Second operand 3 states and 404 transitions. [2022-12-13 17:15:37,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 66 transitions, 412 flow [2022-12-13 17:15:37,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 66 transitions, 403 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 17:15:37,476 INFO L231 Difference]: Finished difference. Result has 49 places, 44 transitions, 218 flow [2022-12-13 17:15:37,476 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=218, PETRI_PLACES=49, PETRI_TRANSITIONS=44} [2022-12-13 17:15:37,477 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2022-12-13 17:15:37,477 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 44 transitions, 218 flow [2022-12-13 17:15:37,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:37,478 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:37,478 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 17:15:37,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:15:37,478 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:37,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:37,479 INFO L85 PathProgramCache]: Analyzing trace with hash 419739607, now seen corresponding path program 1 times [2022-12-13 17:15:37,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:37,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099482811] [2022-12-13 17:15:37,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:37,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:37,666 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 17:15:37,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:37,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099482811] [2022-12-13 17:15:37,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099482811] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:37,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:37,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:15:37,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522366169] [2022-12-13 17:15:37,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:37,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:15:37,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:37,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:15:37,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:15:37,689 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 255 [2022-12-13 17:15:37,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 44 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:37,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:15:37,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 255 [2022-12-13 17:15:37,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:15:39,633 INFO L130 PetriNetUnfolder]: 15516/22297 cut-off events. [2022-12-13 17:15:39,634 INFO L131 PetriNetUnfolder]: For 22868/22868 co-relation queries the response was YES. [2022-12-13 17:15:39,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67814 conditions, 22297 events. 15516/22297 cut-off events. For 22868/22868 co-relation queries the response was YES. Maximal size of possible extension queue 684. Compared 131621 event pairs, 3696 based on Foata normal form. 528/22825 useless extension candidates. Maximal degree in co-relation 67795. Up to 9317 conditions per place. [2022-12-13 17:15:39,712 INFO L137 encePairwiseOnDemand]: 245/255 looper letters, 82 selfloop transitions, 13 changer transitions 41/136 dead transitions. [2022-12-13 17:15:39,712 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 136 transitions, 844 flow [2022-12-13 17:15:39,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:15:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 17:15:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 900 transitions. [2022-12-13 17:15:39,715 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5042016806722689 [2022-12-13 17:15:39,715 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 900 transitions. [2022-12-13 17:15:39,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 900 transitions. [2022-12-13 17:15:39,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:15:39,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 900 transitions. [2022-12-13 17:15:39,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.57142857142858) internal successors, (900), 7 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:39,718 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:39,719 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:39,719 INFO L175 Difference]: Start difference. First operand has 49 places, 44 transitions, 218 flow. Second operand 7 states and 900 transitions. [2022-12-13 17:15:39,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 136 transitions, 844 flow [2022-12-13 17:15:39,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 136 transitions, 823 flow, removed 4 selfloop flow, removed 1 redundant places. [2022-12-13 17:15:39,729 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 306 flow [2022-12-13 17:15:39,729 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=306, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2022-12-13 17:15:39,730 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2022-12-13 17:15:39,730 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 306 flow [2022-12-13 17:15:39,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:39,730 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:39,730 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 17:15:39,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:15:39,730 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:39,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:39,731 INFO L85 PathProgramCache]: Analyzing trace with hash 932448918, now seen corresponding path program 1 times [2022-12-13 17:15:39,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:39,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100513272] [2022-12-13 17:15:39,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:39,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:39,839 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 17:15:39,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:39,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100513272] [2022-12-13 17:15:39,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100513272] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:39,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:39,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:15:39,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296312662] [2022-12-13 17:15:39,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:39,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:15:39,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:39,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:15:39,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:15:39,848 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-12-13 17:15:39,848 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:39,848 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:15:39,848 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-12-13 17:15:39,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:15:40,715 INFO L130 PetriNetUnfolder]: 5911/9174 cut-off events. [2022-12-13 17:15:40,715 INFO L131 PetriNetUnfolder]: For 13066/13386 co-relation queries the response was YES. [2022-12-13 17:15:40,730 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28644 conditions, 9174 events. 5911/9174 cut-off events. For 13066/13386 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 56489 event pairs, 1327 based on Foata normal form. 745/9724 useless extension candidates. Maximal degree in co-relation 28618. Up to 4180 conditions per place. [2022-12-13 17:15:40,745 INFO L137 encePairwiseOnDemand]: 249/255 looper letters, 82 selfloop transitions, 9 changer transitions 0/101 dead transitions. [2022-12-13 17:15:40,745 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 101 transitions, 768 flow [2022-12-13 17:15:40,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:15:40,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 17:15:40,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 541 transitions. [2022-12-13 17:15:40,746 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5303921568627451 [2022-12-13 17:15:40,746 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 541 transitions. [2022-12-13 17:15:40,746 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 541 transitions. [2022-12-13 17:15:40,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:15:40,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 541 transitions. [2022-12-13 17:15:40,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.25) internal successors, (541), 4 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 17:15:40,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:40,749 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:40,749 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 306 flow. Second operand 4 states and 541 transitions. [2022-12-13 17:15:40,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 101 transitions, 768 flow [2022-12-13 17:15:40,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 101 transitions, 752 flow, removed 8 selfloop flow, removed 1 redundant places. [2022-12-13 17:15:40,762 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 350 flow [2022-12-13 17:15:40,762 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=298, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=350, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2022-12-13 17:15:40,763 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2022-12-13 17:15:40,763 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 350 flow [2022-12-13 17:15:40,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:40,763 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:40,763 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 17:15:40,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 17:15:40,763 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:40,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:40,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1655809920, now seen corresponding path program 1 times [2022-12-13 17:15:40,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:40,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747329153] [2022-12-13 17:15:40,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:40,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:40,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:40,912 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 17:15:40,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:40,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747329153] [2022-12-13 17:15:40,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747329153] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:40,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:40,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:15:40,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509275393] [2022-12-13 17:15:40,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:40,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:15:40,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:40,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:15:40,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:15:40,925 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-12-13 17:15:40,926 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 350 flow. Second operand has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:40,926 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:15:40,926 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-12-13 17:15:40,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:15:41,719 INFO L130 PetriNetUnfolder]: 4370/6741 cut-off events. [2022-12-13 17:15:41,719 INFO L131 PetriNetUnfolder]: For 10894/11162 co-relation queries the response was YES. [2022-12-13 17:15:41,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23214 conditions, 6741 events. 4370/6741 cut-off events. For 10894/11162 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 40221 event pairs, 1052 based on Foata normal form. 332/6895 useless extension candidates. Maximal degree in co-relation 23186. Up to 2673 conditions per place. [2022-12-13 17:15:41,741 INFO L137 encePairwiseOnDemand]: 249/255 looper letters, 98 selfloop transitions, 13 changer transitions 3/124 dead transitions. [2022-12-13 17:15:41,741 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 124 transitions, 959 flow [2022-12-13 17:15:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:15:41,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:15:41,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 676 transitions. [2022-12-13 17:15:41,743 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5301960784313725 [2022-12-13 17:15:41,743 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 676 transitions. [2022-12-13 17:15:41,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 676 transitions. [2022-12-13 17:15:41,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:15:41,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 676 transitions. [2022-12-13 17:15:41,745 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 135.2) internal successors, (676), 5 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:41,746 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:41,746 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 255.0) internal successors, (1530), 6 states have internal predecessors, (1530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:41,746 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 350 flow. Second operand 5 states and 676 transitions. [2022-12-13 17:15:41,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 124 transitions, 959 flow [2022-12-13 17:15:41,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 124 transitions, 935 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 17:15:41,760 INFO L231 Difference]: Finished difference. Result has 62 places, 57 transitions, 394 flow [2022-12-13 17:15:41,760 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=394, PETRI_PLACES=62, PETRI_TRANSITIONS=57} [2022-12-13 17:15:41,761 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2022-12-13 17:15:41,761 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 57 transitions, 394 flow [2022-12-13 17:15:41,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:41,761 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:41,761 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:15:41,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 17:15:41,762 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:41,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:41,762 INFO L85 PathProgramCache]: Analyzing trace with hash 245846713, now seen corresponding path program 1 times [2022-12-13 17:15:41,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:41,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443126476] [2022-12-13 17:15:41,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:41,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:42,413 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 17:15:42,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:42,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443126476] [2022-12-13 17:15:42,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443126476] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:42,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:42,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:15:42,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243329142] [2022-12-13 17:15:42,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:42,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:15:42,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:42,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:15:42,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:15:42,523 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 255 [2022-12-13 17:15:42,524 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 57 transitions, 394 flow. Second operand has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:42,524 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:15:42,524 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 255 [2022-12-13 17:15:42,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:15:44,121 INFO L130 PetriNetUnfolder]: 7988/12062 cut-off events. [2022-12-13 17:15:44,121 INFO L131 PetriNetUnfolder]: For 30610/30610 co-relation queries the response was YES. [2022-12-13 17:15:44,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46008 conditions, 12062 events. 7988/12062 cut-off events. For 30610/30610 co-relation queries the response was YES. Maximal size of possible extension queue 440. Compared 71870 event pairs, 380 based on Foata normal form. 17/12079 useless extension candidates. Maximal degree in co-relation 45980. Up to 2566 conditions per place. [2022-12-13 17:15:44,164 INFO L137 encePairwiseOnDemand]: 241/255 looper letters, 200 selfloop transitions, 56 changer transitions 39/295 dead transitions. [2022-12-13 17:15:44,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 295 transitions, 2464 flow [2022-12-13 17:15:44,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 17:15:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 17:15:44,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1382 transitions. [2022-12-13 17:15:44,168 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4926916221033868 [2022-12-13 17:15:44,168 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1382 transitions. [2022-12-13 17:15:44,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1382 transitions. [2022-12-13 17:15:44,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:15:44,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1382 transitions. [2022-12-13 17:15:44,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 125.63636363636364) internal successors, (1382), 11 states have internal predecessors, (1382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:44,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 255.0) internal successors, (3060), 12 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:44,178 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 255.0) internal successors, (3060), 12 states have internal predecessors, (3060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:44,178 INFO L175 Difference]: Start difference. First operand has 62 places, 57 transitions, 394 flow. Second operand 11 states and 1382 transitions. [2022-12-13 17:15:44,178 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 295 transitions, 2464 flow [2022-12-13 17:15:44,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 295 transitions, 2210 flow, removed 70 selfloop flow, removed 5 redundant places. [2022-12-13 17:15:44,444 INFO L231 Difference]: Finished difference. Result has 74 places, 100 transitions, 865 flow [2022-12-13 17:15:44,445 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=865, PETRI_PLACES=74, PETRI_TRANSITIONS=100} [2022-12-13 17:15:44,445 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 29 predicate places. [2022-12-13 17:15:44,445 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 100 transitions, 865 flow [2022-12-13 17:15:44,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 111.125) internal successors, (889), 8 states have internal predecessors, (889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:44,446 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:44,446 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:15:44,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 17:15:44,446 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:44,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:44,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1878268565, now seen corresponding path program 2 times [2022-12-13 17:15:44,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:44,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929668047] [2022-12-13 17:15:44,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:44,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:44,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:44,762 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 17:15:44,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:44,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929668047] [2022-12-13 17:15:44,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929668047] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:44,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:44,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:15:44,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796998820] [2022-12-13 17:15:44,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:44,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:15:44,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:44,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:15:44,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:15:44,786 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 255 [2022-12-13 17:15:44,787 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 100 transitions, 865 flow. Second operand has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:44,787 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:15:44,787 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 255 [2022-12-13 17:15:44,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:15:46,306 INFO L130 PetriNetUnfolder]: 7970/12944 cut-off events. [2022-12-13 17:15:46,306 INFO L131 PetriNetUnfolder]: For 34030/34507 co-relation queries the response was YES. [2022-12-13 17:15:46,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52349 conditions, 12944 events. 7970/12944 cut-off events. For 34030/34507 co-relation queries the response was YES. Maximal size of possible extension queue 559. Compared 88897 event pairs, 1745 based on Foata normal form. 379/13221 useless extension candidates. Maximal degree in co-relation 52316. Up to 6527 conditions per place. [2022-12-13 17:15:46,358 INFO L137 encePairwiseOnDemand]: 246/255 looper letters, 130 selfloop transitions, 14 changer transitions 78/239 dead transitions. [2022-12-13 17:15:46,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 239 transitions, 2170 flow [2022-12-13 17:15:46,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:15:46,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 17:15:46,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1037 transitions. [2022-12-13 17:15:46,360 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5083333333333333 [2022-12-13 17:15:46,360 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1037 transitions. [2022-12-13 17:15:46,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1037 transitions. [2022-12-13 17:15:46,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:15:46,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1037 transitions. [2022-12-13 17:15:46,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 129.625) internal successors, (1037), 8 states have internal predecessors, (1037), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:46,364 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 255.0) internal successors, (2295), 9 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:46,364 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 255.0) internal successors, (2295), 9 states have internal predecessors, (2295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:46,364 INFO L175 Difference]: Start difference. First operand has 74 places, 100 transitions, 865 flow. Second operand 8 states and 1037 transitions. [2022-12-13 17:15:46,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 239 transitions, 2170 flow [2022-12-13 17:15:46,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 239 transitions, 2156 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-13 17:15:46,720 INFO L231 Difference]: Finished difference. Result has 82 places, 102 transitions, 896 flow [2022-12-13 17:15:46,720 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=859, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=896, PETRI_PLACES=82, PETRI_TRANSITIONS=102} [2022-12-13 17:15:46,720 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 37 predicate places. [2022-12-13 17:15:46,720 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 102 transitions, 896 flow [2022-12-13 17:15:46,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.28571428571429) internal successors, (842), 7 states have internal predecessors, (842), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:46,721 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:46,721 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:15:46,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 17:15:46,721 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:46,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:46,721 INFO L85 PathProgramCache]: Analyzing trace with hash -715631953, now seen corresponding path program 3 times [2022-12-13 17:15:46,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:46,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628711388] [2022-12-13 17:15:46,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:46,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:46,859 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 17:15:46,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:46,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628711388] [2022-12-13 17:15:46,859 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628711388] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:46,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:46,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:15:46,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421483522] [2022-12-13 17:15:46,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:46,860 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:15:46,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:46,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:15:46,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:15:46,869 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 255 [2022-12-13 17:15:46,869 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 102 transitions, 896 flow. Second operand has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:46,870 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:15:46,870 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 255 [2022-12-13 17:15:46,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:15:47,947 INFO L130 PetriNetUnfolder]: 5818/9194 cut-off events. [2022-12-13 17:15:47,947 INFO L131 PetriNetUnfolder]: For 33742/34484 co-relation queries the response was YES. [2022-12-13 17:15:47,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40116 conditions, 9194 events. 5818/9194 cut-off events. For 33742/34484 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 60823 event pairs, 714 based on Foata normal form. 578/9649 useless extension candidates. Maximal degree in co-relation 40086. Up to 3812 conditions per place. [2022-12-13 17:15:47,975 INFO L137 encePairwiseOnDemand]: 249/255 looper letters, 164 selfloop transitions, 17 changer transitions 48/242 dead transitions. [2022-12-13 17:15:47,975 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 242 transitions, 2562 flow [2022-12-13 17:15:47,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:15:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 17:15:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 795 transitions. [2022-12-13 17:15:47,977 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5196078431372549 [2022-12-13 17:15:47,977 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 795 transitions. [2022-12-13 17:15:47,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 795 transitions. [2022-12-13 17:15:47,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:15:47,977 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 795 transitions. [2022-12-13 17:15:47,978 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 132.5) internal successors, (795), 6 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:47,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:47,980 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 255.0) internal successors, (1785), 7 states have internal predecessors, (1785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:47,980 INFO L175 Difference]: Start difference. First operand has 82 places, 102 transitions, 896 flow. Second operand 6 states and 795 transitions. [2022-12-13 17:15:47,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 242 transitions, 2562 flow [2022-12-13 17:15:48,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 242 transitions, 2430 flow, removed 26 selfloop flow, removed 7 redundant places. [2022-12-13 17:15:48,353 INFO L231 Difference]: Finished difference. Result has 78 places, 89 transitions, 748 flow [2022-12-13 17:15:48,353 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=748, PETRI_PLACES=78, PETRI_TRANSITIONS=89} [2022-12-13 17:15:48,354 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2022-12-13 17:15:48,354 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 89 transitions, 748 flow [2022-12-13 17:15:48,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.83333333333333) internal successors, (737), 6 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:48,354 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:48,354 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:15:48,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 17:15:48,355 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:48,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:48,355 INFO L85 PathProgramCache]: Analyzing trace with hash 283800938, now seen corresponding path program 1 times [2022-12-13 17:15:48,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:48,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4979638] [2022-12-13 17:15:48,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:48,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:48,740 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 17:15:48,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:48,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4979638] [2022-12-13 17:15:48,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4979638] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:48,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:48,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:15:48,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862745101] [2022-12-13 17:15:48,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:48,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:15:48,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:48,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:15:48,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:15:48,758 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 255 [2022-12-13 17:15:48,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 89 transitions, 748 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:48,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:15:48,760 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 255 [2022-12-13 17:15:48,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:15:49,602 INFO L130 PetriNetUnfolder]: 3820/5851 cut-off events. [2022-12-13 17:15:49,602 INFO L131 PetriNetUnfolder]: For 22693/22899 co-relation queries the response was YES. [2022-12-13 17:15:49,614 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27527 conditions, 5851 events. 3820/5851 cut-off events. For 22693/22899 co-relation queries the response was YES. Maximal size of possible extension queue 274. Compared 32213 event pairs, 1173 based on Foata normal form. 150/5970 useless extension candidates. Maximal degree in co-relation 27493. Up to 3837 conditions per place. [2022-12-13 17:15:49,624 INFO L137 encePairwiseOnDemand]: 245/255 looper letters, 106 selfloop transitions, 21 changer transitions 66/202 dead transitions. [2022-12-13 17:15:49,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 202 transitions, 2021 flow [2022-12-13 17:15:49,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:15:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 17:15:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 903 transitions. [2022-12-13 17:15:49,626 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5058823529411764 [2022-12-13 17:15:49,626 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 903 transitions. [2022-12-13 17:15:49,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 903 transitions. [2022-12-13 17:15:49,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:15:49,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 903 transitions. [2022-12-13 17:15:49,628 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.0) internal successors, (903), 7 states have internal predecessors, (903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:49,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:49,629 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:49,629 INFO L175 Difference]: Start difference. First operand has 78 places, 89 transitions, 748 flow. Second operand 7 states and 903 transitions. [2022-12-13 17:15:49,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 202 transitions, 2021 flow [2022-12-13 17:15:49,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 202 transitions, 1840 flow, removed 50 selfloop flow, removed 8 redundant places. [2022-12-13 17:15:49,732 INFO L231 Difference]: Finished difference. Result has 80 places, 107 transitions, 891 flow [2022-12-13 17:15:49,732 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=891, PETRI_PLACES=80, PETRI_TRANSITIONS=107} [2022-12-13 17:15:49,732 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 35 predicate places. [2022-12-13 17:15:49,732 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 107 transitions, 891 flow [2022-12-13 17:15:49,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:49,733 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:49,733 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:15:49,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 17:15:49,733 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:49,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:49,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1317096270, now seen corresponding path program 2 times [2022-12-13 17:15:49,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:49,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255998217] [2022-12-13 17:15:49,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:49,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:50,093 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 17:15:50,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:50,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255998217] [2022-12-13 17:15:50,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255998217] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:50,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:50,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:15:50,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398239406] [2022-12-13 17:15:50,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:50,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:15:50,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:50,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:15:50,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:15:50,111 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 255 [2022-12-13 17:15:50,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 107 transitions, 891 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:50,112 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:15:50,112 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 255 [2022-12-13 17:15:50,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:15:50,839 INFO L130 PetriNetUnfolder]: 3534/5479 cut-off events. [2022-12-13 17:15:50,839 INFO L131 PetriNetUnfolder]: For 19734/19941 co-relation queries the response was YES. [2022-12-13 17:15:50,851 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25035 conditions, 5479 events. 3534/5479 cut-off events. For 19734/19941 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 30591 event pairs, 349 based on Foata normal form. 182/5655 useless extension candidates. Maximal degree in co-relation 25011. Up to 2561 conditions per place. [2022-12-13 17:15:50,856 INFO L137 encePairwiseOnDemand]: 245/255 looper letters, 86 selfloop transitions, 2 changer transitions 135/227 dead transitions. [2022-12-13 17:15:50,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 227 transitions, 2250 flow [2022-12-13 17:15:50,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:15:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 17:15:50,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 900 transitions. [2022-12-13 17:15:50,858 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5042016806722689 [2022-12-13 17:15:50,858 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 900 transitions. [2022-12-13 17:15:50,858 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 900 transitions. [2022-12-13 17:15:50,858 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:15:50,858 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 900 transitions. [2022-12-13 17:15:50,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.57142857142858) internal successors, (900), 7 states have internal predecessors, (900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:50,861 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:50,861 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:50,861 INFO L175 Difference]: Start difference. First operand has 80 places, 107 transitions, 891 flow. Second operand 7 states and 900 transitions. [2022-12-13 17:15:50,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 227 transitions, 2250 flow [2022-12-13 17:15:50,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 227 transitions, 2236 flow, removed 7 selfloop flow, removed 2 redundant places. [2022-12-13 17:15:50,935 INFO L231 Difference]: Finished difference. Result has 86 places, 81 transitions, 662 flow [2022-12-13 17:15:50,935 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=883, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=662, PETRI_PLACES=86, PETRI_TRANSITIONS=81} [2022-12-13 17:15:50,935 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 41 predicate places. [2022-12-13 17:15:50,936 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 81 transitions, 662 flow [2022-12-13 17:15:50,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:50,936 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:50,936 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:15:50,936 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 17:15:50,936 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:50,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:50,936 INFO L85 PathProgramCache]: Analyzing trace with hash -1520294476, now seen corresponding path program 3 times [2022-12-13 17:15:50,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:50,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711300045] [2022-12-13 17:15:50,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:50,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:51,045 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 17:15:51,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:51,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711300045] [2022-12-13 17:15:51,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711300045] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:51,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:51,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:15:51,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876434876] [2022-12-13 17:15:51,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:51,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:15:51,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:51,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:15:51,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:15:51,055 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 255 [2022-12-13 17:15:51,056 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 81 transitions, 662 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:51,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:15:51,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 255 [2022-12-13 17:15:51,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:15:51,449 INFO L130 PetriNetUnfolder]: 1742/2816 cut-off events. [2022-12-13 17:15:51,450 INFO L131 PetriNetUnfolder]: For 10156/10195 co-relation queries the response was YES. [2022-12-13 17:15:51,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12886 conditions, 2816 events. 1742/2816 cut-off events. For 10156/10195 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 14447 event pairs, 417 based on Foata normal form. 13/2809 useless extension candidates. Maximal degree in co-relation 12858. Up to 1479 conditions per place. [2022-12-13 17:15:51,460 INFO L137 encePairwiseOnDemand]: 251/255 looper letters, 74 selfloop transitions, 5 changer transitions 45/126 dead transitions. [2022-12-13 17:15:51,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 126 transitions, 1227 flow [2022-12-13 17:15:51,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:15:51,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 17:15:51,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 525 transitions. [2022-12-13 17:15:51,462 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5147058823529411 [2022-12-13 17:15:51,462 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 525 transitions. [2022-12-13 17:15:51,462 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 525 transitions. [2022-12-13 17:15:51,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:15:51,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 525 transitions. [2022-12-13 17:15:51,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 131.25) internal successors, (525), 4 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 17:15:51,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:51,464 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 255.0) internal successors, (1275), 5 states have internal predecessors, (1275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:51,464 INFO L175 Difference]: Start difference. First operand has 86 places, 81 transitions, 662 flow. Second operand 4 states and 525 transitions. [2022-12-13 17:15:51,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 126 transitions, 1227 flow [2022-12-13 17:15:51,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 126 transitions, 1135 flow, removed 14 selfloop flow, removed 8 redundant places. [2022-12-13 17:15:51,490 INFO L231 Difference]: Finished difference. Result has 79 places, 66 transitions, 469 flow [2022-12-13 17:15:51,490 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=593, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=469, PETRI_PLACES=79, PETRI_TRANSITIONS=66} [2022-12-13 17:15:51,491 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2022-12-13 17:15:51,491 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 66 transitions, 469 flow [2022-12-13 17:15:51,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:51,491 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:51,491 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:15:51,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 17:15:51,491 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:51,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:51,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1799922864, now seen corresponding path program 4 times [2022-12-13 17:15:51,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:51,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931283555] [2022-12-13 17:15:51,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:51,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:15:52,177 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 17:15:52,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:15:52,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931283555] [2022-12-13 17:15:52,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931283555] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:15:52,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:15:52,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 17:15:52,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211222968] [2022-12-13 17:15:52,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:15:52,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 17:15:52,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:15:52,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 17:15:52,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-12-13 17:15:52,257 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 255 [2022-12-13 17:15:52,258 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 66 transitions, 469 flow. Second operand has 9 states, 9 states have (on average 120.88888888888889) internal successors, (1088), 9 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:52,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:15:52,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 255 [2022-12-13 17:15:52,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:15:52,705 INFO L130 PetriNetUnfolder]: 872/1467 cut-off events. [2022-12-13 17:15:52,705 INFO L131 PetriNetUnfolder]: For 3728/3761 co-relation queries the response was YES. [2022-12-13 17:15:52,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6099 conditions, 1467 events. 872/1467 cut-off events. For 3728/3761 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 6567 event pairs, 196 based on Foata normal form. 22/1483 useless extension candidates. Maximal degree in co-relation 6072. Up to 673 conditions per place. [2022-12-13 17:15:52,709 INFO L137 encePairwiseOnDemand]: 248/255 looper letters, 91 selfloop transitions, 8 changer transitions 40/143 dead transitions. [2022-12-13 17:15:52,709 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 143 transitions, 1158 flow [2022-12-13 17:15:52,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:15:52,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 17:15:52,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 904 transitions. [2022-12-13 17:15:52,711 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5064425770308123 [2022-12-13 17:15:52,711 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 904 transitions. [2022-12-13 17:15:52,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 904 transitions. [2022-12-13 17:15:52,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:15:52,711 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 904 transitions. [2022-12-13 17:15:52,712 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 129.14285714285714) internal successors, (904), 7 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:52,713 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:52,714 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 255.0) internal successors, (2040), 8 states have internal predecessors, (2040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:52,714 INFO L175 Difference]: Start difference. First operand has 79 places, 66 transitions, 469 flow. Second operand 7 states and 904 transitions. [2022-12-13 17:15:52,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 143 transitions, 1158 flow [2022-12-13 17:15:52,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 143 transitions, 1062 flow, removed 15 selfloop flow, removed 8 redundant places. [2022-12-13 17:15:52,725 INFO L231 Difference]: Finished difference. Result has 79 places, 62 transitions, 396 flow [2022-12-13 17:15:52,725 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=255, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=396, PETRI_PLACES=79, PETRI_TRANSITIONS=62} [2022-12-13 17:15:52,725 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 34 predicate places. [2022-12-13 17:15:52,725 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 62 transitions, 396 flow [2022-12-13 17:15:52,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 120.88888888888889) internal successors, (1088), 9 states have internal predecessors, (1088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:15:52,726 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:15:52,726 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:15:52,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 17:15:52,726 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 17:15:52,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:15:52,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1220807352, now seen corresponding path program 5 times [2022-12-13 17:15:52,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:15:52,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959945443] [2022-12-13 17:15:52,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:15:52,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:15:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:15:52,756 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:15:52,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:15:52,810 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:15:52,810 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 17:15:52,811 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 17:15:52,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 17:15:52,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 17:15:52,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 17:15:52,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 17:15:52,812 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 17:15:52,813 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 17:15:52,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 17:15:52,813 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:15:52,817 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 17:15:52,817 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:15:52,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:15:52 BasicIcfg [2022-12-13 17:15:52,865 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:15:52,866 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:15:52,866 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:15:52,866 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:15:52,866 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:15:22" (3/4) ... [2022-12-13 17:15:52,868 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 17:15:52,918 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5817b44-b4e3-45e7-b190-0d929114d85d/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 17:15:52,919 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:15:52,919 INFO L158 Benchmark]: Toolchain (without parser) took 30991.47ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 113.2MB in the beginning and 718.8MB in the end (delta: -605.7MB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2022-12-13 17:15:52,919 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 100.7MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:15:52,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 358.93ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 84.8MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 17:15:52,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.36ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:15:52,920 INFO L158 Benchmark]: Boogie Preprocessor took 23.16ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 80.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:15:52,920 INFO L158 Benchmark]: RCFGBuilder took 554.65ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 108.8MB in the end (delta: -28.5MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. [2022-12-13 17:15:52,920 INFO L158 Benchmark]: TraceAbstraction took 29962.40ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 108.1MB in the beginning and 734.6MB in the end (delta: -626.6MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-12-13 17:15:52,920 INFO L158 Benchmark]: Witness Printer took 52.83ms. Allocated memory is still 2.2GB. Free memory was 734.6MB in the beginning and 718.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 17:15:52,921 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.11ms. Allocated memory is still 100.7MB. Free memory is still 69.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 358.93ms. Allocated memory is still 142.6MB. Free memory was 113.2MB in the beginning and 84.8MB in the end (delta: 28.4MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.36ms. Allocated memory is still 142.6MB. Free memory was 84.8MB in the beginning and 82.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.16ms. Allocated memory is still 142.6MB. Free memory was 82.1MB in the beginning and 80.3MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 554.65ms. Allocated memory is still 142.6MB. Free memory was 80.3MB in the beginning and 108.8MB in the end (delta: -28.5MB). Peak memory consumption was 42.5MB. Max. memory is 16.1GB. * TraceAbstraction took 29962.40ms. Allocated memory was 142.6MB in the beginning and 2.2GB in the end (delta: 2.1GB). Free memory was 108.1MB in the beginning and 734.6MB in the end (delta: -626.6MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 52.83ms. Allocated memory is still 2.2GB. Free memory was 734.6MB in the beginning and 718.8MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.1s, 146 PlacesBefore, 45 PlacesAfterwards, 135 TransitionsBefore, 33 TransitionsAfterwards, 3518 CoEnabledTransitionPairs, 7 FixpointIterations, 46 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 10158 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4735, independent: 4480, independent conditional: 0, independent unconditional: 4480, dependent: 255, dependent conditional: 0, dependent unconditional: 255, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1893, independent: 1849, independent conditional: 0, independent unconditional: 1849, dependent: 44, dependent conditional: 0, dependent unconditional: 44, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4735, independent: 2631, independent conditional: 0, independent unconditional: 2631, dependent: 211, dependent conditional: 0, dependent unconditional: 211, unknown: 1893, unknown conditional: 0, unknown unconditional: 1893] , Statistics on independence cache: Total cache size (in pairs): 210, Positive cache size: 189, Positive conditional cache size: 0, Positive unconditional cache size: 189, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool b$flush_delayed; [L722] 0 int b$mem_tmp; [L723] 0 _Bool b$r_buff0_thd0; [L724] 0 _Bool b$r_buff0_thd1; [L725] 0 _Bool b$r_buff0_thd2; [L726] 0 _Bool b$r_buff0_thd3; [L727] 0 _Bool b$r_buff0_thd4; [L728] 0 _Bool b$r_buff1_thd0; [L729] 0 _Bool b$r_buff1_thd1; [L730] 0 _Bool b$r_buff1_thd2; [L731] 0 _Bool b$r_buff1_thd3; [L732] 0 _Bool b$r_buff1_thd4; [L733] 0 _Bool b$read_delayed; [L734] 0 int *b$read_delayed_var; [L735] 0 int b$w_buff0; [L736] 0 _Bool b$w_buff0_used; [L737] 0 int b$w_buff1; [L738] 0 _Bool b$w_buff1_used; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L869] 0 pthread_t t1161; [L870] FCALL, FORK 0 pthread_create(&t1161, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1161, ((void *)0), P0, ((void *)0))=-1, t1161={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L871] 0 pthread_t t1162; [L872] FCALL, FORK 0 pthread_create(&t1162, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1162, ((void *)0), P1, ((void *)0))=0, t1161={5:0}, t1162={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t1163; [L874] FCALL, FORK 0 pthread_create(&t1163, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1163, ((void *)0), P2, ((void *)0))=1, t1161={5:0}, t1162={6:0}, t1163={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t1164; [L876] FCALL, FORK 0 pthread_create(&t1164, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1164, ((void *)0), P3, ((void *)0))=2, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L752] 1 b$w_buff1 = b$w_buff0 [L753] 1 b$w_buff0 = 1 [L754] 1 b$w_buff1_used = b$w_buff0_used [L755] 1 b$w_buff0_used = (_Bool)1 [L756] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L756] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L757] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L758] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L759] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L760] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L761] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L762] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L782] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L785] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L802] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L805] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L822] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L825] 4 a = 1 [L828] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 b$flush_delayed = weak$$choice2 [L834] 4 b$mem_tmp = b [L835] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L836] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L837] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L838] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L839] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L840] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L841] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 __unbuffered_p3_EBX = b [L843] 4 b = b$flush_delayed ? b$mem_tmp : b [L844] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L847] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L848] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L849] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L850] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L851] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L768] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L769] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L770] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L771] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L772] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 1 return 0; [L788] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L789] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L790] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L791] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L792] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L795] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 2 return 0; [L808] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L809] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L810] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L811] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L812] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L815] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L817] 3 return 0; [L854] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L856] 4 return 0; [L878] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L880] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L880] RET 0 assume_abort_if_not(main$tmp_guard0) [L882] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L883] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L884] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L885] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L886] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, t1161={5:0}, t1162={6:0}, t1163={7:0}, t1164={3:0}, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] [L889] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L891] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=255, x=2, y=1, z=2] - 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: 874]: 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: 876]: 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: 872]: 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: 870]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 177 locations, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 29.8s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1064 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 904 mSDsluCounter, 663 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 602 mSDsCounter, 142 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3187 IncrementalHoareTripleChecker+Invalid, 3329 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 142 mSolverCounterUnsat, 61 mSDtfsCounter, 3187 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=896occurred in iteration=10, InterpolantAutomatonStates: 87, 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.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 334 NumberOfCodeBlocks, 334 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 290 ConstructedInterpolants, 0 QuantifiedInterpolants, 2111 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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 17:15:52,934 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f5817b44-b4e3-45e7-b190-0d929114d85d/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