./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix015.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b42fec22-72a8-4145-8bda-77aa3127207b/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b42fec22-72a8-4145-8bda-77aa3127207b/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_b42fec22-72a8-4145-8bda-77aa3127207b/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b42fec22-72a8-4145-8bda-77aa3127207b/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b42fec22-72a8-4145-8bda-77aa3127207b/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_b42fec22-72a8-4145-8bda-77aa3127207b/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 4f8371a34a183593aa0efc399c0d4d9ea84f8dd0da99bba9eb7bddd73e7a457d --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 17:06:22,701 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:06:22,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:06:22,721 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:06:22,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:06:22,723 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:06:22,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:06:22,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:06:22,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:06:22,728 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:06:22,729 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:06:22,730 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:06:22,730 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:06:22,731 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:06:22,732 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:06:22,733 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:06:22,734 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:06:22,734 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:06:22,736 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:06:22,738 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:06:22,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:06:22,741 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:06:22,742 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:06:22,742 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:06:22,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:06:22,746 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:06:22,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:06:22,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:06:22,747 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:06:22,748 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:06:22,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:06:22,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:06:22,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:06:22,751 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:06:22,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:06:22,752 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:06:22,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:06:22,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:06:22,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:06:22,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:06:22,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:06:22,754 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b42fec22-72a8-4145-8bda-77aa3127207b/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 17:06:22,783 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:06:22,784 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:06:22,784 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:06:22,784 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:06:22,785 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:06:22,785 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:06:22,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:06:22,786 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:06:22,791 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:06:22,791 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:06:22,791 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 17:06:22,791 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:06:22,791 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 17:06:22,791 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:06:22,792 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:06:22,792 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:06:22,792 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:06:22,792 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 17:06:22,792 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:06:22,792 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:06:22,793 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:06:22,793 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:06:22,793 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:06:22,793 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:06:22,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:06:22,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:06:22,794 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:06:22,794 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:06:22,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:06:22,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:06:22,794 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:06:22,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:06:22,794 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:06:22,795 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:06:22,795 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:06:22,795 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_b42fec22-72a8-4145-8bda-77aa3127207b/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_b42fec22-72a8-4145-8bda-77aa3127207b/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 -> 4f8371a34a183593aa0efc399c0d4d9ea84f8dd0da99bba9eb7bddd73e7a457d [2022-12-13 17:06:22,978 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:06:22,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:06:23,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:06:23,001 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:06:23,002 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:06:23,003 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b42fec22-72a8-4145-8bda-77aa3127207b/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix015.opt.i [2022-12-13 17:06:25,536 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:06:25,743 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:06:25,744 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b42fec22-72a8-4145-8bda-77aa3127207b/sv-benchmarks/c/pthread-wmm/mix015.opt.i [2022-12-13 17:06:25,755 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b42fec22-72a8-4145-8bda-77aa3127207b/bin/uautomizer-uyxdKDjOR8/data/1ea19299a/e26366079bf54b67919315df50436cd2/FLAG705b3c7df [2022-12-13 17:06:26,097 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b42fec22-72a8-4145-8bda-77aa3127207b/bin/uautomizer-uyxdKDjOR8/data/1ea19299a/e26366079bf54b67919315df50436cd2 [2022-12-13 17:06:26,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:06:26,101 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:06:26,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:06:26,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:06:26,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:06:26,107 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:06:26" (1/1) ... [2022-12-13 17:06:26,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596c1300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:06:26, skipping insertion in model container [2022-12-13 17:06:26,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:06:26" (1/1) ... [2022-12-13 17:06:26,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:06:26,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:06:26,271 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_b42fec22-72a8-4145-8bda-77aa3127207b/sv-benchmarks/c/pthread-wmm/mix015.opt.i[944,957] [2022-12-13 17:06:26,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,399 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,409 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,410 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,411 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,413 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,421 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,422 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,426 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,431 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,435 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:06:26,447 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:06:26,458 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_b42fec22-72a8-4145-8bda-77aa3127207b/sv-benchmarks/c/pthread-wmm/mix015.opt.i[944,957] [2022-12-13 17:06:26,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,480 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,494 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,496 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,497 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 17:06:26,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 17:06:26,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:06:26,536 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:06:26,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:06:26 WrapperNode [2022-12-13 17:06:26,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:06:26,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:06:26,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:06:26,538 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:06:26,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:06:26" (1/1) ... [2022-12-13 17:06:26,559 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:06:26" (1/1) ... [2022-12-13 17:06:26,581 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-12-13 17:06:26,581 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:06:26,582 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:06:26,582 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:06:26,582 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:06:26,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:06:26" (1/1) ... [2022-12-13 17:06:26,589 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:06:26" (1/1) ... [2022-12-13 17:06:26,591 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:06:26" (1/1) ... [2022-12-13 17:06:26,591 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:06:26" (1/1) ... [2022-12-13 17:06:26,596 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:06:26" (1/1) ... [2022-12-13 17:06:26,597 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:06:26" (1/1) ... [2022-12-13 17:06:26,599 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:06:26" (1/1) ... [2022-12-13 17:06:26,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:06:26" (1/1) ... [2022-12-13 17:06:26,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:06:26,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:06:26,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:06:26,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:06:26,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:06:26" (1/1) ... [2022-12-13 17:06:26,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:06:26,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b42fec22-72a8-4145-8bda-77aa3127207b/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:06:26,627 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b42fec22-72a8-4145-8bda-77aa3127207b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:06:26,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b42fec22-72a8-4145-8bda-77aa3127207b/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:06:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 17:06:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 17:06:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:06:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 17:06:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 17:06:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 17:06:26,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 17:06:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 17:06:26,653 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 17:06:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 17:06:26,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 17:06:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:06:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 17:06:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:06:26,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:06:26,655 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 17:06:26,758 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:06:26,759 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:06:27,031 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:06:27,146 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:06:27,146 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 17:06:27,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:06:27 BoogieIcfgContainer [2022-12-13 17:06:27,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:06:27,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:06:27,152 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:06:27,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:06:27,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:06:26" (1/3) ... [2022-12-13 17:06:27,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aae9e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:06:27, skipping insertion in model container [2022-12-13 17:06:27,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:06:26" (2/3) ... [2022-12-13 17:06:27,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aae9e32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:06:27, skipping insertion in model container [2022-12-13 17:06:27,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:06:27" (3/3) ... [2022-12-13 17:06:27,157 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015.opt.i [2022-12-13 17:06:27,166 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 17:06:27,174 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:06:27,174 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 17:06:27,174 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 17:06:27,218 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 17:06:27,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2022-12-13 17:06:27,284 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2022-12-13 17:06:27,284 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:06:27,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-12-13 17:06:27,289 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2022-12-13 17:06:27,292 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2022-12-13 17:06:27,294 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 17:06:27,301 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 117 transitions, 243 flow [2022-12-13 17:06:27,303 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 117 transitions, 243 flow [2022-12-13 17:06:27,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 243 flow [2022-12-13 17:06:27,322 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2022-12-13 17:06:27,322 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:06:27,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 58 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-12-13 17:06:27,323 INFO L119 LiptonReduction]: Number of co-enabled transitions 2174 [2022-12-13 17:06:29,901 INFO L134 LiptonReduction]: Checked pairs total: 5403 [2022-12-13 17:06:29,901 INFO L136 LiptonReduction]: Total number of compositions: 108 [2022-12-13 17:06:29,913 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:06:29,918 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;@7ef5b97a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:06:29,918 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 17:06:29,922 INFO L130 PetriNetUnfolder]: 0/13 cut-off events. [2022-12-13 17:06:29,922 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 17:06:29,922 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:29,922 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:29,923 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 17:06:29,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:29,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1909764398, now seen corresponding path program 1 times [2022-12-13 17:06:29,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:29,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446727408] [2022-12-13 17:06:29,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:29,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:30,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:30,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:06:30,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:30,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446727408] [2022-12-13 17:06:30,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446727408] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:30,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:30,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 17:06:30,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49590768] [2022-12-13 17:06:30,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:30,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:06:30,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:30,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:06:30,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:06:30,288 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 228 [2022-12-13 17:06:30,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:30,291 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:30,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 228 [2022-12-13 17:06:30,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:30,524 INFO L130 PetriNetUnfolder]: 895/1418 cut-off events. [2022-12-13 17:06:30,524 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-13 17:06:30,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2801 conditions, 1418 events. 895/1418 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6675 event pairs, 159 based on Foata normal form. 0/1337 useless extension candidates. Maximal degree in co-relation 2790. Up to 1057 conditions per place. [2022-12-13 17:06:30,531 INFO L137 encePairwiseOnDemand]: 224/228 looper letters, 26 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2022-12-13 17:06:30,531 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 133 flow [2022-12-13 17:06:30,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:06:30,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:06:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2022-12-13 17:06:30,541 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5175438596491229 [2022-12-13 17:06:30,542 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2022-12-13 17:06:30,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2022-12-13 17:06:30,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:30,545 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2022-12-13 17:06:30,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:30,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:30,552 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:30,553 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 354 transitions. [2022-12-13 17:06:30,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 133 flow [2022-12-13 17:06:30,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 17:06:30,557 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2022-12-13 17:06:30,558 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-12-13 17:06:30,561 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-12-13 17:06:30,561 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2022-12-13 17:06:30,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:30,561 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:30,561 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:30,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:06:30,562 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 17:06:30,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:30,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1332617541, now seen corresponding path program 1 times [2022-12-13 17:06:30,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:30,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820155840] [2022-12-13 17:06:30,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:30,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:30,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:06:30,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:30,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820155840] [2022-12-13 17:06:30,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820155840] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:30,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:30,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 17:06:30,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933554444] [2022-12-13 17:06:30,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:30,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:06:30,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:30,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:06:30,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:06:30,698 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 228 [2022-12-13 17:06:30,699 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:30,699 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:30,699 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 228 [2022-12-13 17:06:30,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:30,880 INFO L130 PetriNetUnfolder]: 1071/1594 cut-off events. [2022-12-13 17:06:30,880 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-12-13 17:06:30,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3320 conditions, 1594 events. 1071/1594 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6341 event pairs, 435 based on Foata normal form. 8/1602 useless extension candidates. Maximal degree in co-relation 3310. Up to 1519 conditions per place. [2022-12-13 17:06:30,886 INFO L137 encePairwiseOnDemand]: 223/228 looper letters, 29 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2022-12-13 17:06:30,886 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 148 flow [2022-12-13 17:06:30,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:06:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:06:30,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-12-13 17:06:30,890 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48830409356725146 [2022-12-13 17:06:30,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2022-12-13 17:06:30,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2022-12-13 17:06:30,890 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:30,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2022-12-13 17:06:30,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:30,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:30,893 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:30,893 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 334 transitions. [2022-12-13 17:06:30,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 148 flow [2022-12-13 17:06:30,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:06:30,894 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 74 flow [2022-12-13 17:06:30,894 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, 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=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-12-13 17:06:30,894 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-12-13 17:06:30,895 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 74 flow [2022-12-13 17:06:30,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:30,895 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:30,895 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:30,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:06:30,895 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 17:06:30,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:30,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1667960625, now seen corresponding path program 1 times [2022-12-13 17:06:30,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:30,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134999099] [2022-12-13 17:06:30,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:30,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:31,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:06:31,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:31,021 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134999099] [2022-12-13 17:06:31,021 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134999099] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:31,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:31,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:06:31,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379315064] [2022-12-13 17:06:31,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:31,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:06:31,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:31,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:06:31,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:06:31,037 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 228 [2022-12-13 17:06:31,038 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:31,038 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:31,038 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 228 [2022-12-13 17:06:31,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:31,206 INFO L130 PetriNetUnfolder]: 993/1484 cut-off events. [2022-12-13 17:06:31,206 INFO L131 PetriNetUnfolder]: For 254/254 co-relation queries the response was YES. [2022-12-13 17:06:31,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3429 conditions, 1484 events. 993/1484 cut-off events. For 254/254 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5700 event pairs, 321 based on Foata normal form. 32/1516 useless extension candidates. Maximal degree in co-relation 3418. Up to 1037 conditions per place. [2022-12-13 17:06:31,211 INFO L137 encePairwiseOnDemand]: 225/228 looper letters, 30 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2022-12-13 17:06:31,211 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 162 flow [2022-12-13 17:06:31,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:06:31,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:06:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2022-12-13 17:06:31,214 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48391812865497075 [2022-12-13 17:06:31,214 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2022-12-13 17:06:31,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2022-12-13 17:06:31,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:31,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2022-12-13 17:06:31,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:31,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:31,217 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:31,217 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 74 flow. Second operand 3 states and 331 transitions. [2022-12-13 17:06:31,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 162 flow [2022-12-13 17:06:31,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 17:06:31,218 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 81 flow [2022-12-13 17:06:31,218 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2022-12-13 17:06:31,219 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2022-12-13 17:06:31,219 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 81 flow [2022-12-13 17:06:31,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:31,219 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:31,219 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:31,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:06:31,219 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 17:06:31,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:31,220 INFO L85 PathProgramCache]: Analyzing trace with hash 696892067, now seen corresponding path program 1 times [2022-12-13 17:06:31,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:31,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969363062] [2022-12-13 17:06:31,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:31,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:31,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:31,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:06:31,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:31,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969363062] [2022-12-13 17:06:31,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969363062] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:31,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:31,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:06:31,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047278062] [2022-12-13 17:06:31,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:31,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:06:31,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:31,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:06:31,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:06:31,368 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 228 [2022-12-13 17:06:31,368 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 81 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:31,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:31,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 228 [2022-12-13 17:06:31,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:31,543 INFO L130 PetriNetUnfolder]: 913/1372 cut-off events. [2022-12-13 17:06:31,544 INFO L131 PetriNetUnfolder]: For 468/468 co-relation queries the response was YES. [2022-12-13 17:06:31,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3273 conditions, 1372 events. 913/1372 cut-off events. For 468/468 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5300 event pairs, 543 based on Foata normal form. 32/1404 useless extension candidates. Maximal degree in co-relation 3260. Up to 933 conditions per place. [2022-12-13 17:06:31,549 INFO L137 encePairwiseOnDemand]: 225/228 looper letters, 35 selfloop transitions, 3 changer transitions 0/38 dead transitions. [2022-12-13 17:06:31,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 38 transitions, 196 flow [2022-12-13 17:06:31,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:06:31,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 17:06:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2022-12-13 17:06:31,551 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49122807017543857 [2022-12-13 17:06:31,551 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2022-12-13 17:06:31,551 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2022-12-13 17:06:31,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:31,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2022-12-13 17:06:31,552 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:31,553 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:31,554 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 228.0) internal successors, (912), 4 states have internal predecessors, (912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:31,554 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 81 flow. Second operand 3 states and 336 transitions. [2022-12-13 17:06:31,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 38 transitions, 196 flow [2022-12-13 17:06:31,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 38 transitions, 188 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:06:31,562 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 86 flow [2022-12-13 17:06:31,562 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-12-13 17:06:31,562 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2022-12-13 17:06:31,563 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 86 flow [2022-12-13 17:06:31,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:31,563 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:31,563 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:31,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:06:31,563 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 17:06:31,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:31,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1911051233, now seen corresponding path program 1 times [2022-12-13 17:06:31,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:31,564 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017584797] [2022-12-13 17:06:31,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:31,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:06:31,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:31,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017584797] [2022-12-13 17:06:31,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017584797] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:31,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:31,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:06:31,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542558426] [2022-12-13 17:06:31,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:31,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:06:31,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:31,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:06:31,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:06:31,726 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 228 [2022-12-13 17:06:31,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:31,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:31,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 228 [2022-12-13 17:06:31,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:31,910 INFO L130 PetriNetUnfolder]: 479/797 cut-off events. [2022-12-13 17:06:31,911 INFO L131 PetriNetUnfolder]: For 345/345 co-relation queries the response was YES. [2022-12-13 17:06:31,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2045 conditions, 797 events. 479/797 cut-off events. For 345/345 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 3469 event pairs, 88 based on Foata normal form. 80/876 useless extension candidates. Maximal degree in co-relation 2031. Up to 438 conditions per place. [2022-12-13 17:06:31,913 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 32 selfloop transitions, 4 changer transitions 24/62 dead transitions. [2022-12-13 17:06:31,913 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 62 transitions, 326 flow [2022-12-13 17:06:31,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 17:06:31,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 17:06:31,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-12-13 17:06:31,917 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5008771929824561 [2022-12-13 17:06:31,917 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 571 transitions. [2022-12-13 17:06:31,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 571 transitions. [2022-12-13 17:06:31,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:31,917 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 571 transitions. [2022-12-13 17:06:31,918 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:31,919 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:31,920 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 228.0) internal successors, (1368), 6 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:31,920 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 86 flow. Second operand 5 states and 571 transitions. [2022-12-13 17:06:31,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 62 transitions, 326 flow [2022-12-13 17:06:31,921 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 62 transitions, 312 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 17:06:31,922 INFO L231 Difference]: Finished difference. Result has 39 places, 27 transitions, 116 flow [2022-12-13 17:06:31,922 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=39, PETRI_TRANSITIONS=27} [2022-12-13 17:06:31,922 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2022-12-13 17:06:31,923 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 27 transitions, 116 flow [2022-12-13 17:06:31,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:31,923 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:31,923 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:31,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:06:31,923 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 17:06:31,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:31,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1989576139, now seen corresponding path program 1 times [2022-12-13 17:06:31,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:31,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138703463] [2022-12-13 17:06:31,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:31,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:32,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:06:32,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:32,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138703463] [2022-12-13 17:06:32,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138703463] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:32,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:32,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 17:06:32,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764739796] [2022-12-13 17:06:32,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:32,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 17:06:32,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:32,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 17:06:32,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 17:06:32,076 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 228 [2022-12-13 17:06:32,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 27 transitions, 116 flow. Second operand has 5 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 17:06:32,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:32,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 228 [2022-12-13 17:06:32,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:32,255 INFO L130 PetriNetUnfolder]: 250/455 cut-off events. [2022-12-13 17:06:32,255 INFO L131 PetriNetUnfolder]: For 244/244 co-relation queries the response was YES. [2022-12-13 17:06:32,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1420 conditions, 455 events. 250/455 cut-off events. For 244/244 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1776 event pairs, 57 based on Foata normal form. 44/498 useless extension candidates. Maximal degree in co-relation 1403. Up to 151 conditions per place. [2022-12-13 17:06:32,257 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 41 selfloop transitions, 7 changer transitions 21/71 dead transitions. [2022-12-13 17:06:32,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 71 transitions, 418 flow [2022-12-13 17:06:32,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 17:06:32,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 17:06:32,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2022-12-13 17:06:32,259 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5014619883040936 [2022-12-13 17:06:32,259 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 686 transitions. [2022-12-13 17:06:32,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 686 transitions. [2022-12-13 17:06:32,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:32,259 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 686 transitions. [2022-12-13 17:06:32,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:32,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:32,262 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 228.0) internal successors, (1596), 7 states have internal predecessors, (1596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:32,262 INFO L175 Difference]: Start difference. First operand has 39 places, 27 transitions, 116 flow. Second operand 6 states and 686 transitions. [2022-12-13 17:06:32,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 71 transitions, 418 flow [2022-12-13 17:06:32,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 71 transitions, 412 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 17:06:32,264 INFO L231 Difference]: Finished difference. Result has 43 places, 30 transitions, 166 flow [2022-12-13 17:06:32,265 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=166, PETRI_PLACES=43, PETRI_TRANSITIONS=30} [2022-12-13 17:06:32,265 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 10 predicate places. [2022-12-13 17:06:32,265 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 30 transitions, 166 flow [2022-12-13 17:06:32,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 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 17:06:32,266 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:32,266 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:32,266 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:06:32,266 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 17:06:32,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:32,266 INFO L85 PathProgramCache]: Analyzing trace with hash -798891109, now seen corresponding path program 1 times [2022-12-13 17:06:32,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:32,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750881309] [2022-12-13 17:06:32,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:32,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:32,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:32,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:06:32,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:32,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750881309] [2022-12-13 17:06:32,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750881309] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:32,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:32,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:06:32,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564934247] [2022-12-13 17:06:32,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:32,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 17:06:32,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:32,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 17:06:32,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 17:06:32,443 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 228 [2022-12-13 17:06:32,444 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 30 transitions, 166 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:32,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:32,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 228 [2022-12-13 17:06:32,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:32,574 INFO L130 PetriNetUnfolder]: 168/314 cut-off events. [2022-12-13 17:06:32,574 INFO L131 PetriNetUnfolder]: For 350/350 co-relation queries the response was YES. [2022-12-13 17:06:32,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 314 events. 168/314 cut-off events. For 350/350 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1100 event pairs, 54 based on Foata normal form. 11/324 useless extension candidates. Maximal degree in co-relation 1020. Up to 129 conditions per place. [2022-12-13 17:06:32,576 INFO L137 encePairwiseOnDemand]: 222/228 looper letters, 38 selfloop transitions, 10 changer transitions 11/61 dead transitions. [2022-12-13 17:06:32,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 61 transitions, 404 flow [2022-12-13 17:06:32,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 17:06:32,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 17:06:32,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 779 transitions. [2022-12-13 17:06:32,579 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4880952380952381 [2022-12-13 17:06:32,579 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 779 transitions. [2022-12-13 17:06:32,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 779 transitions. [2022-12-13 17:06:32,579 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:32,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 779 transitions. [2022-12-13 17:06:32,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:32,582 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:32,582 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 228.0) internal successors, (1824), 8 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:32,582 INFO L175 Difference]: Start difference. First operand has 43 places, 30 transitions, 166 flow. Second operand 7 states and 779 transitions. [2022-12-13 17:06:32,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 61 transitions, 404 flow [2022-12-13 17:06:32,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 61 transitions, 350 flow, removed 17 selfloop flow, removed 6 redundant places. [2022-12-13 17:06:32,585 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 156 flow [2022-12-13 17:06:32,585 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2022-12-13 17:06:32,586 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 11 predicate places. [2022-12-13 17:06:32,586 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 156 flow [2022-12-13 17:06:32,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:32,586 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:32,586 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:32,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 17:06:32,587 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 17:06:32,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:32,587 INFO L85 PathProgramCache]: Analyzing trace with hash 187476912, now seen corresponding path program 1 times [2022-12-13 17:06:32,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:32,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907408809] [2022-12-13 17:06:32,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:32,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:32,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:06:33,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:33,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907408809] [2022-12-13 17:06:33,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907408809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:33,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:33,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 17:06:33,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900611660] [2022-12-13 17:06:33,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:33,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 17:06:33,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:33,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 17:06:33,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-12-13 17:06:33,107 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 228 [2022-12-13 17:06:33,108 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 156 flow. Second operand has 8 states, 8 states have (on average 98.625) internal successors, (789), 8 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:33,108 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:33,108 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 228 [2022-12-13 17:06:33,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:33,375 INFO L130 PetriNetUnfolder]: 317/557 cut-off events. [2022-12-13 17:06:33,376 INFO L131 PetriNetUnfolder]: For 668/668 co-relation queries the response was YES. [2022-12-13 17:06:33,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1725 conditions, 557 events. 317/557 cut-off events. For 668/668 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2158 event pairs, 11 based on Foata normal form. 1/558 useless extension candidates. Maximal degree in co-relation 1706. Up to 204 conditions per place. [2022-12-13 17:06:33,377 INFO L137 encePairwiseOnDemand]: 220/228 looper letters, 36 selfloop transitions, 7 changer transitions 59/102 dead transitions. [2022-12-13 17:06:33,377 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 102 transitions, 692 flow [2022-12-13 17:06:33,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-13 17:06:33,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2022-12-13 17:06:33,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1237 transitions. [2022-12-13 17:06:33,379 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4521198830409357 [2022-12-13 17:06:33,380 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1237 transitions. [2022-12-13 17:06:33,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1237 transitions. [2022-12-13 17:06:33,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:33,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1237 transitions. [2022-12-13 17:06:33,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 103.08333333333333) internal successors, (1237), 12 states have internal predecessors, (1237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:33,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 228.0) internal successors, (2964), 13 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:33,385 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 228.0) internal successors, (2964), 13 states have internal predecessors, (2964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:33,385 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 156 flow. Second operand 12 states and 1237 transitions. [2022-12-13 17:06:33,385 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 102 transitions, 692 flow [2022-12-13 17:06:33,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 102 transitions, 598 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-13 17:06:33,387 INFO L231 Difference]: Finished difference. Result has 50 places, 31 transitions, 141 flow [2022-12-13 17:06:33,388 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=141, PETRI_PLACES=50, PETRI_TRANSITIONS=31} [2022-12-13 17:06:33,388 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2022-12-13 17:06:33,388 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 31 transitions, 141 flow [2022-12-13 17:06:33,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.625) internal successors, (789), 8 states have internal predecessors, (789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:33,388 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:33,389 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:33,389 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 17:06:33,389 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 17:06:33,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:33,389 INFO L85 PathProgramCache]: Analyzing trace with hash 2097946174, now seen corresponding path program 2 times [2022-12-13 17:06:33,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:33,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429142837] [2022-12-13 17:06:33,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:33,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:33,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:33,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:06:33,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:33,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429142837] [2022-12-13 17:06:33,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429142837] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:33,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:33,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:06:33,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749774700] [2022-12-13 17:06:33,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:33,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 17:06:33,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:33,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 17:06:33,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 17:06:33,510 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 228 [2022-12-13 17:06:33,511 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 31 transitions, 141 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:33,511 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:33,511 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 228 [2022-12-13 17:06:33,511 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:33,618 INFO L130 PetriNetUnfolder]: 126/261 cut-off events. [2022-12-13 17:06:33,618 INFO L131 PetriNetUnfolder]: For 263/263 co-relation queries the response was YES. [2022-12-13 17:06:33,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 829 conditions, 261 events. 126/261 cut-off events. For 263/263 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 974 event pairs, 31 based on Foata normal form. 1/262 useless extension candidates. Maximal degree in co-relation 816. Up to 160 conditions per place. [2022-12-13 17:06:33,619 INFO L137 encePairwiseOnDemand]: 225/228 looper letters, 30 selfloop transitions, 1 changer transitions 25/57 dead transitions. [2022-12-13 17:06:33,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 57 transitions, 376 flow [2022-12-13 17:06:33,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 17:06:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 17:06:33,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2022-12-13 17:06:33,620 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49890350877192985 [2022-12-13 17:06:33,620 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 455 transitions. [2022-12-13 17:06:33,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 455 transitions. [2022-12-13 17:06:33,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:33,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 455 transitions. [2022-12-13 17:06:33,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:33,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:33,623 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 228.0) internal successors, (1140), 5 states have internal predecessors, (1140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:33,623 INFO L175 Difference]: Start difference. First operand has 50 places, 31 transitions, 141 flow. Second operand 4 states and 455 transitions. [2022-12-13 17:06:33,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 57 transitions, 376 flow [2022-12-13 17:06:33,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 57 transitions, 365 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 17:06:33,624 INFO L231 Difference]: Finished difference. Result has 46 places, 27 transitions, 122 flow [2022-12-13 17:06:33,624 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=133, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=122, PETRI_PLACES=46, PETRI_TRANSITIONS=27} [2022-12-13 17:06:33,625 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 13 predicate places. [2022-12-13 17:06:33,625 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 27 transitions, 122 flow [2022-12-13 17:06:33,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:33,625 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:33,625 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:33,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 17:06:33,626 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 17:06:33,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:33,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1617690226, now seen corresponding path program 3 times [2022-12-13 17:06:33,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:33,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590267643] [2022-12-13 17:06:33,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:33,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:06:34,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:06:34,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:06:34,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590267643] [2022-12-13 17:06:34,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590267643] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:06:34,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:06:34,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 17:06:34,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451313583] [2022-12-13 17:06:34,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:06:34,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 17:06:34,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:06:34,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 17:06:34,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-12-13 17:06:34,407 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 228 [2022-12-13 17:06:34,409 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 27 transitions, 122 flow. Second operand has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:34,409 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 17:06:34,409 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 228 [2022-12-13 17:06:34,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 17:06:34,776 INFO L130 PetriNetUnfolder]: 88/200 cut-off events. [2022-12-13 17:06:34,776 INFO L131 PetriNetUnfolder]: For 268/268 co-relation queries the response was YES. [2022-12-13 17:06:34,777 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 200 events. 88/200 cut-off events. For 268/268 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 707 event pairs, 9 based on Foata normal form. 1/198 useless extension candidates. Maximal degree in co-relation 652. Up to 76 conditions per place. [2022-12-13 17:06:34,777 INFO L137 encePairwiseOnDemand]: 221/228 looper letters, 22 selfloop transitions, 4 changer transitions 26/54 dead transitions. [2022-12-13 17:06:34,777 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 54 transitions, 362 flow [2022-12-13 17:06:34,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 17:06:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 17:06:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 839 transitions. [2022-12-13 17:06:34,780 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45997807017543857 [2022-12-13 17:06:34,780 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 839 transitions. [2022-12-13 17:06:34,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 839 transitions. [2022-12-13 17:06:34,781 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 17:06:34,781 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 839 transitions. [2022-12-13 17:06:34,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 104.875) internal successors, (839), 8 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:34,786 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 228.0) internal successors, (2052), 9 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:34,786 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 228.0) internal successors, (2052), 9 states have internal predecessors, (2052), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:34,786 INFO L175 Difference]: Start difference. First operand has 46 places, 27 transitions, 122 flow. Second operand 8 states and 839 transitions. [2022-12-13 17:06:34,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 54 transitions, 362 flow [2022-12-13 17:06:34,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 352 flow, removed 1 selfloop flow, removed 4 redundant places. [2022-12-13 17:06:34,789 INFO L231 Difference]: Finished difference. Result has 50 places, 27 transitions, 131 flow [2022-12-13 17:06:34,789 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=228, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=131, PETRI_PLACES=50, PETRI_TRANSITIONS=27} [2022-12-13 17:06:34,790 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 17 predicate places. [2022-12-13 17:06:34,790 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 131 flow [2022-12-13 17:06:34,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 17:06:34,790 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 17:06:34,791 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:34,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 17:06:34,791 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 17:06:34,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:06:34,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2028811874, now seen corresponding path program 4 times [2022-12-13 17:06:34,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:06:34,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139060944] [2022-12-13 17:06:34,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:06:34,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:06:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:06:34,831 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 17:06:34,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 17:06:34,895 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 17:06:34,895 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 17:06:34,896 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 17:06:34,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 17:06:34,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 17:06:34,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 17:06:34,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 17:06:34,898 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 17:06:34,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 17:06:34,899 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:06:34,903 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 17:06:34,903 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:06:34,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:06:34 BasicIcfg [2022-12-13 17:06:34,942 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:06:34,943 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:06:34,943 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:06:34,943 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:06:34,943 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:06:27" (3/4) ... [2022-12-13 17:06:34,944 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 17:06:34,999 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b42fec22-72a8-4145-8bda-77aa3127207b/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 17:06:34,999 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:06:35,000 INFO L158 Benchmark]: Toolchain (without parser) took 8898.86ms. Allocated memory was 123.7MB in the beginning and 195.0MB in the end (delta: 71.3MB). Free memory was 83.5MB in the beginning and 60.4MB in the end (delta: 23.1MB). Peak memory consumption was 95.7MB. Max. memory is 16.1GB. [2022-12-13 17:06:35,000 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 123.7MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:06:35,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 434.86ms. Allocated memory is still 123.7MB. Free memory was 83.1MB in the beginning and 55.6MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 17:06:35,001 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.53ms. Allocated memory is still 123.7MB. Free memory was 55.6MB in the beginning and 53.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 17:06:35,001 INFO L158 Benchmark]: Boogie Preprocessor took 21.00ms. Allocated memory is still 123.7MB. Free memory was 53.0MB in the beginning and 50.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:06:35,001 INFO L158 Benchmark]: RCFGBuilder took 546.10ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 50.9MB in the beginning and 109.6MB in the end (delta: -58.8MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2022-12-13 17:06:35,002 INFO L158 Benchmark]: TraceAbstraction took 7790.84ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 109.6MB in the beginning and 70.9MB in the end (delta: 38.8MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2022-12-13 17:06:35,002 INFO L158 Benchmark]: Witness Printer took 56.85ms. Allocated memory is still 195.0MB. Free memory was 70.9MB in the beginning and 60.4MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 17:06:35,004 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 123.7MB. Free memory is still 91.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 434.86ms. Allocated memory is still 123.7MB. Free memory was 83.1MB in the beginning and 55.6MB in the end (delta: 27.5MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.53ms. Allocated memory is still 123.7MB. Free memory was 55.6MB in the beginning and 53.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.00ms. Allocated memory is still 123.7MB. Free memory was 53.0MB in the beginning and 50.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 546.10ms. Allocated memory was 123.7MB in the beginning and 161.5MB in the end (delta: 37.7MB). Free memory was 50.9MB in the beginning and 109.6MB in the end (delta: -58.8MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7790.84ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 109.6MB in the beginning and 70.9MB in the end (delta: 38.8MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * Witness Printer took 56.85ms. Allocated memory is still 195.0MB. Free memory was 70.9MB in the beginning and 60.4MB in the end (delta: 10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 2.6s, 125 PlacesBefore, 33 PlacesAfterwards, 117 TransitionsBefore, 24 TransitionsAfterwards, 2174 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 108 TotalNumberOfCompositions, 5403 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2784, independent: 2600, independent conditional: 0, independent unconditional: 2600, dependent: 184, dependent conditional: 0, dependent unconditional: 184, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1197, independent: 1162, independent conditional: 0, independent unconditional: 1162, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2784, independent: 1438, independent conditional: 0, independent unconditional: 1438, dependent: 149, dependent conditional: 0, dependent unconditional: 149, unknown: 1197, unknown conditional: 0, unknown unconditional: 1197] , Statistics on independence cache: Total cache size (in pairs): 98, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 14, Negative conditional cache size: 0, Negative unconditional cache size: 14, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t388; [L854] FCALL, FORK 0 pthread_create(&t388, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t388, ((void *)0), P0, ((void *)0))=-1, t388={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t389; [L856] FCALL, FORK 0 pthread_create(&t389, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t389, ((void *)0), P1, ((void *)0))=0, t388={5:0}, t389={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t390; [L858] FCALL, FORK 0 pthread_create(&t390, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t390, ((void *)0), P2, ((void *)0))=1, t388={5:0}, t389={6:0}, t390={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 x = 1 [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EAX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t388={5:0}, t389={6:0}, t390={3:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: 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: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 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.7s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 2.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 505 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 413 mSDsluCounter, 182 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 153 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 990 IncrementalHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 29 mSDtfsCounter, 990 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=6, InterpolantAutomatonStates: 54, 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, 2.2s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 1148 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 17:06:35,017 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b42fec22-72a8-4145-8bda-77aa3127207b/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