./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R --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 ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 --- 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-38b53e6 [2022-11-25 15:39:27,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:39:27,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:39:27,688 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:39:27,688 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:39:27,689 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:39:27,691 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:39:27,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:39:27,694 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:39:27,696 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:39:27,697 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:39:27,698 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:39:27,699 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:39:27,700 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:39:27,701 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:39:27,703 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:39:27,704 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:39:27,705 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:39:27,707 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:39:27,709 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:39:27,710 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:39:27,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:39:27,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:39:27,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:39:27,718 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:39:27,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:39:27,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:39:27,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:39:27,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:39:27,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:39:27,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:39:27,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:39:27,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:39:27,725 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:39:27,726 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:39:27,726 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:39:27,727 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:39:27,727 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:39:27,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:39:27,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:39:27,729 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:39:27,734 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:39:27,776 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:39:27,777 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:39:27,778 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:39:27,778 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:39:27,779 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:39:27,779 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:39:27,780 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:39:27,780 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:39:27,781 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:39:27,781 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:39:27,782 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:39:27,782 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:39:27,782 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:39:27,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:39:27,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:39:27,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:39:27,783 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:39:27,784 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:39:27,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:39:27,784 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:39:27,784 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:39:27,784 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:39:27,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:39:27,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:39:27,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:39:27,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:39:27,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:39:27,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:39:27,787 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:39:27,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:39:27,787 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:39:27,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:39:27,788 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:39:27,788 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:39:27,788 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_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R/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_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R 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 -> ad7a565ad4ebe037ce541fa36cdf85746d072cc2b5132ab8ae2e3025ff70fea5 [2022-11-25 15:39:28,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:39:28,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:39:28,067 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:39:28,068 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:39:28,069 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:39:28,070 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2022-11-25 15:39:31,214 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:39:31,523 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:39:31,524 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcbf6c81-fcfd-48e7-991f-5432edc95c43/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i [2022-11-25 15:39:31,538 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R/data/7ddcb6eb6/719715fe43134e9e8d7d0e37db2b4df1/FLAGaa4e4d36c [2022-11-25 15:39:31,553 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R/data/7ddcb6eb6/719715fe43134e9e8d7d0e37db2b4df1 [2022-11-25 15:39:31,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:39:31,561 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:39:31,565 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:39:31,565 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:39:31,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:39:31,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:39:31" (1/1) ... [2022-11-25 15:39:31,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47ef9cbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:31, skipping insertion in model container [2022-11-25 15:39:31,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:39:31" (1/1) ... [2022-11-25 15:39:31,579 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:39:31,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:39:31,793 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_bcbf6c81-fcfd-48e7-991f-5432edc95c43/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-25 15:39:32,036 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,037 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,038 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,039 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,048 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,049 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,050 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,051 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,054 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,055 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,063 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,064 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,069 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,070 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,071 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,072 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,080 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,081 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,094 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,120 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:39:32,141 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:39:32,158 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_bcbf6c81-fcfd-48e7-991f-5432edc95c43/sv-benchmarks/c/pthread-wmm/safe004_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-25 15:39:32,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,199 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,201 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,202 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,203 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,206 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,214 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:39:32,223 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:39:32,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:39:32,257 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:39:32,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:32 WrapperNode [2022-11-25 15:39:32,258 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:39:32,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:39:32,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:39:32,259 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:39:32,267 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:32" (1/1) ... [2022-11-25 15:39:32,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:32" (1/1) ... [2022-11-25 15:39:32,308 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-25 15:39:32,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:39:32,310 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:39:32,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:39:32,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:39:32,321 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:32" (1/1) ... [2022-11-25 15:39:32,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:32" (1/1) ... [2022-11-25 15:39:32,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:32" (1/1) ... [2022-11-25 15:39:32,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:32" (1/1) ... [2022-11-25 15:39:32,354 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:32" (1/1) ... [2022-11-25 15:39:32,363 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:32" (1/1) ... [2022-11-25 15:39:32,365 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:32" (1/1) ... [2022-11-25 15:39:32,380 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:32" (1/1) ... [2022-11-25 15:39:32,383 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:39:32,384 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:39:32,385 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:39:32,385 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:39:32,385 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:32" (1/1) ... [2022-11-25 15:39:32,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:39:32,404 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:39:32,416 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:39:32,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:39:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:39:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:39:32,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:39:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:39:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:39:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 15:39:32,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 15:39:32,459 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 15:39:32,459 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 15:39:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 15:39:32,460 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 15:39:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:39:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:39:32,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:39:32,461 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:39:32,462 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:39:32,643 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:39:32,646 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:39:33,025 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:39:33,288 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:39:33,288 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:39:33,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:39:33 BoogieIcfgContainer [2022-11-25 15:39:33,291 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:39:33,293 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:39:33,294 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:39:33,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:39:33,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:39:31" (1/3) ... [2022-11-25 15:39:33,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5fa89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:39:33, skipping insertion in model container [2022-11-25 15:39:33,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:39:32" (2/3) ... [2022-11-25 15:39:33,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d5fa89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:39:33, skipping insertion in model container [2022-11-25 15:39:33,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:39:33" (3/3) ... [2022-11-25 15:39:33,301 INFO L112 eAbstractionObserver]: Analyzing ICFG safe004_power.opt_pso.opt_rmo.opt.i [2022-11-25 15:39:33,311 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 15:39:33,322 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:39:33,322 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 15:39:33,322 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:39:33,390 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:39:33,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 243 flow [2022-11-25 15:39:33,546 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-11-25 15:39:33,548 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:39:33,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-25 15:39:33,553 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 114 transitions, 243 flow [2022-11-25 15:39:33,558 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 119 places, 111 transitions, 231 flow [2022-11-25 15:39:33,565 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:39:33,582 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 119 places, 111 transitions, 231 flow [2022-11-25 15:39:33,585 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 119 places, 111 transitions, 231 flow [2022-11-25 15:39:33,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 119 places, 111 transitions, 231 flow [2022-11-25 15:39:33,650 INFO L130 PetriNetUnfolder]: 2/111 cut-off events. [2022-11-25 15:39:33,650 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:39:33,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 111 events. 2/111 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 54 event pairs, 0 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-25 15:39:33,653 INFO L119 LiptonReduction]: Number of co-enabled transitions 2082 [2022-11-25 15:39:38,480 INFO L134 LiptonReduction]: Checked pairs total: 5147 [2022-11-25 15:39:38,481 INFO L136 LiptonReduction]: Total number of compositions: 100 [2022-11-25 15:39:38,498 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:39:38,505 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;@22c11fe4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:39:38,505 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 15:39:38,510 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-11-25 15:39:38,511 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:39:38,511 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:38,512 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 15:39:38,512 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:39:38,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:38,518 INFO L85 PathProgramCache]: Analyzing trace with hash 469353566, now seen corresponding path program 1 times [2022-11-25 15:39:38,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:38,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994983074] [2022-11-25 15:39:38,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:38,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:38,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:38,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:38,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:38,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994983074] [2022-11-25 15:39:38,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994983074] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:38,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:38,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:39:38,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354610402] [2022-11-25 15:39:38,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:38,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:39:38,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:39,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:39:39,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:39:39,029 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 214 [2022-11-25 15:39:39,033 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 25 transitions, 59 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:39,033 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:39,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 214 [2022-11-25 15:39:39,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:39,370 INFO L130 PetriNetUnfolder]: 855/1390 cut-off events. [2022-11-25 15:39:39,370 INFO L131 PetriNetUnfolder]: For 16/16 co-relation queries the response was YES. [2022-11-25 15:39:39,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2717 conditions, 1390 events. 855/1390 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 7194 event pairs, 141 based on Foata normal form. 0/1321 useless extension candidates. Maximal degree in co-relation 2706. Up to 1027 conditions per place. [2022-11-25 15:39:39,382 INFO L137 encePairwiseOnDemand]: 210/214 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2022-11-25 15:39:39,382 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 36 transitions, 150 flow [2022-11-25 15:39:39,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:39:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:39:39,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 336 transitions. [2022-11-25 15:39:39,399 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5233644859813084 [2022-11-25 15:39:39,400 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 336 transitions. [2022-11-25 15:39:39,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 336 transitions. [2022-11-25 15:39:39,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:39,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 336 transitions. [2022-11-25 15:39:39,408 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-11-25 15:39:39,415 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:39,416 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:39,417 INFO L175 Difference]: Start difference. First operand has 34 places, 25 transitions, 59 flow. Second operand 3 states and 336 transitions. [2022-11-25 15:39:39,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 36 transitions, 150 flow [2022-11-25 15:39:39,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 15:39:39,422 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2022-11-25 15:39:39,424 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-11-25 15:39:39,428 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-11-25 15:39:39,428 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2022-11-25 15:39:39,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:39,429 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:39,429 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:39,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:39:39,430 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:39:39,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:39,430 INFO L85 PathProgramCache]: Analyzing trace with hash -19896165, now seen corresponding path program 1 times [2022-11-25 15:39:39,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:39,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792251120] [2022-11-25 15:39:39,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:39,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:40,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:40,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:40,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792251120] [2022-11-25 15:39:40,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792251120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:40,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:40,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:39:40,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024818353] [2022-11-25 15:39:40,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:40,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:39:40,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:40,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:39:40,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:39:40,419 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 214 [2022-11-25 15:39:40,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 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-11-25 15:39:40,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:40,420 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 214 [2022-11-25 15:39:40,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:41,202 INFO L130 PetriNetUnfolder]: 1824/2783 cut-off events. [2022-11-25 15:39:41,203 INFO L131 PetriNetUnfolder]: For 153/153 co-relation queries the response was YES. [2022-11-25 15:39:41,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5729 conditions, 2783 events. 1824/2783 cut-off events. For 153/153 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14071 event pairs, 302 based on Foata normal form. 145/2928 useless extension candidates. Maximal degree in co-relation 5719. Up to 1623 conditions per place. [2022-11-25 15:39:41,219 INFO L137 encePairwiseOnDemand]: 202/214 looper letters, 38 selfloop transitions, 12 changer transitions 31/82 dead transitions. [2022-11-25 15:39:41,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 82 transitions, 352 flow [2022-11-25 15:39:41,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:39:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:39:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 707 transitions. [2022-11-25 15:39:41,224 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4719626168224299 [2022-11-25 15:39:41,224 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 707 transitions. [2022-11-25 15:39:41,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 707 transitions. [2022-11-25 15:39:41,225 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:41,225 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 707 transitions. [2022-11-25 15:39:41,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.0) internal successors, (707), 7 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:41,231 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:41,232 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 214.0) internal successors, (1712), 8 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:41,232 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 7 states and 707 transitions. [2022-11-25 15:39:41,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 82 transitions, 352 flow [2022-11-25 15:39:41,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 82 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:39:41,234 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 160 flow [2022-11-25 15:39:41,235 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-11-25 15:39:41,235 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 7 predicate places. [2022-11-25 15:39:41,236 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 160 flow [2022-11-25 15:39:41,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.0) internal successors, (455), 5 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-11-25 15:39:41,236 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:41,236 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:41,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:39:41,237 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:39:41,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:41,238 INFO L85 PathProgramCache]: Analyzing trace with hash -616783800, now seen corresponding path program 1 times [2022-11-25 15:39:41,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:41,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596011621] [2022-11-25 15:39:41,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:41,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:41,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:41,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:41,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596011621] [2022-11-25 15:39:41,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596011621] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:41,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:41,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:39:41,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091409228] [2022-11-25 15:39:41,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:41,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:39:41,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:41,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:39:41,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:39:41,516 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 214 [2022-11-25 15:39:41,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:41,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:41,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 214 [2022-11-25 15:39:41,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:42,055 INFO L130 PetriNetUnfolder]: 1373/2095 cut-off events. [2022-11-25 15:39:42,055 INFO L131 PetriNetUnfolder]: For 2548/2588 co-relation queries the response was YES. [2022-11-25 15:39:42,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6951 conditions, 2095 events. 1373/2095 cut-off events. For 2548/2588 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10032 event pairs, 258 based on Foata normal form. 161/2249 useless extension candidates. Maximal degree in co-relation 6935. Up to 1147 conditions per place. [2022-11-25 15:39:42,074 INFO L137 encePairwiseOnDemand]: 210/214 looper letters, 40 selfloop transitions, 3 changer transitions 28/75 dead transitions. [2022-11-25 15:39:42,075 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 75 transitions, 514 flow [2022-11-25 15:39:42,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:39:42,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:39:42,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 537 transitions. [2022-11-25 15:39:42,078 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5018691588785047 [2022-11-25 15:39:42,078 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 537 transitions. [2022-11-25 15:39:42,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 537 transitions. [2022-11-25 15:39:42,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:42,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 537 transitions. [2022-11-25 15:39:42,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 107.4) internal successors, (537), 5 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:42,084 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:42,085 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:42,085 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 160 flow. Second operand 5 states and 537 transitions. [2022-11-25 15:39:42,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 75 transitions, 514 flow [2022-11-25 15:39:42,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 75 transitions, 504 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-11-25 15:39:42,094 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 169 flow [2022-11-25 15:39:42,095 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-11-25 15:39:42,095 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 10 predicate places. [2022-11-25 15:39:42,096 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 169 flow [2022-11-25 15:39:42,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:42,097 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:42,097 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:42,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:39:42,097 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:39:42,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:42,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1262365876, now seen corresponding path program 1 times [2022-11-25 15:39:42,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:42,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921742847] [2022-11-25 15:39:42,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:42,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:42,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:42,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921742847] [2022-11-25 15:39:42,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921742847] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:42,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:42,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:39:42,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065390453] [2022-11-25 15:39:42,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:42,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:39:42,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:42,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:39:42,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:39:42,737 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 214 [2022-11-25 15:39:42,738 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:42,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:42,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 214 [2022-11-25 15:39:42,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:43,461 INFO L130 PetriNetUnfolder]: 1940/2962 cut-off events. [2022-11-25 15:39:43,461 INFO L131 PetriNetUnfolder]: For 3219/3219 co-relation queries the response was YES. [2022-11-25 15:39:43,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10074 conditions, 2962 events. 1940/2962 cut-off events. For 3219/3219 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 15131 event pairs, 195 based on Foata normal form. 63/3025 useless extension candidates. Maximal degree in co-relation 10054. Up to 1363 conditions per place. [2022-11-25 15:39:43,479 INFO L137 encePairwiseOnDemand]: 202/214 looper letters, 44 selfloop transitions, 13 changer transitions 24/82 dead transitions. [2022-11-25 15:39:43,479 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 82 transitions, 560 flow [2022-11-25 15:39:43,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:39:43,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:39:43,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 604 transitions. [2022-11-25 15:39:43,481 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.470404984423676 [2022-11-25 15:39:43,482 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 604 transitions. [2022-11-25 15:39:43,482 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 604 transitions. [2022-11-25 15:39:43,482 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:43,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 604 transitions. [2022-11-25 15:39:43,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 100.66666666666667) internal successors, (604), 6 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:43,487 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:43,488 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:43,488 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 169 flow. Second operand 6 states and 604 transitions. [2022-11-25 15:39:43,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 82 transitions, 560 flow [2022-11-25 15:39:43,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 82 transitions, 536 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-11-25 15:39:43,502 INFO L231 Difference]: Finished difference. Result has 46 places, 38 transitions, 250 flow [2022-11-25 15:39:43,503 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=157, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=46, PETRI_TRANSITIONS=38} [2022-11-25 15:39:43,503 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2022-11-25 15:39:43,504 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 38 transitions, 250 flow [2022-11-25 15:39:43,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:43,504 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:43,504 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:43,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:39:43,505 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:39:43,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:43,506 INFO L85 PathProgramCache]: Analyzing trace with hash -2126046028, now seen corresponding path program 2 times [2022-11-25 15:39:43,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:43,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870665298] [2022-11-25 15:39:43,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:43,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:43,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:44,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:44,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:44,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870665298] [2022-11-25 15:39:44,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870665298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:44,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:44,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:39:44,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188385517] [2022-11-25 15:39:44,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:44,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:39:44,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:44,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:39:44,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:39:44,211 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 214 [2022-11-25 15:39:44,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 38 transitions, 250 flow. Second operand has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:44,213 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:44,213 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 214 [2022-11-25 15:39:44,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:45,241 INFO L130 PetriNetUnfolder]: 1938/3021 cut-off events. [2022-11-25 15:39:45,241 INFO L131 PetriNetUnfolder]: For 4576/4576 co-relation queries the response was YES. [2022-11-25 15:39:45,249 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10985 conditions, 3021 events. 1938/3021 cut-off events. For 4576/4576 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 16040 event pairs, 198 based on Foata normal form. 81/3102 useless extension candidates. Maximal degree in co-relation 10964. Up to 1382 conditions per place. [2022-11-25 15:39:45,259 INFO L137 encePairwiseOnDemand]: 202/214 looper letters, 40 selfloop transitions, 24 changer transitions 52/117 dead transitions. [2022-11-25 15:39:45,260 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 117 transitions, 923 flow [2022-11-25 15:39:45,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 15:39:45,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 15:39:45,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 898 transitions. [2022-11-25 15:39:45,263 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46625129802699894 [2022-11-25 15:39:45,264 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 898 transitions. [2022-11-25 15:39:45,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 898 transitions. [2022-11-25 15:39:45,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:45,265 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 898 transitions. [2022-11-25 15:39:45,267 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 99.77777777777777) internal successors, (898), 9 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:45,270 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 214.0) internal successors, (2140), 10 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:45,271 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 214.0) internal successors, (2140), 10 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:45,271 INFO L175 Difference]: Start difference. First operand has 46 places, 38 transitions, 250 flow. Second operand 9 states and 898 transitions. [2022-11-25 15:39:45,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 117 transitions, 923 flow [2022-11-25 15:39:45,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 117 transitions, 889 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-11-25 15:39:45,288 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 356 flow [2022-11-25 15:39:45,288 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=356, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2022-11-25 15:39:45,289 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2022-11-25 15:39:45,289 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 356 flow [2022-11-25 15:39:45,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.16666666666667) internal successors, (547), 6 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:45,290 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:45,290 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:45,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:39:45,291 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:39:45,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:45,291 INFO L85 PathProgramCache]: Analyzing trace with hash -752065578, now seen corresponding path program 1 times [2022-11-25 15:39:45,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:45,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484197038] [2022-11-25 15:39:45,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:45,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:45,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:45,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484197038] [2022-11-25 15:39:45,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484197038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:45,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:45,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:39:45,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188147169] [2022-11-25 15:39:45,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:45,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:39:45,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:45,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:39:45,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:39:45,529 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 214 [2022-11-25 15:39:45,530 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:45,530 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:45,531 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 214 [2022-11-25 15:39:45,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:45,983 INFO L130 PetriNetUnfolder]: 1043/1719 cut-off events. [2022-11-25 15:39:45,983 INFO L131 PetriNetUnfolder]: For 4139/4139 co-relation queries the response was YES. [2022-11-25 15:39:45,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6718 conditions, 1719 events. 1043/1719 cut-off events. For 4139/4139 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8814 event pairs, 249 based on Foata normal form. 63/1781 useless extension candidates. Maximal degree in co-relation 6693. Up to 790 conditions per place. [2022-11-25 15:39:45,993 INFO L137 encePairwiseOnDemand]: 210/214 looper letters, 34 selfloop transitions, 3 changer transitions 27/67 dead transitions. [2022-11-25 15:39:45,994 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 67 transitions, 586 flow [2022-11-25 15:39:45,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:39:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:39:45,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 533 transitions. [2022-11-25 15:39:45,996 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4981308411214953 [2022-11-25 15:39:45,996 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 533 transitions. [2022-11-25 15:39:45,997 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 533 transitions. [2022-11-25 15:39:45,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:45,997 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 533 transitions. [2022-11-25 15:39:45,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.6) internal successors, (533), 5 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:46,000 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:46,001 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:46,002 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 356 flow. Second operand 5 states and 533 transitions. [2022-11-25 15:39:46,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 67 transitions, 586 flow [2022-11-25 15:39:46,014 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 67 transitions, 570 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-11-25 15:39:46,016 INFO L231 Difference]: Finished difference. Result has 54 places, 32 transitions, 237 flow [2022-11-25 15:39:46,016 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=54, PETRI_TRANSITIONS=32} [2022-11-25 15:39:46,019 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 20 predicate places. [2022-11-25 15:39:46,019 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 32 transitions, 237 flow [2022-11-25 15:39:46,020 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.25) internal successors, (401), 4 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:46,020 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:46,020 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:46,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:39:46,020 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:39:46,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:46,021 INFO L85 PathProgramCache]: Analyzing trace with hash -901207497, now seen corresponding path program 1 times [2022-11-25 15:39:46,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:46,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554081747] [2022-11-25 15:39:46,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:46,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:46,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:47,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:47,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:47,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554081747] [2022-11-25 15:39:47,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554081747] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:47,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:47,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:39:47,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113195833] [2022-11-25 15:39:47,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:47,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:39:47,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:47,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:39:47,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:39:47,114 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 214 [2022-11-25 15:39:47,115 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 32 transitions, 237 flow. Second operand has 7 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:47,116 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:47,116 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 214 [2022-11-25 15:39:47,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:47,459 INFO L130 PetriNetUnfolder]: 583/954 cut-off events. [2022-11-25 15:39:47,459 INFO L131 PetriNetUnfolder]: For 1676/1676 co-relation queries the response was YES. [2022-11-25 15:39:47,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3365 conditions, 954 events. 583/954 cut-off events. For 1676/1676 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3889 event pairs, 237 based on Foata normal form. 36/990 useless extension candidates. Maximal degree in co-relation 3340. Up to 810 conditions per place. [2022-11-25 15:39:47,473 INFO L137 encePairwiseOnDemand]: 207/214 looper letters, 36 selfloop transitions, 9 changer transitions 12/60 dead transitions. [2022-11-25 15:39:47,473 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 60 transitions, 510 flow [2022-11-25 15:39:47,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:39:47,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:39:47,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 618 transitions. [2022-11-25 15:39:47,476 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48130841121495327 [2022-11-25 15:39:47,476 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 618 transitions. [2022-11-25 15:39:47,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 618 transitions. [2022-11-25 15:39:47,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:47,477 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 618 transitions. [2022-11-25 15:39:47,478 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 103.0) internal successors, (618), 6 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:47,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:47,481 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 214.0) internal successors, (1498), 7 states have internal predecessors, (1498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:47,482 INFO L175 Difference]: Start difference. First operand has 54 places, 32 transitions, 237 flow. Second operand 6 states and 618 transitions. [2022-11-25 15:39:47,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 60 transitions, 510 flow [2022-11-25 15:39:47,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 60 transitions, 481 flow, removed 4 selfloop flow, removed 7 redundant places. [2022-11-25 15:39:47,489 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 291 flow [2022-11-25 15:39:47,489 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=291, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2022-11-25 15:39:47,491 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 18 predicate places. [2022-11-25 15:39:47,491 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 291 flow [2022-11-25 15:39:47,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 96.85714285714286) internal successors, (678), 7 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:47,492 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:47,492 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:47,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:39:47,492 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:39:47,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:47,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1735199005, now seen corresponding path program 1 times [2022-11-25 15:39:47,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:47,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188366615] [2022-11-25 15:39:47,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:47,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:47,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:47,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:47,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:47,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188366615] [2022-11-25 15:39:47,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188366615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:47,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:47,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:39:47,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561887473] [2022-11-25 15:39:47,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:47,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:39:47,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:47,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:39:47,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:39:47,715 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 214 [2022-11-25 15:39:47,716 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 291 flow. Second operand has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:47,716 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:47,716 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 214 [2022-11-25 15:39:47,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:47,843 INFO L130 PetriNetUnfolder]: 247/455 cut-off events. [2022-11-25 15:39:47,843 INFO L131 PetriNetUnfolder]: For 1305/1307 co-relation queries the response was YES. [2022-11-25 15:39:47,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1887 conditions, 455 events. 247/455 cut-off events. For 1305/1307 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1860 event pairs, 47 based on Foata normal form. 23/475 useless extension candidates. Maximal degree in co-relation 1864. Up to 380 conditions per place. [2022-11-25 15:39:47,847 INFO L137 encePairwiseOnDemand]: 209/214 looper letters, 37 selfloop transitions, 4 changer transitions 0/45 dead transitions. [2022-11-25 15:39:47,847 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 434 flow [2022-11-25 15:39:47,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:39:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:39:47,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-11-25 15:39:47,849 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-11-25 15:39:47,849 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 321 transitions. [2022-11-25 15:39:47,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 321 transitions. [2022-11-25 15:39:47,850 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:47,850 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 321 transitions. [2022-11-25 15:39:47,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.0) internal successors, (321), 3 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:47,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:47,855 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 214.0) internal successors, (856), 4 states have internal predecessors, (856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:47,855 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 291 flow. Second operand 3 states and 321 transitions. [2022-11-25 15:39:47,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 434 flow [2022-11-25 15:39:47,858 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 387 flow, removed 12 selfloop flow, removed 5 redundant places. [2022-11-25 15:39:47,860 INFO L231 Difference]: Finished difference. Result has 48 places, 36 transitions, 252 flow [2022-11-25 15:39:47,860 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=48, PETRI_TRANSITIONS=36} [2022-11-25 15:39:47,863 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 14 predicate places. [2022-11-25 15:39:47,863 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 36 transitions, 252 flow [2022-11-25 15:39:47,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.66666666666667) internal successors, (305), 3 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:47,864 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:47,864 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:47,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:39:47,865 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:39:47,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:47,865 INFO L85 PathProgramCache]: Analyzing trace with hash -422189433, now seen corresponding path program 1 times [2022-11-25 15:39:47,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:47,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739782632] [2022-11-25 15:39:47,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:47,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:48,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:48,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739782632] [2022-11-25 15:39:48,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739782632] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:48,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:48,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:39:48,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182926906] [2022-11-25 15:39:48,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:48,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:39:48,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:48,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:39:48,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:39:48,125 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 214 [2022-11-25 15:39:48,126 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 36 transitions, 252 flow. Second operand has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:48,126 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:48,127 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 214 [2022-11-25 15:39:48,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:48,254 INFO L130 PetriNetUnfolder]: 107/236 cut-off events. [2022-11-25 15:39:48,254 INFO L131 PetriNetUnfolder]: For 460/461 co-relation queries the response was YES. [2022-11-25 15:39:48,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1007 conditions, 236 events. 107/236 cut-off events. For 460/461 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 861 event pairs, 12 based on Foata normal form. 26/261 useless extension candidates. Maximal degree in co-relation 986. Up to 92 conditions per place. [2022-11-25 15:39:48,256 INFO L137 encePairwiseOnDemand]: 209/214 looper letters, 40 selfloop transitions, 7 changer transitions 2/53 dead transitions. [2022-11-25 15:39:48,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 53 transitions, 461 flow [2022-11-25 15:39:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:39:48,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:39:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 427 transitions. [2022-11-25 15:39:48,259 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49883177570093457 [2022-11-25 15:39:48,259 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 427 transitions. [2022-11-25 15:39:48,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 427 transitions. [2022-11-25 15:39:48,260 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:48,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 427 transitions. [2022-11-25 15:39:48,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 106.75) internal successors, (427), 4 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:48,264 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:48,265 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:48,265 INFO L175 Difference]: Start difference. First operand has 48 places, 36 transitions, 252 flow. Second operand 4 states and 427 transitions. [2022-11-25 15:39:48,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 53 transitions, 461 flow [2022-11-25 15:39:48,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 455 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 15:39:48,270 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 275 flow [2022-11-25 15:39:48,270 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=275, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2022-11-25 15:39:48,271 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-11-25 15:39:48,271 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 275 flow [2022-11-25 15:39:48,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.75) internal successors, (403), 4 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:48,274 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:48,274 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:48,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:39:48,275 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:39:48,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:48,275 INFO L85 PathProgramCache]: Analyzing trace with hash -701901795, now seen corresponding path program 1 times [2022-11-25 15:39:48,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:48,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705681330] [2022-11-25 15:39:48,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:48,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:48,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:48,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:48,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705681330] [2022-11-25 15:39:48,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [705681330] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:48,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:48,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:39:48,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919124596] [2022-11-25 15:39:48,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:48,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:39:48,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:48,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:39:48,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:39:48,596 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 214 [2022-11-25 15:39:48,597 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 275 flow. Second operand has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:48,597 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:48,597 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 214 [2022-11-25 15:39:48,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:48,715 INFO L130 PetriNetUnfolder]: 81/180 cut-off events. [2022-11-25 15:39:48,715 INFO L131 PetriNetUnfolder]: For 509/510 co-relation queries the response was YES. [2022-11-25 15:39:48,716 INFO L83 FinitePrefix]: Finished finitePrefix Result has 833 conditions, 180 events. 81/180 cut-off events. For 509/510 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 629 event pairs, 8 based on Foata normal form. 9/188 useless extension candidates. Maximal degree in co-relation 810. Up to 73 conditions per place. [2022-11-25 15:39:48,717 INFO L137 encePairwiseOnDemand]: 209/214 looper letters, 37 selfloop transitions, 10 changer transitions 2/53 dead transitions. [2022-11-25 15:39:48,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 53 transitions, 483 flow [2022-11-25 15:39:48,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:39:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:39:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 524 transitions. [2022-11-25 15:39:48,720 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4897196261682243 [2022-11-25 15:39:48,720 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 524 transitions. [2022-11-25 15:39:48,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 524 transitions. [2022-11-25 15:39:48,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:48,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 524 transitions. [2022-11-25 15:39:48,722 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 104.8) internal successors, (524), 5 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:48,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:48,725 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:48,725 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 275 flow. Second operand 5 states and 524 transitions. [2022-11-25 15:39:48,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 53 transitions, 483 flow [2022-11-25 15:39:48,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 53 transitions, 435 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-11-25 15:39:48,728 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 261 flow [2022-11-25 15:39:48,729 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=261, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2022-11-25 15:39:48,730 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 17 predicate places. [2022-11-25 15:39:48,731 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 261 flow [2022-11-25 15:39:48,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.4) internal successors, (502), 5 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:48,732 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:48,732 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:48,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:39:48,732 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:39:48,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:48,733 INFO L85 PathProgramCache]: Analyzing trace with hash 671983289, now seen corresponding path program 1 times [2022-11-25 15:39:48,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:48,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915372898] [2022-11-25 15:39:48,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:48,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:48,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:49,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:49,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:49,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915372898] [2022-11-25 15:39:49,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915372898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:49,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:49,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:39:49,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582017732] [2022-11-25 15:39:49,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:49,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:39:49,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:49,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:39:49,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:39:49,739 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 214 [2022-11-25 15:39:49,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 261 flow. Second operand has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:49,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:49,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 214 [2022-11-25 15:39:49,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:49,958 INFO L130 PetriNetUnfolder]: 125/267 cut-off events. [2022-11-25 15:39:49,958 INFO L131 PetriNetUnfolder]: For 740/741 co-relation queries the response was YES. [2022-11-25 15:39:49,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1186 conditions, 267 events. 125/267 cut-off events. For 740/741 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 989 event pairs, 25 based on Foata normal form. 1/267 useless extension candidates. Maximal degree in co-relation 1165. Up to 162 conditions per place. [2022-11-25 15:39:49,968 INFO L137 encePairwiseOnDemand]: 208/214 looper letters, 39 selfloop transitions, 6 changer transitions 9/57 dead transitions. [2022-11-25 15:39:49,968 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 57 transitions, 495 flow [2022-11-25 15:39:49,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:39:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:39:49,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 512 transitions. [2022-11-25 15:39:49,971 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4785046728971963 [2022-11-25 15:39:49,972 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 512 transitions. [2022-11-25 15:39:49,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 512 transitions. [2022-11-25 15:39:49,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:49,972 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 512 transitions. [2022-11-25 15:39:49,974 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.4) internal successors, (512), 5 states have internal predecessors, (512), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:49,976 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:49,977 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:49,977 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 261 flow. Second operand 5 states and 512 transitions. [2022-11-25 15:39:49,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 57 transitions, 495 flow [2022-11-25 15:39:49,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 57 transitions, 433 flow, removed 18 selfloop flow, removed 4 redundant places. [2022-11-25 15:39:49,982 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 270 flow [2022-11-25 15:39:49,982 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=229, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=270, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2022-11-25 15:39:49,982 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2022-11-25 15:39:49,983 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 270 flow [2022-11-25 15:39:49,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:49,983 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:49,984 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:49,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:39:49,984 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:39:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:49,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1844415803, now seen corresponding path program 2 times [2022-11-25 15:39:49,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:49,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126660434] [2022-11-25 15:39:49,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:49,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:39:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:39:51,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:39:51,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126660434] [2022-11-25 15:39:51,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126660434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:39:51,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:39:51,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 15:39:51,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844156228] [2022-11-25 15:39:51,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:39:51,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 15:39:51,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:39:51,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 15:39:51,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 15:39:51,181 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 214 [2022-11-25 15:39:51,182 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 41 transitions, 270 flow. Second operand has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:51,182 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:39:51,182 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 214 [2022-11-25 15:39:51,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:39:51,376 INFO L130 PetriNetUnfolder]: 131/287 cut-off events. [2022-11-25 15:39:51,376 INFO L131 PetriNetUnfolder]: For 544/545 co-relation queries the response was YES. [2022-11-25 15:39:51,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 287 events. 131/287 cut-off events. For 544/545 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1113 event pairs, 30 based on Foata normal form. 1/287 useless extension candidates. Maximal degree in co-relation 1186. Up to 144 conditions per place. [2022-11-25 15:39:51,378 INFO L137 encePairwiseOnDemand]: 209/214 looper letters, 34 selfloop transitions, 5 changer transitions 16/57 dead transitions. [2022-11-25 15:39:51,378 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 57 transitions, 460 flow [2022-11-25 15:39:51,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:39:51,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:39:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 517 transitions. [2022-11-25 15:39:51,381 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48317757009345796 [2022-11-25 15:39:51,381 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 517 transitions. [2022-11-25 15:39:51,381 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 517 transitions. [2022-11-25 15:39:51,381 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:39:51,382 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 517 transitions. [2022-11-25 15:39:51,383 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 103.4) internal successors, (517), 5 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:51,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:51,386 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 214.0) internal successors, (1284), 6 states have internal predecessors, (1284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:51,386 INFO L175 Difference]: Start difference. First operand has 53 places, 41 transitions, 270 flow. Second operand 5 states and 517 transitions. [2022-11-25 15:39:51,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 57 transitions, 460 flow [2022-11-25 15:39:51,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 57 transitions, 451 flow, removed 1 selfloop flow, removed 3 redundant places. [2022-11-25 15:39:51,390 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 228 flow [2022-11-25 15:39:51,390 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=214, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=228, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2022-11-25 15:39:51,391 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 21 predicate places. [2022-11-25 15:39:51,391 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 228 flow [2022-11-25 15:39:51,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:39:51,392 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:39:51,392 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:51,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:39:51,392 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:39:51,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:39:51,393 INFO L85 PathProgramCache]: Analyzing trace with hash -932707797, now seen corresponding path program 3 times [2022-11-25 15:39:51,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:39:51,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665495435] [2022-11-25 15:39:51,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:39:51,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:39:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:39:51,442 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:39:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:39:51,570 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:39:51,570 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:39:51,571 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-25 15:39:51,573 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 15:39:51,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-25 15:39:51,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-25 15:39:51,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-25 15:39:51,574 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 15:39:51,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:39:51,575 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:39:51,581 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:39:51,581 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:39:51,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:39:51 BasicIcfg [2022-11-25 15:39:51,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:39:51,704 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:39:51,708 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:39:51,709 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:39:51,709 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:39:33" (3/4) ... [2022-11-25 15:39:51,711 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 15:39:51,786 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:39:51,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:39:51,787 INFO L158 Benchmark]: Toolchain (without parser) took 20226.45ms. Allocated memory was 184.5MB in the beginning and 348.1MB in the end (delta: 163.6MB). Free memory was 149.0MB in the beginning and 297.6MB in the end (delta: -148.5MB). Peak memory consumption was 17.1MB. Max. memory is 16.1GB. [2022-11-25 15:39:51,787 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 125.8MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:39:51,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 693.38ms. Allocated memory is still 184.5MB. Free memory was 149.0MB in the beginning and 122.0MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 15:39:51,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.35ms. Allocated memory is still 184.5MB. Free memory was 122.0MB in the beginning and 119.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:39:51,788 INFO L158 Benchmark]: Boogie Preprocessor took 73.96ms. Allocated memory is still 184.5MB. Free memory was 119.9MB in the beginning and 117.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:39:51,789 INFO L158 Benchmark]: RCFGBuilder took 906.86ms. Allocated memory is still 184.5MB. Free memory was 117.8MB in the beginning and 81.0MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2022-11-25 15:39:51,789 INFO L158 Benchmark]: TraceAbstraction took 18410.25ms. Allocated memory was 184.5MB in the beginning and 348.1MB in the end (delta: 163.6MB). Free memory was 81.0MB in the beginning and 308.1MB in the end (delta: -227.1MB). Peak memory consumption was 140.8MB. Max. memory is 16.1GB. [2022-11-25 15:39:51,790 INFO L158 Benchmark]: Witness Printer took 82.51ms. Allocated memory is still 348.1MB. Free memory was 308.1MB in the beginning and 297.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 15:39:51,791 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.27ms. Allocated memory is still 125.8MB. Free memory is still 67.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 693.38ms. Allocated memory is still 184.5MB. Free memory was 149.0MB in the beginning and 122.0MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.35ms. Allocated memory is still 184.5MB. Free memory was 122.0MB in the beginning and 119.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.96ms. Allocated memory is still 184.5MB. Free memory was 119.9MB in the beginning and 117.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 906.86ms. Allocated memory is still 184.5MB. Free memory was 117.8MB in the beginning and 81.0MB in the end (delta: 36.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 18410.25ms. Allocated memory was 184.5MB in the beginning and 348.1MB in the end (delta: 163.6MB). Free memory was 81.0MB in the beginning and 308.1MB in the end (delta: -227.1MB). Peak memory consumption was 140.8MB. Max. memory is 16.1GB. * Witness Printer took 82.51ms. Allocated memory is still 348.1MB. Free memory was 308.1MB in the beginning and 297.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.9s, 119 PlacesBefore, 34 PlacesAfterwards, 111 TransitionsBefore, 25 TransitionsAfterwards, 2082 CoEnabledTransitionPairs, 6 FixpointIterations, 40 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 10 ConcurrentYvCompositions, 1 ChoiceCompositions, 100 TotalNumberOfCompositions, 5147 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2328, independent: 2182, independent conditional: 0, independent unconditional: 2182, dependent: 146, dependent conditional: 0, dependent unconditional: 146, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1459, independent: 1410, independent conditional: 0, independent unconditional: 1410, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1459, independent: 1390, independent conditional: 0, independent unconditional: 1390, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 49, dependent conditional: 0, dependent unconditional: 49, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 404, independent: 32, independent conditional: 0, independent unconditional: 32, dependent: 372, dependent conditional: 0, dependent unconditional: 372, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2328, independent: 772, independent conditional: 0, independent unconditional: 772, dependent: 97, dependent conditional: 0, dependent unconditional: 97, unknown: 1459, unknown conditional: 0, unknown unconditional: 1459] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 21, Negative conditional cache size: 0, Negative unconditional cache size: 21, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1876; [L819] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1876, ((void *)0), P0, ((void *)0))=-2, t1876={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1877; [L821] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1877, ((void *)0), P1, ((void *)0))=-1, t1876={5:0}, t1877={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1878; [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L823] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1878, ((void *)0), P2, ((void *)0))=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L741] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1876={5:0}, t1877={6:0}, t1878={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 141 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 18.1s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 710 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 553 mSDsluCounter, 497 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 361 mSDsCounter, 174 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1367 IncrementalHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 174 mSolverCounterUnsat, 136 mSDtfsCounter, 1367 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=356occurred in iteration=5, InterpolantAutomatonStates: 63, 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.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 1396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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-11-25 15:39:51,829 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bcbf6c81-fcfd-48e7-991f-5432edc95c43/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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