./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eda076b-5cc7-4814-a53b-70ae972bd947/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eda076b-5cc7-4814-a53b-70ae972bd947/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_2eda076b-5cc7-4814-a53b-70ae972bd947/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eda076b-5cc7-4814-a53b-70ae972bd947/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eda076b-5cc7-4814-a53b-70ae972bd947/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_2eda076b-5cc7-4814-a53b-70ae972bd947/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 497394b95b3d1d02ab9ce49b64d507b876172aa5c11270440b3f7ed6bf5019ac --- 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 18:31:41,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:31:41,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:31:41,637 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:31:41,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:31:41,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:31:41,639 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:31:41,640 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:31:41,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:31:41,642 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:31:41,643 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:31:41,643 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:31:41,643 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:31:41,644 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:31:41,655 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:31:41,656 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:31:41,657 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:31:41,658 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:31:41,659 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:31:41,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:31:41,662 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:31:41,663 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:31:41,665 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:31:41,665 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:31:41,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:31:41,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:31:41,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:31:41,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:31:41,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:31:41,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:31:41,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:31:41,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:31:41,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:31:41,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:31:41,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:31:41,679 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:31:41,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:31:41,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:31:41,680 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:31:41,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:31:41,681 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:31:41,682 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eda076b-5cc7-4814-a53b-70ae972bd947/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 18:31:41,695 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:31:41,695 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:31:41,696 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:31:41,696 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:31:41,696 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:31:41,696 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:31:41,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:31:41,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:31:41,697 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:31:41,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:31:41,697 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:31:41,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:31:41,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:31:41,698 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:31:41,698 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 18:31:41,698 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:31:41,698 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 18:31:41,698 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:31:41,698 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 18:31:41,699 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:31:41,699 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 18:31:41,699 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:31:41,699 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:31:41,699 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:31:41,699 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:31:41,699 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:31:41,699 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:31:41,700 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 18:31:41,700 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:31:41,700 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:31:41,700 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:31:41,700 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 18:31:41,700 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:31:41,700 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:31:41,700 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:31:41,701 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_2eda076b-5cc7-4814-a53b-70ae972bd947/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_2eda076b-5cc7-4814-a53b-70ae972bd947/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 -> 497394b95b3d1d02ab9ce49b64d507b876172aa5c11270440b3f7ed6bf5019ac [2022-12-13 18:31:41,855 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:31:41,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:31:41,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:31:41,877 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:31:41,877 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:31:41,878 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eda076b-5cc7-4814-a53b-70ae972bd947/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 18:31:44,578 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:31:44,783 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:31:44,783 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eda076b-5cc7-4814-a53b-70ae972bd947/sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 18:31:44,792 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eda076b-5cc7-4814-a53b-70ae972bd947/bin/uautomizer-uyxdKDjOR8/data/d649ec0df/4d611aa6c50e4e8ab0cc4b339c045b3a/FLAG17bfd510b [2022-12-13 18:31:44,802 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eda076b-5cc7-4814-a53b-70ae972bd947/bin/uautomizer-uyxdKDjOR8/data/d649ec0df/4d611aa6c50e4e8ab0cc4b339c045b3a [2022-12-13 18:31:44,804 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:31:44,805 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:31:44,806 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:31:44,806 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:31:44,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:31:44,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:31:44" (1/1) ... [2022-12-13 18:31:44,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b817334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:44, skipping insertion in model container [2022-12-13 18:31:44,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:31:44" (1/1) ... [2022-12-13 18:31:44,815 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:31:44,841 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:31:44,949 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_2eda076b-5cc7-4814-a53b-70ae972bd947/sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-13 18:31:45,044 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,046 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,047 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,052 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,056 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,065 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,066 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,074 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,075 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:31:45,083 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:31:45,091 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_2eda076b-5cc7-4814-a53b-70ae972bd947/sv-benchmarks/c/pthread-wmm/safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2022-12-13 18:31:45,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,110 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,111 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,113 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,115 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,118 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:31:45,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:31:45,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:31:45,155 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:31:45,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:45 WrapperNode [2022-12-13 18:31:45,155 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:31:45,156 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:31:45,156 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:31:45,156 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:31:45,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:45" (1/1) ... [2022-12-13 18:31:45,172 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:45" (1/1) ... [2022-12-13 18:31:45,189 INFO L138 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 127 [2022-12-13 18:31:45,189 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:31:45,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:31:45,189 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:31:45,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:31:45,196 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:45" (1/1) ... [2022-12-13 18:31:45,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:45" (1/1) ... [2022-12-13 18:31:45,199 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:45" (1/1) ... [2022-12-13 18:31:45,199 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:45" (1/1) ... [2022-12-13 18:31:45,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:45" (1/1) ... [2022-12-13 18:31:45,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:45" (1/1) ... [2022-12-13 18:31:45,207 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:45" (1/1) ... [2022-12-13 18:31:45,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:45" (1/1) ... [2022-12-13 18:31:45,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:31:45,210 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:31:45,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:31:45,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:31:45,211 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:45" (1/1) ... [2022-12-13 18:31:45,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:31:45,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eda076b-5cc7-4814-a53b-70ae972bd947/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:31:45,240 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eda076b-5cc7-4814-a53b-70ae972bd947/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:31:45,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eda076b-5cc7-4814-a53b-70ae972bd947/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:31:45,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 18:31:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 18:31:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:31:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 18:31:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:31:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 18:31:45,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 18:31:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 18:31:45,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 18:31:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 18:31:45,274 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 18:31:45,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:31:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 18:31:45,275 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:31:45,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:31:45,276 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 18:31:45,379 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:31:45,381 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:31:45,618 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:31:45,718 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:31:45,718 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 18:31:45,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:31:45 BoogieIcfgContainer [2022-12-13 18:31:45,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:31:45,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:31:45,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:31:45,724 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:31:45,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:31:44" (1/3) ... [2022-12-13 18:31:45,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf566b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:31:45, skipping insertion in model container [2022-12-13 18:31:45,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:31:45" (2/3) ... [2022-12-13 18:31:45,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf566b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:31:45, skipping insertion in model container [2022-12-13 18:31:45,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:31:45" (3/3) ... [2022-12-13 18:31:45,727 INFO L112 eAbstractionObserver]: Analyzing ICFG safe026_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2022-12-13 18:31:45,733 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 18:31:45,741 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:31:45,741 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 18:31:45,741 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 18:31:45,780 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 18:31:45,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 121 places, 113 transitions, 241 flow [2022-12-13 18:31:45,838 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-13 18:31:45,839 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:31:45,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 18:31:45,842 INFO L82 GeneralOperation]: Start removeDead. Operand has 121 places, 113 transitions, 241 flow [2022-12-13 18:31:45,845 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 118 places, 110 transitions, 229 flow [2022-12-13 18:31:45,848 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 18:31:45,855 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-13 18:31:45,857 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 229 flow [2022-12-13 18:31:45,858 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 229 flow [2022-12-13 18:31:45,876 INFO L130 PetriNetUnfolder]: 2/110 cut-off events. [2022-12-13 18:31:45,876 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:31:45,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 110 events. 2/110 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/106 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2022-12-13 18:31:45,877 INFO L119 LiptonReduction]: Number of co-enabled transitions 1986 [2022-12-13 18:31:48,506 INFO L134 LiptonReduction]: Checked pairs total: 4624 [2022-12-13 18:31:48,506 INFO L136 LiptonReduction]: Total number of compositions: 98 [2022-12-13 18:31:48,516 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:31:48,520 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;@4398aa30, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:31:48,521 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 18:31:48,522 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2022-12-13 18:31:48,523 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:31:48,523 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:31:48,523 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 18:31:48,523 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 18:31:48,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:48,527 INFO L85 PathProgramCache]: Analyzing trace with hash 484343, now seen corresponding path program 1 times [2022-12-13 18:31:48,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:48,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481803299] [2022-12-13 18:31:48,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:48,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:48,814 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 18:31:48,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:48,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481803299] [2022-12-13 18:31:48,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481803299] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:48,816 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:48,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:31:48,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438542397] [2022-12-13 18:31:48,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:48,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:31:48,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:48,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:31:48,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:31:48,845 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 211 [2022-12-13 18:31:48,847 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:48,847 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:31:48,847 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 211 [2022-12-13 18:31:48,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:31:49,129 INFO L130 PetriNetUnfolder]: 1263/2014 cut-off events. [2022-12-13 18:31:49,129 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2022-12-13 18:31:49,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3925 conditions, 2014 events. 1263/2014 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 10342 event pairs, 204 based on Foata normal form. 80/1934 useless extension candidates. Maximal degree in co-relation 3914. Up to 1510 conditions per place. [2022-12-13 18:31:49,141 INFO L137 encePairwiseOnDemand]: 207/211 looper letters, 33 selfloop transitions, 2 changer transitions 4/40 dead transitions. [2022-12-13 18:31:49,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 173 flow [2022-12-13 18:31:49,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:31:49,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:31:49,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2022-12-13 18:31:49,153 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5355450236966824 [2022-12-13 18:31:49,154 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 339 transitions. [2022-12-13 18:31:49,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 339 transitions. [2022-12-13 18:31:49,155 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:31:49,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 339 transitions. [2022-12-13 18:31:49,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:49,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:49,167 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 211.0) internal successors, (844), 4 states have internal predecessors, (844), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:49,169 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 339 transitions. [2022-12-13 18:31:49,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 173 flow [2022-12-13 18:31:49,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 40 transitions, 168 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 18:31:49,172 INFO L231 Difference]: Finished difference. Result has 32 places, 21 transitions, 52 flow [2022-12-13 18:31:49,174 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=32, PETRI_TRANSITIONS=21} [2022-12-13 18:31:49,177 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-13 18:31:49,177 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 21 transitions, 52 flow [2022-12-13 18:31:49,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:49,177 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:31:49,178 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:49,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:31:49,178 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 18:31:49,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:49,179 INFO L85 PathProgramCache]: Analyzing trace with hash 822529359, now seen corresponding path program 1 times [2022-12-13 18:31:49,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:49,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241859542] [2022-12-13 18:31:49,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:49,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:49,390 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 18:31:49,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:49,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241859542] [2022-12-13 18:31:49,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241859542] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:49,391 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:49,391 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:31:49,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244491651] [2022-12-13 18:31:49,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:49,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:31:49,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:49,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:31:49,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:31:49,410 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 211 [2022-12-13 18:31:49,411 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 21 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:49,411 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:31:49,411 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 211 [2022-12-13 18:31:49,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:31:49,818 INFO L130 PetriNetUnfolder]: 1918/2919 cut-off events. [2022-12-13 18:31:49,818 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2022-12-13 18:31:49,821 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6040 conditions, 2919 events. 1918/2919 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 14363 event pairs, 571 based on Foata normal form. 157/3076 useless extension candidates. Maximal degree in co-relation 6030. Up to 1664 conditions per place. [2022-12-13 18:31:49,830 INFO L137 encePairwiseOnDemand]: 204/211 looper letters, 32 selfloop transitions, 5 changer transitions 23/60 dead transitions. [2022-12-13 18:31:49,830 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 60 transitions, 258 flow [2022-12-13 18:31:49,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:31:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 18:31:49,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2022-12-13 18:31:49,834 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4995260663507109 [2022-12-13 18:31:49,834 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 527 transitions. [2022-12-13 18:31:49,835 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 527 transitions. [2022-12-13 18:31:49,835 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:31:49,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 527 transitions. [2022-12-13 18:31:49,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.4) internal successors, (527), 5 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:49,840 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:49,841 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:49,841 INFO L175 Difference]: Start difference. First operand has 32 places, 21 transitions, 52 flow. Second operand 5 states and 527 transitions. [2022-12-13 18:31:49,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 60 transitions, 258 flow [2022-12-13 18:31:49,842 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 60 transitions, 248 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:31:49,843 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 98 flow [2022-12-13 18:31:49,843 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=98, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2022-12-13 18:31:49,844 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-13 18:31:49,844 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 98 flow [2022-12-13 18:31:49,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.5) internal successors, (382), 4 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:49,844 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:31:49,844 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:49,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:31:49,845 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 18:31:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:49,845 INFO L85 PathProgramCache]: Analyzing trace with hash -271446673, now seen corresponding path program 1 times [2022-12-13 18:31:49,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:49,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220531538] [2022-12-13 18:31:49,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:49,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:49,992 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 18:31:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:49,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220531538] [2022-12-13 18:31:49,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220531538] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:49,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:49,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:31:49,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864483760] [2022-12-13 18:31:49,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:49,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:31:49,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:49,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:31:49,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:31:50,004 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 211 [2022-12-13 18:31:50,005 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 98 flow. Second operand has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:50,005 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:31:50,005 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 211 [2022-12-13 18:31:50,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:31:50,368 INFO L130 PetriNetUnfolder]: 1535/2382 cut-off events. [2022-12-13 18:31:50,368 INFO L131 PetriNetUnfolder]: For 1388/1406 co-relation queries the response was YES. [2022-12-13 18:31:50,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6159 conditions, 2382 events. 1535/2382 cut-off events. For 1388/1406 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 11521 event pairs, 411 based on Foata normal form. 121/2491 useless extension candidates. Maximal degree in co-relation 6145. Up to 1784 conditions per place. [2022-12-13 18:31:50,381 INFO L137 encePairwiseOnDemand]: 207/211 looper letters, 28 selfloop transitions, 3 changer transitions 17/50 dead transitions. [2022-12-13 18:31:50,381 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 50 transitions, 266 flow [2022-12-13 18:31:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:31:50,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 18:31:50,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 530 transitions. [2022-12-13 18:31:50,383 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5023696682464455 [2022-12-13 18:31:50,383 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 530 transitions. [2022-12-13 18:31:50,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 530 transitions. [2022-12-13 18:31:50,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:31:50,384 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 530 transitions. [2022-12-13 18:31:50,386 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:50,388 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:50,389 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:50,389 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 98 flow. Second operand 5 states and 530 transitions. [2022-12-13 18:31:50,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 50 transitions, 266 flow [2022-12-13 18:31:50,396 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 50 transitions, 244 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 18:31:50,397 INFO L231 Difference]: Finished difference. Result has 39 places, 25 transitions, 99 flow [2022-12-13 18:31:50,397 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=99, PETRI_PLACES=39, PETRI_TRANSITIONS=25} [2022-12-13 18:31:50,397 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 5 predicate places. [2022-12-13 18:31:50,398 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 25 transitions, 99 flow [2022-12-13 18:31:50,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.75) internal successors, (399), 4 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:50,398 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:31:50,398 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:50,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 18:31:50,399 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 18:31:50,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:50,399 INFO L85 PathProgramCache]: Analyzing trace with hash -271413999, now seen corresponding path program 1 times [2022-12-13 18:31:50,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:50,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325800589] [2022-12-13 18:31:50,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:50,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:50,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:50,530 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 18:31:50,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:50,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325800589] [2022-12-13 18:31:50,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325800589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:50,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:50,531 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:31:50,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112007543] [2022-12-13 18:31:50,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:50,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:31:50,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:50,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:31:50,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:31:50,548 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 211 [2022-12-13 18:31:50,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 25 transitions, 99 flow. Second operand has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:50,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:31:50,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 211 [2022-12-13 18:31:50,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:31:51,036 INFO L130 PetriNetUnfolder]: 1619/2500 cut-off events. [2022-12-13 18:31:51,036 INFO L131 PetriNetUnfolder]: For 1949/1949 co-relation queries the response was YES. [2022-12-13 18:31:51,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6510 conditions, 2500 events. 1619/2500 cut-off events. For 1949/1949 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 12245 event pairs, 342 based on Foata normal form. 125/2625 useless extension candidates. Maximal degree in co-relation 6493. Up to 1414 conditions per place. [2022-12-13 18:31:51,048 INFO L137 encePairwiseOnDemand]: 204/211 looper letters, 41 selfloop transitions, 9 changer transitions 25/75 dead transitions. [2022-12-13 18:31:51,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 75 transitions, 406 flow [2022-12-13 18:31:51,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:31:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 18:31:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 727 transitions. [2022-12-13 18:31:51,051 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4922139471902505 [2022-12-13 18:31:51,051 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 727 transitions. [2022-12-13 18:31:51,051 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 727 transitions. [2022-12-13 18:31:51,052 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:31:51,052 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 727 transitions. [2022-12-13 18:31:51,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:51,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:51,058 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 211.0) internal successors, (1688), 8 states have internal predecessors, (1688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:51,058 INFO L175 Difference]: Start difference. First operand has 39 places, 25 transitions, 99 flow. Second operand 7 states and 727 transitions. [2022-12-13 18:31:51,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 75 transitions, 406 flow [2022-12-13 18:31:51,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 75 transitions, 388 flow, removed 5 selfloop flow, removed 5 redundant places. [2022-12-13 18:31:51,063 INFO L231 Difference]: Finished difference. Result has 43 places, 29 transitions, 149 flow [2022-12-13 18:31:51,063 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=43, PETRI_TRANSITIONS=29} [2022-12-13 18:31:51,064 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 9 predicate places. [2022-12-13 18:31:51,064 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 29 transitions, 149 flow [2022-12-13 18:31:51,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:51,065 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:31:51,065 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:51,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 18:31:51,065 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 18:31:51,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:51,065 INFO L85 PathProgramCache]: Analyzing trace with hash 175067377, now seen corresponding path program 1 times [2022-12-13 18:31:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:51,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174155730] [2022-12-13 18:31:51,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:51,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:51,187 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 18:31:51,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:51,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174155730] [2022-12-13 18:31:51,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174155730] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:51,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:51,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:31:51,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85397560] [2022-12-13 18:31:51,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:51,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:31:51,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:51,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:31:51,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:31:51,199 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 211 [2022-12-13 18:31:51,200 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 29 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:51,200 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:31:51,200 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 211 [2022-12-13 18:31:51,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:31:51,427 INFO L130 PetriNetUnfolder]: 951/1570 cut-off events. [2022-12-13 18:31:51,427 INFO L131 PetriNetUnfolder]: For 1557/1590 co-relation queries the response was YES. [2022-12-13 18:31:51,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4540 conditions, 1570 events. 951/1570 cut-off events. For 1557/1590 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 7790 event pairs, 193 based on Foata normal form. 158/1725 useless extension candidates. Maximal degree in co-relation 4521. Up to 709 conditions per place. [2022-12-13 18:31:51,432 INFO L137 encePairwiseOnDemand]: 205/211 looper letters, 53 selfloop transitions, 5 changer transitions 1/62 dead transitions. [2022-12-13 18:31:51,432 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 62 transitions, 413 flow [2022-12-13 18:31:51,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:31:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:31:51,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 423 transitions. [2022-12-13 18:31:51,434 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5011848341232228 [2022-12-13 18:31:51,434 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 423 transitions. [2022-12-13 18:31:51,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 423 transitions. [2022-12-13 18:31:51,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:31:51,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 423 transitions. [2022-12-13 18:31:51,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 105.75) internal successors, (423), 4 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 18:31:51,436 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:51,436 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 211.0) internal successors, (1055), 5 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:51,436 INFO L175 Difference]: Start difference. First operand has 43 places, 29 transitions, 149 flow. Second operand 4 states and 423 transitions. [2022-12-13 18:31:51,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 62 transitions, 413 flow [2022-12-13 18:31:51,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 62 transitions, 401 flow, removed 6 selfloop flow, removed 3 redundant places. [2022-12-13 18:31:51,440 INFO L231 Difference]: Finished difference. Result has 42 places, 32 transitions, 175 flow [2022-12-13 18:31:51,440 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=42, PETRI_TRANSITIONS=32} [2022-12-13 18:31:51,441 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 8 predicate places. [2022-12-13 18:31:51,441 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 32 transitions, 175 flow [2022-12-13 18:31:51,442 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.0) internal successors, (388), 4 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:51,442 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:31:51,442 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:51,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 18:31:51,442 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 18:31:51,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:51,443 INFO L85 PathProgramCache]: Analyzing trace with hash -145440377, now seen corresponding path program 1 times [2022-12-13 18:31:51,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:51,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374721955] [2022-12-13 18:31:51,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:51,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:51,573 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 18:31:51,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:51,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374721955] [2022-12-13 18:31:51,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374721955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:51,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:51,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:31:51,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111022495] [2022-12-13 18:31:51,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:51,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:31:51,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:51,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:31:51,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:31:51,585 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 211 [2022-12-13 18:31:51,585 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 32 transitions, 175 flow. Second operand has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:51,585 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:31:51,585 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 211 [2022-12-13 18:31:51,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:31:51,796 INFO L130 PetriNetUnfolder]: 441/793 cut-off events. [2022-12-13 18:31:51,796 INFO L131 PetriNetUnfolder]: For 761/779 co-relation queries the response was YES. [2022-12-13 18:31:51,798 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 793 events. 441/793 cut-off events. For 761/779 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3631 event pairs, 81 based on Foata normal form. 89/879 useless extension candidates. Maximal degree in co-relation 2646. Up to 334 conditions per place. [2022-12-13 18:31:51,800 INFO L137 encePairwiseOnDemand]: 205/211 looper letters, 64 selfloop transitions, 8 changer transitions 1/76 dead transitions. [2022-12-13 18:31:51,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 76 transitions, 524 flow [2022-12-13 18:31:51,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:31:51,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 18:31:51,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 529 transitions. [2022-12-13 18:31:51,803 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5014218009478673 [2022-12-13 18:31:51,803 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 529 transitions. [2022-12-13 18:31:51,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 529 transitions. [2022-12-13 18:31:51,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:31:51,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 529 transitions. [2022-12-13 18:31:51,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:51,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:51,807 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 211.0) internal successors, (1266), 6 states have internal predecessors, (1266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:51,807 INFO L175 Difference]: Start difference. First operand has 42 places, 32 transitions, 175 flow. Second operand 5 states and 529 transitions. [2022-12-13 18:31:51,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 76 transitions, 524 flow [2022-12-13 18:31:51,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 76 transitions, 514 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 18:31:51,810 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 215 flow [2022-12-13 18:31:51,811 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=215, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2022-12-13 18:31:51,811 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2022-12-13 18:31:51,811 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 215 flow [2022-12-13 18:31:51,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.8) internal successors, (484), 5 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:51,812 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:31:51,812 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:51,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 18:31:51,812 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 18:31:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:51,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1761243450, now seen corresponding path program 1 times [2022-12-13 18:31:51,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:51,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287693813] [2022-12-13 18:31:51,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:51,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:51,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:52,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:31:52,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:52,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287693813] [2022-12-13 18:31:52,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287693813] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:52,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:52,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:31:52,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230165619] [2022-12-13 18:31:52,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:52,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:31:52,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:52,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:31:52,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:31:52,028 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 211 [2022-12-13 18:31:52,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 35 transitions, 215 flow. Second operand has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:52,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:31:52,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 211 [2022-12-13 18:31:52,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:31:52,199 INFO L130 PetriNetUnfolder]: 283/514 cut-off events. [2022-12-13 18:31:52,199 INFO L131 PetriNetUnfolder]: For 787/802 co-relation queries the response was YES. [2022-12-13 18:31:52,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1895 conditions, 514 events. 283/514 cut-off events. For 787/802 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2159 event pairs, 79 based on Foata normal form. 28/539 useless extension candidates. Maximal degree in co-relation 1873. Up to 198 conditions per place. [2022-12-13 18:31:52,203 INFO L137 encePairwiseOnDemand]: 205/211 looper letters, 46 selfloop transitions, 11 changer transitions 3/63 dead transitions. [2022-12-13 18:31:52,203 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 63 transitions, 466 flow [2022-12-13 18:31:52,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:31:52,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:31:52,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 613 transitions. [2022-12-13 18:31:52,205 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48420221169036337 [2022-12-13 18:31:52,205 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 613 transitions. [2022-12-13 18:31:52,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 613 transitions. [2022-12-13 18:31:52,205 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:31:52,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 613 transitions. [2022-12-13 18:31:52,206 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:52,207 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:52,207 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 211.0) internal successors, (1477), 7 states have internal predecessors, (1477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:52,207 INFO L175 Difference]: Start difference. First operand has 46 places, 35 transitions, 215 flow. Second operand 6 states and 613 transitions. [2022-12-13 18:31:52,208 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 63 transitions, 466 flow [2022-12-13 18:31:52,210 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 63 transitions, 427 flow, removed 7 selfloop flow, removed 5 redundant places. [2022-12-13 18:31:52,210 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 219 flow [2022-12-13 18:31:52,210 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=219, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2022-12-13 18:31:52,211 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2022-12-13 18:31:52,211 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 219 flow [2022-12-13 18:31:52,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.83333333333333) internal successors, (581), 6 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:52,211 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:31:52,211 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 18:31:52,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 18:31:52,211 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 18:31:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1393504293, now seen corresponding path program 1 times [2022-12-13 18:31:52,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:52,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511160812] [2022-12-13 18:31:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:52,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:52,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:31:52,789 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 18:31:52,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:31:52,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511160812] [2022-12-13 18:31:52,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511160812] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:31:52,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:31:52,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:31:52,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894529502] [2022-12-13 18:31:52,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:31:52,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:31:52,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:31:52,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:31:52,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:31:52,850 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 211 [2022-12-13 18:31:52,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 35 transitions, 219 flow. Second operand has 8 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:52,852 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:31:52,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 211 [2022-12-13 18:31:52,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:31:53,166 INFO L130 PetriNetUnfolder]: 288/547 cut-off events. [2022-12-13 18:31:53,166 INFO L131 PetriNetUnfolder]: For 993/993 co-relation queries the response was YES. [2022-12-13 18:31:53,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2010 conditions, 547 events. 288/547 cut-off events. For 993/993 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2489 event pairs, 20 based on Foata normal form. 1/548 useless extension candidates. Maximal degree in co-relation 1988. Up to 268 conditions per place. [2022-12-13 18:31:53,169 INFO L137 encePairwiseOnDemand]: 204/211 looper letters, 49 selfloop transitions, 4 changer transitions 25/81 dead transitions. [2022-12-13 18:31:53,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 81 transitions, 652 flow [2022-12-13 18:31:53,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 18:31:53,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 18:31:53,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 796 transitions. [2022-12-13 18:31:53,170 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.471563981042654 [2022-12-13 18:31:53,171 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 796 transitions. [2022-12-13 18:31:53,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 796 transitions. [2022-12-13 18:31:53,171 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:31:53,171 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 796 transitions. [2022-12-13 18:31:53,173 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:53,176 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:53,176 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 211.0) internal successors, (1899), 9 states have internal predecessors, (1899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:53,176 INFO L175 Difference]: Start difference. First operand has 48 places, 35 transitions, 219 flow. Second operand 8 states and 796 transitions. [2022-12-13 18:31:53,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 81 transitions, 652 flow [2022-12-13 18:31:53,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 81 transitions, 490 flow, removed 28 selfloop flow, removed 10 redundant places. [2022-12-13 18:31:53,181 INFO L231 Difference]: Finished difference. Result has 48 places, 35 transitions, 173 flow [2022-12-13 18:31:53,181 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=211, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=173, PETRI_PLACES=48, PETRI_TRANSITIONS=35} [2022-12-13 18:31:53,182 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2022-12-13 18:31:53,182 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 35 transitions, 173 flow [2022-12-13 18:31:53,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.5) internal successors, (764), 8 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:31:53,182 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:31:53,183 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 18:31:53,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 18:31:53,183 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 18:31:53,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:31:53,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1157222509, now seen corresponding path program 2 times [2022-12-13 18:31:53,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:31:53,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821759262] [2022-12-13 18:31:53,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:31:53,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:31:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:31:53,231 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:31:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:31:53,290 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:31:53,290 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 18:31:53,291 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 18:31:53,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 18:31:53,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 18:31:53,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 18:31:53,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 18:31:53,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 18:31:53,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 18:31:53,293 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:31:53,297 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 18:31:53,298 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:31:53,331 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:31:53 BasicIcfg [2022-12-13 18:31:53,331 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:31:53,332 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:31:53,332 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:31:53,332 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:31:53,332 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:31:45" (3/4) ... [2022-12-13 18:31:53,334 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 18:31:53,375 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eda076b-5cc7-4814-a53b-70ae972bd947/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 18:31:53,375 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:31:53,376 INFO L158 Benchmark]: Toolchain (without parser) took 8570.95ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 109.0MB in the beginning and 102.3MB in the end (delta: 6.7MB). Peak memory consumption was 42.7MB. Max. memory is 16.1GB. [2022-12-13 18:31:53,376 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 100.7MB. Free memory was 66.4MB in the beginning and 66.3MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:31:53,376 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.01ms. Allocated memory is still 169.9MB. Free memory was 109.0MB in the beginning and 83.0MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 18:31:53,376 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.85ms. Allocated memory is still 169.9MB. Free memory was 83.0MB in the beginning and 80.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:31:53,376 INFO L158 Benchmark]: Boogie Preprocessor took 20.64ms. Allocated memory is still 169.9MB. Free memory was 80.5MB in the beginning and 78.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:31:53,377 INFO L158 Benchmark]: RCFGBuilder took 509.78ms. Allocated memory is still 169.9MB. Free memory was 78.8MB in the beginning and 133.8MB in the end (delta: -55.0MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2022-12-13 18:31:53,377 INFO L158 Benchmark]: TraceAbstraction took 7609.63ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 133.1MB in the beginning and 112.8MB in the end (delta: 20.3MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. [2022-12-13 18:31:53,377 INFO L158 Benchmark]: Witness Printer took 43.54ms. Allocated memory is still 205.5MB. Free memory was 112.8MB in the beginning and 102.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 18:31:53,378 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.16ms. Allocated memory is still 100.7MB. Free memory was 66.4MB in the beginning and 66.3MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.01ms. Allocated memory is still 169.9MB. Free memory was 109.0MB in the beginning and 83.0MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.85ms. Allocated memory is still 169.9MB. Free memory was 83.0MB in the beginning and 80.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.64ms. Allocated memory is still 169.9MB. Free memory was 80.5MB in the beginning and 78.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 509.78ms. Allocated memory is still 169.9MB. Free memory was 78.8MB in the beginning and 133.8MB in the end (delta: -55.0MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * TraceAbstraction took 7609.63ms. Allocated memory was 169.9MB in the beginning and 205.5MB in the end (delta: 35.7MB). Free memory was 133.1MB in the beginning and 112.8MB in the end (delta: 20.3MB). Peak memory consumption was 56.0MB. Max. memory is 16.1GB. * Witness Printer took 43.54ms. Allocated memory is still 205.5MB. Free memory was 112.8MB in the beginning and 102.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 118 PlacesBefore, 34 PlacesAfterwards, 110 TransitionsBefore, 25 TransitionsAfterwards, 1986 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, 4624 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1783, independent: 1641, independent conditional: 0, independent unconditional: 1641, dependent: 142, dependent conditional: 0, dependent unconditional: 142, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1033, independent: 999, independent conditional: 0, independent unconditional: 999, dependent: 34, dependent conditional: 0, dependent unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1783, independent: 642, independent conditional: 0, independent unconditional: 642, dependent: 108, dependent conditional: 0, dependent unconditional: 108, unknown: 1033, unknown conditional: 0, unknown unconditional: 1033] , Statistics on independence cache: Total cache size (in pairs): 62, Positive cache size: 46, Positive conditional cache size: 0, Positive unconditional cache size: 46, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L720] 0 _Bool y$flush_delayed; [L721] 0 int y$mem_tmp; [L722] 0 _Bool y$r_buff0_thd0; [L723] 0 _Bool y$r_buff0_thd1; [L724] 0 _Bool y$r_buff0_thd2; [L725] 0 _Bool y$r_buff0_thd3; [L726] 0 _Bool y$r_buff1_thd0; [L727] 0 _Bool y$r_buff1_thd1; [L728] 0 _Bool y$r_buff1_thd2; [L729] 0 _Bool y$r_buff1_thd3; [L730] 0 _Bool y$read_delayed; [L731] 0 int *y$read_delayed_var; [L732] 0 int y$w_buff0; [L733] 0 _Bool y$w_buff0_used; [L734] 0 int y$w_buff1; [L735] 0 _Bool y$w_buff1_used; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L828] 0 pthread_t t2393; [L829] FCALL, FORK 0 pthread_create(&t2393, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2393, ((void *)0), P0, ((void *)0))=-3, t2393={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L830] 0 pthread_t t2394; [L831] FCALL, FORK 0 pthread_create(&t2394, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2394, ((void *)0), P1, ((void *)0))=-2, t2393={5:0}, t2394={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 pthread_t t2395; [L833] FCALL, FORK 0 pthread_create(&t2395, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2395, ((void *)0), P2, ((void *)0))=-1, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = y$w_buff0 [L742] 1 y$w_buff0 = 1 [L743] 1 y$w_buff1_used = y$w_buff0_used [L744] 1 y$w_buff0_used = (_Bool)1 [L745] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L745] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L746] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L774] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L775] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L776] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L777] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L791] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L792] 3 y$flush_delayed = weak$$choice2 [L793] 3 y$mem_tmp = y [L794] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L795] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L796] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L797] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L798] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L799] 3 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L800] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 __unbuffered_p2_EBX = y [L802] 3 y = y$flush_delayed ? y$mem_tmp : y [L803] 3 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L806] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L807] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L808] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L809] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L810] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L757] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L759] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L760] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L780] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L782] 2 return 0; [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L835] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L837] RET 0 assume_abort_if_not(main$tmp_guard0) [L839] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L840] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L841] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L842] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L843] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2393={5:0}, t2394={6:0}, t2395={3:0}, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L848] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=66, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 831]: 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: 833]: 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: 829]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 139 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 7.5s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 484 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 417 mSDsluCounter, 235 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 172 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 881 IncrementalHoareTripleChecker+Invalid, 943 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 63 mSDtfsCounter, 881 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=219occurred in iteration=7, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 120 NumberOfCodeBlocks, 120 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 91 ConstructedInterpolants, 0 QuantifiedInterpolants, 654 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 18:31:53,390 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2eda076b-5cc7-4814-a53b-70ae972bd947/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