./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d6003483da8ad7192acf961571797960398ac6b188954f23484dd2dbf22e0c27 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 21:11:16,697 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 21:11:16,699 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 21:11:16,722 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 21:11:16,722 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 21:11:16,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 21:11:16,725 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 21:11:16,726 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 21:11:16,727 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 21:11:16,727 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 21:11:16,728 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 21:11:16,729 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 21:11:16,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 21:11:16,730 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 21:11:16,730 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 21:11:16,731 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 21:11:16,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 21:11:16,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 21:11:16,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 21:11:16,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 21:11:16,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 21:11:16,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 21:11:16,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 21:11:16,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 21:11:16,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 21:11:16,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 21:11:16,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 21:11:16,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 21:11:16,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 21:11:16,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 21:11:16,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 21:11:16,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 21:11:16,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 21:11:16,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 21:11:16,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 21:11:16,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 21:11:16,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 21:11:16,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 21:11:16,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 21:11:16,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 21:11:16,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 21:11:16,750 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 21:11:16,775 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 21:11:16,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 21:11:16,776 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 21:11:16,781 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 21:11:16,782 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 21:11:16,782 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 21:11:16,782 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 21:11:16,783 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 21:11:16,783 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 21:11:16,783 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 21:11:16,783 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 21:11:16,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 21:11:16,784 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 21:11:16,784 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 21:11:16,784 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 21:11:16,784 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 21:11:16,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 21:11:16,784 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 21:11:16,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 21:11:16,785 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 21:11:16,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 21:11:16,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 21:11:16,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 21:11:16,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 21:11:16,785 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:11:16,785 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 21:11:16,785 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 21:11:16,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 21:11:16,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 21:11:16,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 21:11:16,786 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 21:11:16,786 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 21:11:16,786 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 21:11:16,786 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 21:11:16,786 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 21:11:16,786 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_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d6003483da8ad7192acf961571797960398ac6b188954f23484dd2dbf22e0c27 [2022-12-13 21:11:16,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 21:11:16,976 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 21:11:16,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 21:11:16,979 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 21:11:16,979 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 21:11:16,980 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2022-12-13 21:11:19,639 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 21:11:19,832 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 21:11:19,833 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2022-12-13 21:11:19,842 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8/data/631e12b26/81c7570cbf0b435a968b182598d7635b/FLAGb2feac9e3 [2022-12-13 21:11:19,854 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8/data/631e12b26/81c7570cbf0b435a968b182598d7635b [2022-12-13 21:11:19,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 21:11:19,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 21:11:19,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 21:11:19,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 21:11:19,861 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 21:11:19,862 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:11:19" (1/1) ... [2022-12-13 21:11:19,863 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628d7203 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:19, skipping insertion in model container [2022-12-13 21:11:19,863 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 09:11:19" (1/1) ... [2022-12-13 21:11:19,869 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 21:11:19,894 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 21:11:20,020 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_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i[1026,1039] [2022-12-13 21:11:20,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,135 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,136 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,142 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,143 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,146 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:11:20,155 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 21:11:20,164 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_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/sv-benchmarks/c/pthread-wmm/safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i[1026,1039] [2022-12-13 21:11:20,179 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,188 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,191 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,194 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,195 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 21:11:20,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 21:11:20,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 21:11:20,218 INFO L208 MainTranslator]: Completed translation [2022-12-13 21:11:20,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:20 WrapperNode [2022-12-13 21:11:20,218 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 21:11:20,219 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 21:11:20,219 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 21:11:20,219 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 21:11:20,225 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:20" (1/1) ... [2022-12-13 21:11:20,235 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:20" (1/1) ... [2022-12-13 21:11:20,250 INFO L138 Inliner]: procedures = 176, calls = 67, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-12-13 21:11:20,251 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 21:11:20,251 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 21:11:20,251 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 21:11:20,251 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 21:11:20,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:20" (1/1) ... [2022-12-13 21:11:20,259 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:20" (1/1) ... [2022-12-13 21:11:20,262 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:20" (1/1) ... [2022-12-13 21:11:20,262 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:20" (1/1) ... [2022-12-13 21:11:20,266 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:20" (1/1) ... [2022-12-13 21:11:20,268 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:20" (1/1) ... [2022-12-13 21:11:20,269 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:20" (1/1) ... [2022-12-13 21:11:20,270 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:20" (1/1) ... [2022-12-13 21:11:20,272 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 21:11:20,273 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 21:11:20,273 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 21:11:20,273 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 21:11:20,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:20" (1/1) ... [2022-12-13 21:11:20,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 21:11:20,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 21:11:20,297 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 21:11:20,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 21:11:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 21:11:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 21:11:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 21:11:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 21:11:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 21:11:20,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 21:11:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 21:11:20,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 21:11:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 21:11:20,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 21:11:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 21:11:20,327 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 21:11:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 21:11:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 21:11:20,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 21:11:20,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 21:11:20,329 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 21:11:20,452 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 21:11:20,454 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 21:11:20,742 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 21:11:20,859 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 21:11:20,859 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 21:11:20,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:11:20 BoogieIcfgContainer [2022-12-13 21:11:20,862 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 21:11:20,864 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 21:11:20,864 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 21:11:20,867 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 21:11:20,867 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 09:11:19" (1/3) ... [2022-12-13 21:11:20,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e00b7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:11:20, skipping insertion in model container [2022-12-13 21:11:20,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 09:11:20" (2/3) ... [2022-12-13 21:11:20,868 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e00b7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 09:11:20, skipping insertion in model container [2022-12-13 21:11:20,868 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:11:20" (3/3) ... [2022-12-13 21:11:20,870 INFO L112 eAbstractionObserver]: Analyzing ICFG safe007_rmo.oepc_rmo.opt-thin001_rmo.oepc_rmo.opt.i [2022-12-13 21:11:20,878 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 21:11:20,888 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 21:11:20,888 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 21:11:20,888 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 21:11:20,940 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 21:11:20,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 132 transitions, 279 flow [2022-12-13 21:11:21,060 INFO L130 PetriNetUnfolder]: 2/129 cut-off events. [2022-12-13 21:11:21,060 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:11:21,064 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 129 events. 2/129 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 47 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2022-12-13 21:11:21,065 INFO L82 GeneralOperation]: Start removeDead. Operand has 140 places, 132 transitions, 279 flow [2022-12-13 21:11:21,068 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 124 places, 115 transitions, 239 flow [2022-12-13 21:11:21,072 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 21:11:21,081 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 115 transitions, 239 flow [2022-12-13 21:11:21,084 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 115 transitions, 239 flow [2022-12-13 21:11:21,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 124 places, 115 transitions, 239 flow [2022-12-13 21:11:21,112 INFO L130 PetriNetUnfolder]: 1/115 cut-off events. [2022-12-13 21:11:21,112 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:11:21,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 115 events. 1/115 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 38 event pairs, 0 based on Foata normal form. 0/114 useless extension candidates. Maximal degree in co-relation 56. Up to 2 conditions per place. [2022-12-13 21:11:21,114 INFO L119 LiptonReduction]: Number of co-enabled transitions 1214 [2022-12-13 21:11:26,126 INFO L134 LiptonReduction]: Checked pairs total: 2879 [2022-12-13 21:11:26,126 INFO L136 LiptonReduction]: Total number of compositions: 98 [2022-12-13 21:11:26,136 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 21:11:26,140 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;@3b96523a, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 21:11:26,140 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-13 21:11:26,144 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 21:11:26,145 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 21:11:26,145 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:26,145 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:26,146 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:11:26,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:26,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1870425065, now seen corresponding path program 1 times [2022-12-13 21:11:26,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:26,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847912360] [2022-12-13 21:11:26,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:26,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:26,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:26,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:11:26,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:26,514 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847912360] [2022-12-13 21:11:26,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847912360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:26,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:26,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:11:26,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436801997] [2022-12-13 21:11:26,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:26,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:11:26,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:26,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:11:26,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:11:26,546 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 230 [2022-12-13 21:11:26,549 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 47 flow. Second operand has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:26,549 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:26,549 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 230 [2022-12-13 21:11:26,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:26,698 INFO L130 PetriNetUnfolder]: 264/450 cut-off events. [2022-12-13 21:11:26,698 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-12-13 21:11:26,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 450 events. 264/450 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1900 event pairs, 90 based on Foata normal form. 12/458 useless extension candidates. Maximal degree in co-relation 891. Up to 325 conditions per place. [2022-12-13 21:11:26,701 INFO L137 encePairwiseOnDemand]: 227/230 looper letters, 23 selfloop transitions, 2 changer transitions 0/28 dead transitions. [2022-12-13 21:11:26,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 28 transitions, 118 flow [2022-12-13 21:11:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:11:26,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:11:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2022-12-13 21:11:26,715 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5594202898550724 [2022-12-13 21:11:26,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2022-12-13 21:11:26,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2022-12-13 21:11:26,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:26,720 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2022-12-13 21:11:26,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:26,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:26,730 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:26,732 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 47 flow. Second operand 3 states and 386 transitions. [2022-12-13 21:11:26,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 28 transitions, 118 flow [2022-12-13 21:11:26,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 28 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 21:11:26,736 INFO L231 Difference]: Finished difference. Result has 29 places, 19 transitions, 52 flow [2022-12-13 21:11:26,738 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=29, PETRI_TRANSITIONS=19} [2022-12-13 21:11:26,742 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 0 predicate places. [2022-12-13 21:11:26,742 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 19 transitions, 52 flow [2022-12-13 21:11:26,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 122.25) internal successors, (489), 4 states have internal predecessors, (489), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:26,742 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:26,743 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:26,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 21:11:26,743 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:11:26,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:26,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2146364372, now seen corresponding path program 1 times [2022-12-13 21:11:26,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:26,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600224285] [2022-12-13 21:11:26,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:26,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:11:26,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:26,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600224285] [2022-12-13 21:11:26,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600224285] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:26,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:26,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:11:26,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574651806] [2022-12-13 21:11:26,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:26,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:11:26,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:26,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:11:26,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:11:26,870 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 230 [2022-12-13 21:11:26,872 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 19 transitions, 52 flow. Second operand has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:26,872 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:26,872 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 230 [2022-12-13 21:11:26,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:27,042 INFO L130 PetriNetUnfolder]: 409/694 cut-off events. [2022-12-13 21:11:27,042 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2022-12-13 21:11:27,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1527 conditions, 694 events. 409/694 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3460 event pairs, 139 based on Foata normal form. 32/718 useless extension candidates. Maximal degree in co-relation 1516. Up to 234 conditions per place. [2022-12-13 21:11:27,045 INFO L137 encePairwiseOnDemand]: 226/230 looper letters, 31 selfloop transitions, 3 changer transitions 3/39 dead transitions. [2022-12-13 21:11:27,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 39 transitions, 175 flow [2022-12-13 21:11:27,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:11:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:11:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 511 transitions. [2022-12-13 21:11:27,047 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5554347826086956 [2022-12-13 21:11:27,047 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 511 transitions. [2022-12-13 21:11:27,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 511 transitions. [2022-12-13 21:11:27,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:27,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 511 transitions. [2022-12-13 21:11:27,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 127.75) internal successors, (511), 4 states have internal predecessors, (511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:27,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:27,051 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:27,051 INFO L175 Difference]: Start difference. First operand has 29 places, 19 transitions, 52 flow. Second operand 4 states and 511 transitions. [2022-12-13 21:11:27,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 39 transitions, 175 flow [2022-12-13 21:11:27,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 39 transitions, 169 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:11:27,052 INFO L231 Difference]: Finished difference. Result has 32 places, 19 transitions, 62 flow [2022-12-13 21:11:27,052 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=32, PETRI_TRANSITIONS=19} [2022-12-13 21:11:27,052 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 3 predicate places. [2022-12-13 21:11:27,052 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 19 transitions, 62 flow [2022-12-13 21:11:27,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 120.5) internal successors, (482), 4 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:27,053 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:27,053 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:27,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 21:11:27,053 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:11:27,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:27,053 INFO L85 PathProgramCache]: Analyzing trace with hash -489138058, now seen corresponding path program 1 times [2022-12-13 21:11:27,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:27,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851854054] [2022-12-13 21:11:27,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:27,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:27,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:11:27,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:27,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851854054] [2022-12-13 21:11:27,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851854054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:27,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:27,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 21:11:27,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732394914] [2022-12-13 21:11:27,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:27,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 21:11:27,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:27,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 21:11:27,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 21:11:27,168 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 230 [2022-12-13 21:11:27,169 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 19 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:27,169 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:27,169 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 230 [2022-12-13 21:11:27,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:27,255 INFO L130 PetriNetUnfolder]: 172/316 cut-off events. [2022-12-13 21:11:27,255 INFO L131 PetriNetUnfolder]: For 113/114 co-relation queries the response was YES. [2022-12-13 21:11:27,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 758 conditions, 316 events. 172/316 cut-off events. For 113/114 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1284 event pairs, 46 based on Foata normal form. 4/317 useless extension candidates. Maximal degree in co-relation 745. Up to 210 conditions per place. [2022-12-13 21:11:27,256 INFO L137 encePairwiseOnDemand]: 227/230 looper letters, 20 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2022-12-13 21:11:27,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 25 transitions, 122 flow [2022-12-13 21:11:27,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 21:11:27,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 21:11:27,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2022-12-13 21:11:27,257 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5550724637681159 [2022-12-13 21:11:27,257 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 383 transitions. [2022-12-13 21:11:27,258 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 383 transitions. [2022-12-13 21:11:27,258 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:27,258 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 383 transitions. [2022-12-13 21:11:27,258 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:27,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:27,260 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 230.0) internal successors, (920), 4 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:27,260 INFO L175 Difference]: Start difference. First operand has 32 places, 19 transitions, 62 flow. Second operand 3 states and 383 transitions. [2022-12-13 21:11:27,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 25 transitions, 122 flow [2022-12-13 21:11:27,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 25 transitions, 108 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 21:11:27,261 INFO L231 Difference]: Finished difference. Result has 31 places, 19 transitions, 58 flow [2022-12-13 21:11:27,261 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=31, PETRI_TRANSITIONS=19} [2022-12-13 21:11:27,261 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 2 predicate places. [2022-12-13 21:11:27,262 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 19 transitions, 58 flow [2022-12-13 21:11:27,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:27,262 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:27,262 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:27,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 21:11:27,262 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:11:27,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:27,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2082998395, now seen corresponding path program 1 times [2022-12-13 21:11:27,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:27,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114492770] [2022-12-13 21:11:27,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:27,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:27,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:27,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:11:27,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:27,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114492770] [2022-12-13 21:11:27,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114492770] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:27,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:27,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 21:11:27,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041704110] [2022-12-13 21:11:27,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:27,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:11:27,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:27,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:11:27,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:11:27,378 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 230 [2022-12-13 21:11:27,379 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 19 transitions, 58 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:27,379 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:27,379 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 230 [2022-12-13 21:11:27,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:27,503 INFO L130 PetriNetUnfolder]: 272/472 cut-off events. [2022-12-13 21:11:27,503 INFO L131 PetriNetUnfolder]: For 123/124 co-relation queries the response was YES. [2022-12-13 21:11:27,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1065 conditions, 472 events. 272/472 cut-off events. For 123/124 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1922 event pairs, 108 based on Foata normal form. 18/484 useless extension candidates. Maximal degree in co-relation 1053. Up to 177 conditions per place. [2022-12-13 21:11:27,505 INFO L137 encePairwiseOnDemand]: 226/230 looper letters, 23 selfloop transitions, 3 changer transitions 5/33 dead transitions. [2022-12-13 21:11:27,505 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 33 transitions, 153 flow [2022-12-13 21:11:27,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:11:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:11:27,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 505 transitions. [2022-12-13 21:11:27,506 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5489130434782609 [2022-12-13 21:11:27,506 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 505 transitions. [2022-12-13 21:11:27,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 505 transitions. [2022-12-13 21:11:27,506 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:27,507 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 505 transitions. [2022-12-13 21:11:27,507 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.25) internal successors, (505), 4 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:27,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:27,509 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:27,509 INFO L175 Difference]: Start difference. First operand has 31 places, 19 transitions, 58 flow. Second operand 4 states and 505 transitions. [2022-12-13 21:11:27,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 33 transitions, 153 flow [2022-12-13 21:11:27,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 147 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 21:11:27,510 INFO L231 Difference]: Finished difference. Result has 34 places, 19 transitions, 68 flow [2022-12-13 21:11:27,510 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=68, PETRI_PLACES=34, PETRI_TRANSITIONS=19} [2022-12-13 21:11:27,510 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 5 predicate places. [2022-12-13 21:11:27,510 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 19 transitions, 68 flow [2022-12-13 21:11:27,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:27,511 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:27,511 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:27,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 21:11:27,511 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:11:27,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:27,511 INFO L85 PathProgramCache]: Analyzing trace with hash 148390789, now seen corresponding path program 1 times [2022-12-13 21:11:27,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:27,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464439400] [2022-12-13 21:11:27,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:27,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:11:28,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:28,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464439400] [2022-12-13 21:11:28,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464439400] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:28,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:28,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:11:28,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396092146] [2022-12-13 21:11:28,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:28,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 21:11:28,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:28,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 21:11:28,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 21:11:28,615 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 230 [2022-12-13 21:11:28,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 19 transitions, 68 flow. Second operand has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:28,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:28,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 230 [2022-12-13 21:11:28,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:28,752 INFO L130 PetriNetUnfolder]: 138/257 cut-off events. [2022-12-13 21:11:28,752 INFO L131 PetriNetUnfolder]: For 164/164 co-relation queries the response was YES. [2022-12-13 21:11:28,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 648 conditions, 257 events. 138/257 cut-off events. For 164/164 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 780 event pairs, 30 based on Foata normal form. 4/261 useless extension candidates. Maximal degree in co-relation 634. Up to 129 conditions per place. [2022-12-13 21:11:28,754 INFO L137 encePairwiseOnDemand]: 226/230 looper letters, 24 selfloop transitions, 3 changer transitions 0/29 dead transitions. [2022-12-13 21:11:28,754 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 29 transitions, 146 flow [2022-12-13 21:11:28,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 21:11:28,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 21:11:28,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 464 transitions. [2022-12-13 21:11:28,757 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5043478260869565 [2022-12-13 21:11:28,757 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 464 transitions. [2022-12-13 21:11:28,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 464 transitions. [2022-12-13 21:11:28,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:28,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 464 transitions. [2022-12-13 21:11:28,760 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 116.0) internal successors, (464), 4 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:28,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:28,764 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 230.0) internal successors, (1150), 5 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:28,764 INFO L175 Difference]: Start difference. First operand has 34 places, 19 transitions, 68 flow. Second operand 4 states and 464 transitions. [2022-12-13 21:11:28,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 29 transitions, 146 flow [2022-12-13 21:11:28,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 29 transitions, 130 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-12-13 21:11:28,767 INFO L231 Difference]: Finished difference. Result has 33 places, 19 transitions, 62 flow [2022-12-13 21:11:28,767 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=62, PETRI_PLACES=33, PETRI_TRANSITIONS=19} [2022-12-13 21:11:28,768 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 4 predicate places. [2022-12-13 21:11:28,768 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 19 transitions, 62 flow [2022-12-13 21:11:28,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 110.71428571428571) internal successors, (775), 7 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:28,769 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:28,769 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:28,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 21:11:28,770 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:11:28,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash 994195191, now seen corresponding path program 1 times [2022-12-13 21:11:28,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:28,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341907785] [2022-12-13 21:11:28,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:28,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:28,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:11:28,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:28,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341907785] [2022-12-13 21:11:28,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341907785] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:28,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:28,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 21:11:28,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776119672] [2022-12-13 21:11:28,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:28,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 21:11:28,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:28,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 21:11:28,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 21:11:28,980 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 230 [2022-12-13 21:11:28,981 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 19 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:28,981 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:28,981 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 230 [2022-12-13 21:11:28,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:29,075 INFO L130 PetriNetUnfolder]: 106/208 cut-off events. [2022-12-13 21:11:29,075 INFO L131 PetriNetUnfolder]: For 60/63 co-relation queries the response was YES. [2022-12-13 21:11:29,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 208 events. 106/208 cut-off events. For 60/63 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 709 event pairs, 38 based on Foata normal form. 20/225 useless extension candidates. Maximal degree in co-relation 473. Up to 145 conditions per place. [2022-12-13 21:11:29,076 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 22 selfloop transitions, 4 changer transitions 14/43 dead transitions. [2022-12-13 21:11:29,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 43 transitions, 206 flow [2022-12-13 21:11:29,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 21:11:29,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 21:11:29,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 612 transitions. [2022-12-13 21:11:29,078 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5321739130434783 [2022-12-13 21:11:29,078 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 612 transitions. [2022-12-13 21:11:29,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 612 transitions. [2022-12-13 21:11:29,078 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:29,078 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 612 transitions. [2022-12-13 21:11:29,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.4) internal successors, (612), 5 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:29,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:29,080 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 230.0) internal successors, (1380), 6 states have internal predecessors, (1380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:29,080 INFO L175 Difference]: Start difference. First operand has 33 places, 19 transitions, 62 flow. Second operand 5 states and 612 transitions. [2022-12-13 21:11:29,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 43 transitions, 206 flow [2022-12-13 21:11:29,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 43 transitions, 198 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 21:11:29,082 INFO L231 Difference]: Finished difference. Result has 37 places, 22 transitions, 92 flow [2022-12-13 21:11:29,082 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=92, PETRI_PLACES=37, PETRI_TRANSITIONS=22} [2022-12-13 21:11:29,082 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 8 predicate places. [2022-12-13 21:11:29,082 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 22 transitions, 92 flow [2022-12-13 21:11:29,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.0) internal successors, (468), 4 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:29,083 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:29,083 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:29,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 21:11:29,083 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:11:29,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:29,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1180560221, now seen corresponding path program 1 times [2022-12-13 21:11:29,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:29,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510305370] [2022-12-13 21:11:29,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:29,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:29,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:11:29,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:29,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510305370] [2022-12-13 21:11:29,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510305370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:29,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:29,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 21:11:29,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726693304] [2022-12-13 21:11:29,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:29,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 21:11:29,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:29,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 21:11:29,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 21:11:29,206 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 230 [2022-12-13 21:11:29,206 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 22 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:29,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:29,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 230 [2022-12-13 21:11:29,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:29,298 INFO L130 PetriNetUnfolder]: 62/138 cut-off events. [2022-12-13 21:11:29,299 INFO L131 PetriNetUnfolder]: For 105/113 co-relation queries the response was YES. [2022-12-13 21:11:29,299 INFO L83 FinitePrefix]: Finished finitePrefix Result has 462 conditions, 138 events. 62/138 cut-off events. For 105/113 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 438 event pairs, 9 based on Foata normal form. 19/154 useless extension candidates. Maximal degree in co-relation 447. Up to 70 conditions per place. [2022-12-13 21:11:29,299 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 26 selfloop transitions, 7 changer transitions 12/48 dead transitions. [2022-12-13 21:11:29,299 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 48 transitions, 288 flow [2022-12-13 21:11:29,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 21:11:29,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 21:11:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 731 transitions. [2022-12-13 21:11:29,301 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5297101449275362 [2022-12-13 21:11:29,301 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 731 transitions. [2022-12-13 21:11:29,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 731 transitions. [2022-12-13 21:11:29,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:29,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 731 transitions. [2022-12-13 21:11:29,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 121.83333333333333) internal successors, (731), 6 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:29,304 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:29,304 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 230.0) internal successors, (1610), 7 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:29,304 INFO L175 Difference]: Start difference. First operand has 37 places, 22 transitions, 92 flow. Second operand 6 states and 731 transitions. [2022-12-13 21:11:29,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 48 transitions, 288 flow [2022-12-13 21:11:29,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 48 transitions, 282 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 21:11:29,306 INFO L231 Difference]: Finished difference. Result has 41 places, 25 transitions, 142 flow [2022-12-13 21:11:29,307 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=142, PETRI_PLACES=41, PETRI_TRANSITIONS=25} [2022-12-13 21:11:29,307 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 12 predicate places. [2022-12-13 21:11:29,307 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 25 transitions, 142 flow [2022-12-13 21:11:29,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.6) internal successors, (583), 5 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:29,308 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:29,308 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:29,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 21:11:29,308 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:11:29,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:29,308 INFO L85 PathProgramCache]: Analyzing trace with hash 339339888, now seen corresponding path program 1 times [2022-12-13 21:11:29,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:29,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755743843] [2022-12-13 21:11:29,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:29,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 21:11:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 21:11:29,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 21:11:29,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755743843] [2022-12-13 21:11:29,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755743843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 21:11:29,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 21:11:29,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 21:11:29,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641670641] [2022-12-13 21:11:29,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 21:11:29,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 21:11:29,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 21:11:29,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 21:11:29,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 21:11:29,449 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 230 [2022-12-13 21:11:29,450 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 25 transitions, 142 flow. Second operand has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:29,450 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 21:11:29,450 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 230 [2022-12-13 21:11:29,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 21:11:29,527 INFO L130 PetriNetUnfolder]: 38/92 cut-off events. [2022-12-13 21:11:29,528 INFO L131 PetriNetUnfolder]: For 180/193 co-relation queries the response was YES. [2022-12-13 21:11:29,528 INFO L83 FinitePrefix]: Finished finitePrefix Result has 352 conditions, 92 events. 38/92 cut-off events. For 180/193 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 227 event pairs, 6 based on Foata normal form. 15/104 useless extension candidates. Maximal degree in co-relation 334. Up to 43 conditions per place. [2022-12-13 21:11:29,528 INFO L137 encePairwiseOnDemand]: 224/230 looper letters, 23 selfloop transitions, 10 changer transitions 6/42 dead transitions. [2022-12-13 21:11:29,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 42 transitions, 295 flow [2022-12-13 21:11:29,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 21:11:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 21:11:29,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 839 transitions. [2022-12-13 21:11:29,531 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5211180124223602 [2022-12-13 21:11:29,531 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 839 transitions. [2022-12-13 21:11:29,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 839 transitions. [2022-12-13 21:11:29,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 21:11:29,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 839 transitions. [2022-12-13 21:11:29,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.85714285714286) internal successors, (839), 7 states have internal predecessors, (839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:29,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:29,535 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 230.0) internal successors, (1840), 8 states have internal predecessors, (1840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:29,535 INFO L175 Difference]: Start difference. First operand has 41 places, 25 transitions, 142 flow. Second operand 7 states and 839 transitions. [2022-12-13 21:11:29,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 42 transitions, 295 flow [2022-12-13 21:11:29,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 42 transitions, 248 flow, removed 16 selfloop flow, removed 6 redundant places. [2022-12-13 21:11:29,537 INFO L231 Difference]: Finished difference. Result has 42 places, 25 transitions, 136 flow [2022-12-13 21:11:29,537 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=230, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=136, PETRI_PLACES=42, PETRI_TRANSITIONS=25} [2022-12-13 21:11:29,538 INFO L288 CegarLoopForPetriNet]: 29 programPoint places, 13 predicate places. [2022-12-13 21:11:29,538 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 25 transitions, 136 flow [2022-12-13 21:11:29,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.33333333333333) internal successors, (698), 6 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 21:11:29,539 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 21:11:29,539 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-12-13 21:11:29,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 21:11:29,539 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-12-13 21:11:29,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 21:11:29,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1293934632, now seen corresponding path program 1 times [2022-12-13 21:11:29,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 21:11:29,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211593862] [2022-12-13 21:11:29,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 21:11:29,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 21:11:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:11:29,594 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 21:11:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 21:11:29,653 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 21:11:29,653 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 21:11:29,654 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2022-12-13 21:11:29,655 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2022-12-13 21:11:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2022-12-13 21:11:29,656 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2022-12-13 21:11:29,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 21:11:29,656 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 21:11:29,661 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 21:11:29,661 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 21:11:29,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 09:11:29 BasicIcfg [2022-12-13 21:11:29,721 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 21:11:29,722 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 21:11:29,722 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 21:11:29,722 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 21:11:29,722 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 09:11:20" (3/4) ... [2022-12-13 21:11:29,724 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 21:11:29,791 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 21:11:29,791 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 21:11:29,792 INFO L158 Benchmark]: Toolchain (without parser) took 9934.42ms. Allocated memory was 130.0MB in the beginning and 226.5MB in the end (delta: 96.5MB). Free memory was 95.3MB in the beginning and 72.2MB in the end (delta: 23.0MB). Peak memory consumption was 121.2MB. Max. memory is 16.1GB. [2022-12-13 21:11:29,792 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 130.0MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 21:11:29,792 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.11ms. Allocated memory is still 130.0MB. Free memory was 95.0MB in the beginning and 69.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 21:11:29,793 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.69ms. Allocated memory is still 130.0MB. Free memory was 69.2MB in the beginning and 66.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:11:29,793 INFO L158 Benchmark]: Boogie Preprocessor took 21.42ms. Allocated memory is still 130.0MB. Free memory was 66.7MB in the beginning and 64.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 21:11:29,793 INFO L158 Benchmark]: RCFGBuilder took 588.70ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 64.7MB in the beginning and 88.8MB in the end (delta: -24.1MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. [2022-12-13 21:11:29,794 INFO L158 Benchmark]: TraceAbstraction took 8857.49ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 88.2MB in the beginning and 84.8MB in the end (delta: 3.4MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. [2022-12-13 21:11:29,794 INFO L158 Benchmark]: Witness Printer took 69.47ms. Allocated memory is still 226.5MB. Free memory was 84.8MB in the beginning and 72.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 21:11:29,795 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.13ms. Allocated memory is still 130.0MB. Free memory is still 97.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.11ms. Allocated memory is still 130.0MB. Free memory was 95.0MB in the beginning and 69.2MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.69ms. Allocated memory is still 130.0MB. Free memory was 69.2MB in the beginning and 66.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.42ms. Allocated memory is still 130.0MB. Free memory was 66.7MB in the beginning and 64.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 588.70ms. Allocated memory was 130.0MB in the beginning and 157.3MB in the end (delta: 27.3MB). Free memory was 64.7MB in the beginning and 88.8MB in the end (delta: -24.1MB). Peak memory consumption was 12.2MB. Max. memory is 16.1GB. * TraceAbstraction took 8857.49ms. Allocated memory was 157.3MB in the beginning and 226.5MB in the end (delta: 69.2MB). Free memory was 88.2MB in the beginning and 84.8MB in the end (delta: 3.4MB). Peak memory consumption was 73.3MB. Max. memory is 16.1GB. * Witness Printer took 69.47ms. Allocated memory is still 226.5MB. Free memory was 84.8MB in the beginning and 72.2MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.0s, 124 PlacesBefore, 29 PlacesAfterwards, 115 TransitionsBefore, 19 TransitionsAfterwards, 1214 CoEnabledTransitionPairs, 7 FixpointIterations, 61 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, 2879 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1275, independent: 1124, independent conditional: 0, independent unconditional: 1124, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 646, independent: 609, independent conditional: 0, independent unconditional: 609, dependent: 37, dependent conditional: 0, dependent unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 1275, independent: 515, independent conditional: 0, independent unconditional: 515, dependent: 114, dependent conditional: 0, dependent unconditional: 114, unknown: 646, unknown conditional: 0, unknown unconditional: 646] , Statistics on independence cache: Total cache size (in pairs): 64, Positive cache size: 49, Positive conditional cache size: 0, Positive unconditional cache size: 49, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 19]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L714] 0 int __unbuffered_p0_EAX$mem_tmp; [L715] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L723] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L724] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L725] 0 int __unbuffered_p0_EAX$w_buff0; [L726] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L727] 0 int __unbuffered_p0_EAX$w_buff1; [L728] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L730] 0 int __unbuffered_p1_EAX = 0; [L732] 0 int __unbuffered_p2_EAX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L738] 0 int y = 0; [L740] 0 int z = 0; [L741] 0 _Bool z$flush_delayed; [L742] 0 int z$mem_tmp; [L743] 0 _Bool z$r_buff0_thd0; [L744] 0 _Bool z$r_buff0_thd1; [L745] 0 _Bool z$r_buff0_thd2; [L746] 0 _Bool z$r_buff0_thd3; [L747] 0 _Bool z$r_buff1_thd0; [L748] 0 _Bool z$r_buff1_thd1; [L749] 0 _Bool z$r_buff1_thd2; [L750] 0 _Bool z$r_buff1_thd3; [L751] 0 _Bool z$read_delayed; [L752] 0 int *z$read_delayed_var; [L753] 0 int z$w_buff0; [L754] 0 _Bool z$w_buff0_used; [L755] 0 int z$w_buff1; [L756] 0 _Bool z$w_buff1_used; [L757] 0 _Bool weak$$choice0; [L758] 0 _Bool weak$$choice1; [L759] 0 _Bool weak$$choice2; [L836] 0 pthread_t t1949; [L837] FCALL, FORK 0 pthread_create(&t1949, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1949, ((void *)0), P0, ((void *)0))=0, t1949={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t1950; [L763] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 1 z$flush_delayed = weak$$choice2 [L766] EXPR 1 \read(z) [L766] 1 z$mem_tmp = z [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] EXPR 1 \read(z) [L767] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L767] 1 z = !z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff1) [L768] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : z$w_buff0)) [L769] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff1 : z$w_buff1)) [L770] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used)) [L771] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L772] 1 z$r_buff0_thd1 = weak$$choice2 ? z$r_buff0_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff0_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1)) [L773] 1 z$r_buff1_thd1 = weak$$choice2 ? z$r_buff1_thd1 : (!z$w_buff0_used || !z$r_buff0_thd1 && !z$w_buff1_used || !z$r_buff0_thd1 && !z$r_buff1_thd1 ? z$r_buff1_thd1 : (z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L774] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L775] 1 __unbuffered_p0_EAX$read_delayed_var = &z [L776] EXPR 1 \read(z) [L776] 1 __unbuffered_p0_EAX = z [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] EXPR 1 \read(z) [L777] EXPR 1 z$flush_delayed ? z$mem_tmp : z [L777] 1 z = z$flush_delayed ? z$mem_tmp : z [L778] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1950, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1950, ((void *)0), P1, ((void *)0))=1, t1949={7:0}, t1950={5:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t1951; [L793] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1951, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1951, ((void *)0), P2, ((void *)0))=2, t1949={7:0}, t1950={5:0}, t1951={6:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L788] 1 return 0; [L811] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 \read(z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L803] 2 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L845] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L845] RET 0 assume_abort_if_not(main$tmp_guard0) [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 \read(z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1949={7:0}, t1950={5:0}, t1951={6:0}, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L855] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L855] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L855] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L856] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 839]: 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: 841]: 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: 837]: 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, 156 locations, 4 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: 8.7s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 344 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 270 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 78 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 593 IncrementalHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 27 mSDtfsCounter, 593 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 30 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=142occurred in iteration=7, InterpolantAutomatonStates: 36, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 734 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 21:11:29,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fd8898a8-37ad-4671-ab69-e1ad45f8fa9f/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE