./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b940c-132d-4db8-8072-ef542bf64f65/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b940c-132d-4db8-8072-ef542bf64f65/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_f73b940c-132d-4db8-8072-ef542bf64f65/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b940c-132d-4db8-8072-ef542bf64f65/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b940c-132d-4db8-8072-ef542bf64f65/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_f73b940c-132d-4db8-8072-ef542bf64f65/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 d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d --- 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 13:20:31,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:20:31,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:20:31,238 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:20:31,239 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:20:31,240 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:20:31,241 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:20:31,243 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:20:31,244 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:20:31,245 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:20:31,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:20:31,247 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:20:31,247 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:20:31,248 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:20:31,249 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:20:31,251 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:20:31,251 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:20:31,252 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:20:31,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:20:31,256 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:20:31,257 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:20:31,258 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:20:31,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:20:31,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:20:31,264 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:20:31,264 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:20:31,264 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:20:31,265 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:20:31,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:20:31,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:20:31,267 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:20:31,268 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:20:31,268 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:20:31,269 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:20:31,270 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:20:31,270 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:20:31,271 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:20:31,271 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:20:31,272 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:20:31,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:20:31,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:20:31,274 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b940c-132d-4db8-8072-ef542bf64f65/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 13:20:31,296 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:20:31,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:20:31,297 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:20:31,297 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:20:31,298 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:20:31,298 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:20:31,298 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:20:31,299 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:20:31,299 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:20:31,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:20:31,299 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:20:31,299 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:20:31,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:20:31,300 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:20:31,300 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:20:31,300 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:20:31,300 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:20:31,300 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:20:31,301 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:20:31,301 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:20:31,301 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:20:31,301 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:20:31,301 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:20:31,302 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:20:31,302 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:20:31,302 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:20:31,302 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:20:31,302 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:20:31,302 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:20:31,303 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:20:31,303 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:20:31,303 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:20:31,303 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:20:31,303 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:20:31,303 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:20:31,304 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_f73b940c-132d-4db8-8072-ef542bf64f65/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_f73b940c-132d-4db8-8072-ef542bf64f65/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 -> d6f4376125179246714b78f2e2f349c8b75c8c24c937ac142dcf7789f615522d [2022-12-13 13:20:31,499 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:20:31,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:20:31,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:20:31,518 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:20:31,519 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:20:31,520 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b940c-132d-4db8-8072-ef542bf64f65/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2022-12-13 13:20:34,135 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:20:34,309 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:20:34,309 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b940c-132d-4db8-8072-ef542bf64f65/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i [2022-12-13 13:20:34,320 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b940c-132d-4db8-8072-ef542bf64f65/bin/uautomizer-uyxdKDjOR8/data/d25037d6b/121fadf8b77844d9af84c039435934d9/FLAGe722f9cfd [2022-12-13 13:20:34,330 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b940c-132d-4db8-8072-ef542bf64f65/bin/uautomizer-uyxdKDjOR8/data/d25037d6b/121fadf8b77844d9af84c039435934d9 [2022-12-13 13:20:34,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:20:34,333 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:20:34,334 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:20:34,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:20:34,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:20:34,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:20:34" (1/1) ... [2022-12-13 13:20:34,338 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a1cf8be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:34, skipping insertion in model container [2022-12-13 13:20:34,338 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:20:34" (1/1) ... [2022-12-13 13:20:34,343 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:20:34,375 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:20:34,489 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_f73b940c-132d-4db8-8072-ef542bf64f65/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i[949,962] [2022-12-13 13:20:34,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,595 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,600 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,602 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,604 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,605 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,608 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,613 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,614 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,616 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,623 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,623 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:20:34,632 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:20:34,640 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_f73b940c-132d-4db8-8072-ef542bf64f65/sv-benchmarks/c/pthread-wmm/mix019_tso.oepc.i[949,962] [2022-12-13 13:20:34,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,657 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,658 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,660 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,661 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,662 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,663 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,664 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,665 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,667 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,670 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,671 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,672 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:34,676 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:34,677 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:20:34,700 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:20:34,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:34 WrapperNode [2022-12-13 13:20:34,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:20:34,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:20:34,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:20:34,701 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:20:34,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:34" (1/1) ... [2022-12-13 13:20:34,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:34" (1/1) ... [2022-12-13 13:20:34,736 INFO L138 Inliner]: procedures = 176, calls = 56, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-13 13:20:34,737 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:20:34,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:20:34,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:20:34,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:20:34,744 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:34" (1/1) ... [2022-12-13 13:20:34,744 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:34" (1/1) ... [2022-12-13 13:20:34,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:34" (1/1) ... [2022-12-13 13:20:34,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:34" (1/1) ... [2022-12-13 13:20:34,752 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:34" (1/1) ... [2022-12-13 13:20:34,753 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:34" (1/1) ... [2022-12-13 13:20:34,755 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:34" (1/1) ... [2022-12-13 13:20:34,756 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:34" (1/1) ... [2022-12-13 13:20:34,758 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:20:34,759 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:20:34,759 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:20:34,759 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:20:34,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:34" (1/1) ... [2022-12-13 13:20:34,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:20:34,773 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b940c-132d-4db8-8072-ef542bf64f65/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:20:34,783 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b940c-132d-4db8-8072-ef542bf64f65/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:20:34,785 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b940c-132d-4db8-8072-ef542bf64f65/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:20:34,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:20:34,826 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:20:34,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:20:34,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:20:34,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:20:34,827 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 13:20:34,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 13:20:34,827 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 13:20:34,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 13:20:34,827 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 13:20:34,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 13:20:34,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:20:34,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:20:34,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:20:34,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:20:34,829 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 13:20:34,943 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:20:34,945 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:20:35,197 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:20:35,298 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:20:35,299 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 13:20:35,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:20:35 BoogieIcfgContainer [2022-12-13 13:20:35,301 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:20:35,304 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:20:35,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:20:35,307 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:20:35,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:20:34" (1/3) ... [2022-12-13 13:20:35,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f57313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:20:35, skipping insertion in model container [2022-12-13 13:20:35,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:34" (2/3) ... [2022-12-13 13:20:35,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43f57313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:20:35, skipping insertion in model container [2022-12-13 13:20:35,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:20:35" (3/3) ... [2022-12-13 13:20:35,309 INFO L112 eAbstractionObserver]: Analyzing ICFG mix019_tso.oepc.i [2022-12-13 13:20:35,318 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 13:20:35,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:20:35,329 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 13:20:35,329 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:20:35,374 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 13:20:35,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 249 flow [2022-12-13 13:20:35,457 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-12-13 13:20:35,457 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:20:35,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-12-13 13:20:35,462 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 117 transitions, 249 flow [2022-12-13 13:20:35,466 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 114 transitions, 237 flow [2022-12-13 13:20:35,470 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 13:20:35,481 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 122 places, 114 transitions, 237 flow [2022-12-13 13:20:35,484 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 122 places, 114 transitions, 237 flow [2022-12-13 13:20:35,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 114 transitions, 237 flow [2022-12-13 13:20:35,512 INFO L130 PetriNetUnfolder]: 2/114 cut-off events. [2022-12-13 13:20:35,512 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:20:35,513 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 114 events. 2/114 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 55 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-12-13 13:20:35,514 INFO L119 LiptonReduction]: Number of co-enabled transitions 2178 [2022-12-13 13:20:39,019 INFO L134 LiptonReduction]: Checked pairs total: 6120 [2022-12-13 13:20:39,019 INFO L136 LiptonReduction]: Total number of compositions: 102 [2022-12-13 13:20:39,032 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:20:39,037 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;@69951bf7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:20:39,037 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-12-13 13:20:39,041 INFO L130 PetriNetUnfolder]: 0/7 cut-off events. [2022-12-13 13:20:39,041 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:20:39,041 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:39,042 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 13:20:39,042 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:20:39,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:39,046 INFO L85 PathProgramCache]: Analyzing trace with hash 478815814, now seen corresponding path program 1 times [2022-12-13 13:20:39,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:39,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411738518] [2022-12-13 13:20:39,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:39,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:39,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:39,340 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 13:20:39,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:39,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411738518] [2022-12-13 13:20:39,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411738518] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:39,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:39,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:20:39,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289062677] [2022-12-13 13:20:39,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:39,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:20:39,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:39,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:20:39,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:20:39,371 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 219 [2022-12-13 13:20:39,373 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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 13:20:39,373 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:20:39,373 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 219 [2022-12-13 13:20:39,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:20:39,598 INFO L130 PetriNetUnfolder]: 711/1177 cut-off events. [2022-12-13 13:20:39,598 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2022-12-13 13:20:39,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 1177 events. 711/1177 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6041 event pairs, 117 based on Foata normal form. 0/1096 useless extension candidates. Maximal degree in co-relation 2285. Up to 859 conditions per place. [2022-12-13 13:20:39,604 INFO L137 encePairwiseOnDemand]: 216/219 looper letters, 27 selfloop transitions, 2 changer transitions 2/35 dead transitions. [2022-12-13 13:20:39,604 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 35 transitions, 144 flow [2022-12-13 13:20:39,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:20:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:20:39,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2022-12-13 13:20:39,614 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5190258751902588 [2022-12-13 13:20:39,615 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2022-12-13 13:20:39,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2022-12-13 13:20:39,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:39,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2022-12-13 13:20:39,620 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 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 13:20:39,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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 13:20:39,624 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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 13:20:39,626 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 57 flow. Second operand 3 states and 341 transitions. [2022-12-13 13:20:39,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 35 transitions, 144 flow [2022-12-13 13:20:39,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 35 transitions, 140 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 13:20:39,629 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 54 flow [2022-12-13 13:20:39,630 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-13 13:20:39,633 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-13 13:20:39,633 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 54 flow [2022-12-13 13:20:39,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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 13:20:39,633 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:39,634 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:20:39,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:20:39,634 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:20:39,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:39,634 INFO L85 PathProgramCache]: Analyzing trace with hash -443841598, now seen corresponding path program 1 times [2022-12-13 13:20:39,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:39,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688120356] [2022-12-13 13:20:39,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:39,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:39,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:40,017 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 13:20:40,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:40,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688120356] [2022-12-13 13:20:40,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688120356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:40,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:40,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:20:40,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446426861] [2022-12-13 13:20:40,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:40,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:20:40,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:40,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:20:40,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:20:40,076 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 219 [2022-12-13 13:20:40,077 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 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 13:20:40,077 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:20:40,077 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 219 [2022-12-13 13:20:40,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:20:40,268 INFO L130 PetriNetUnfolder]: 991/1481 cut-off events. [2022-12-13 13:20:40,268 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2022-12-13 13:20:40,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3111 conditions, 1481 events. 991/1481 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6029 event pairs, 335 based on Foata normal form. 40/1520 useless extension candidates. Maximal degree in co-relation 3101. Up to 1037 conditions per place. [2022-12-13 13:20:40,273 INFO L137 encePairwiseOnDemand]: 216/219 looper letters, 28 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2022-12-13 13:20:40,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 31 transitions, 134 flow [2022-12-13 13:20:40,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:20:40,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:20:40,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 313 transitions. [2022-12-13 13:20:40,276 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4764079147640791 [2022-12-13 13:20:40,276 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 313 transitions. [2022-12-13 13:20:40,276 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 313 transitions. [2022-12-13 13:20:40,277 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:40,277 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 313 transitions. [2022-12-13 13:20:40,278 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 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 13:20:40,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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 13:20:40,280 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 0 states have call successors, (0), 0 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 13:20:40,281 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 54 flow. Second operand 3 states and 313 transitions. [2022-12-13 13:20:40,281 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 31 transitions, 134 flow [2022-12-13 13:20:40,282 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 31 transitions, 128 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:20:40,282 INFO L231 Difference]: Finished difference. Result has 32 places, 22 transitions, 58 flow [2022-12-13 13:20:40,282 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=32, PETRI_TRANSITIONS=22} [2022-12-13 13:20:40,283 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, -2 predicate places. [2022-12-13 13:20:40,283 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 22 transitions, 58 flow [2022-12-13 13:20:40,283 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 96.25) internal successors, (385), 4 states have internal predecessors, (385), 0 states have call successors, (0), 0 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 13:20:40,283 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:40,283 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:20:40,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:20:40,284 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:20:40,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:40,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1331731491, now seen corresponding path program 1 times [2022-12-13 13:20:40,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:40,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381319859] [2022-12-13 13:20:40,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:40,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:40,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:40,825 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 13:20:40,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:40,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381319859] [2022-12-13 13:20:40,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381319859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:40,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:40,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:20:40,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301041996] [2022-12-13 13:20:40,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:40,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:20:40,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:40,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:20:40,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:20:40,872 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2022-12-13 13:20:40,873 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 22 transitions, 58 flow. Second operand has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:20:40,873 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:20:40,873 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2022-12-13 13:20:40,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:20:41,211 INFO L130 PetriNetUnfolder]: 1287/1906 cut-off events. [2022-12-13 13:20:41,211 INFO L131 PetriNetUnfolder]: For 123/123 co-relation queries the response was YES. [2022-12-13 13:20:41,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4127 conditions, 1906 events. 1287/1906 cut-off events. For 123/123 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 7868 event pairs, 457 based on Foata normal form. 6/1912 useless extension candidates. Maximal degree in co-relation 4116. Up to 1796 conditions per place. [2022-12-13 13:20:41,217 INFO L137 encePairwiseOnDemand]: 210/219 looper letters, 43 selfloop transitions, 15 changer transitions 0/58 dead transitions. [2022-12-13 13:20:41,217 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 58 transitions, 263 flow [2022-12-13 13:20:41,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:20:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:20:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 525 transitions. [2022-12-13 13:20:41,219 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4794520547945205 [2022-12-13 13:20:41,219 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 525 transitions. [2022-12-13 13:20:41,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 525 transitions. [2022-12-13 13:20:41,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:41,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 525 transitions. [2022-12-13 13:20:41,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.0) internal successors, (525), 5 states have internal predecessors, (525), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:20:41,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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 13:20:41,222 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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 13:20:41,222 INFO L175 Difference]: Start difference. First operand has 32 places, 22 transitions, 58 flow. Second operand 5 states and 525 transitions. [2022-12-13 13:20:41,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 58 transitions, 263 flow [2022-12-13 13:20:41,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 58 transitions, 253 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:20:41,224 INFO L231 Difference]: Finished difference. Result has 36 places, 36 transitions, 145 flow [2022-12-13 13:20:41,224 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=145, PETRI_PLACES=36, PETRI_TRANSITIONS=36} [2022-12-13 13:20:41,224 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 2 predicate places. [2022-12-13 13:20:41,224 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 36 transitions, 145 flow [2022-12-13 13:20:41,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.2) internal successors, (476), 5 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:20:41,225 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:41,225 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:20:41,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:20:41,225 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:20:41,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:41,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1663160266, now seen corresponding path program 1 times [2022-12-13 13:20:41,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:41,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254562490] [2022-12-13 13:20:41,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:41,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:41,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:41,835 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 13:20:41,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:41,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254562490] [2022-12-13 13:20:41,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254562490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:41,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:41,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:20:41,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751184084] [2022-12-13 13:20:41,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:41,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:20:41,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:41,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:20:41,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:20:41,890 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2022-12-13 13:20:41,891 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 36 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 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 13:20:41,891 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:20:41,891 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2022-12-13 13:20:41,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:20:42,261 INFO L130 PetriNetUnfolder]: 1391/2054 cut-off events. [2022-12-13 13:20:42,261 INFO L131 PetriNetUnfolder]: For 1008/1008 co-relation queries the response was YES. [2022-12-13 13:20:42,263 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5526 conditions, 2054 events. 1391/2054 cut-off events. For 1008/1008 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 8467 event pairs, 476 based on Foata normal form. 12/2066 useless extension candidates. Maximal degree in co-relation 5513. Up to 1753 conditions per place. [2022-12-13 13:20:42,269 INFO L137 encePairwiseOnDemand]: 209/219 looper letters, 65 selfloop transitions, 22 changer transitions 0/87 dead transitions. [2022-12-13 13:20:42,269 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 87 transitions, 488 flow [2022-12-13 13:20:42,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:20:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:20:42,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 713 transitions. [2022-12-13 13:20:42,271 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46510110893672535 [2022-12-13 13:20:42,271 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 713 transitions. [2022-12-13 13:20:42,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 713 transitions. [2022-12-13 13:20:42,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:42,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 713 transitions. [2022-12-13 13:20:42,273 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 101.85714285714286) internal successors, (713), 7 states have internal predecessors, (713), 0 states have call successors, (0), 0 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 13:20:42,275 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 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 13:20:42,275 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 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 13:20:42,275 INFO L175 Difference]: Start difference. First operand has 36 places, 36 transitions, 145 flow. Second operand 7 states and 713 transitions. [2022-12-13 13:20:42,275 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 87 transitions, 488 flow [2022-12-13 13:20:42,278 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 87 transitions, 488 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 13:20:42,279 INFO L231 Difference]: Finished difference. Result has 46 places, 53 transitions, 307 flow [2022-12-13 13:20:42,279 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=307, PETRI_PLACES=46, PETRI_TRANSITIONS=53} [2022-12-13 13:20:42,280 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 12 predicate places. [2022-12-13 13:20:42,280 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 53 transitions, 307 flow [2022-12-13 13:20:42,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 0 states have call successors, (0), 0 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 13:20:42,280 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:42,280 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:20:42,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:20:42,280 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:20:42,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:42,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1666046986, now seen corresponding path program 2 times [2022-12-13 13:20:42,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:42,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502333843] [2022-12-13 13:20:42,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:42,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:42,587 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 13:20:42,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:42,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502333843] [2022-12-13 13:20:42,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502333843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:42,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:42,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:20:42,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231596060] [2022-12-13 13:20:42,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:42,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:20:42,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:42,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:20:42,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:20:42,611 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 219 [2022-12-13 13:20:42,612 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 53 transitions, 307 flow. Second operand has 5 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 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 13:20:42,612 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:20:42,612 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 219 [2022-12-13 13:20:42,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:20:42,908 INFO L130 PetriNetUnfolder]: 1047/1664 cut-off events. [2022-12-13 13:20:42,908 INFO L131 PetriNetUnfolder]: For 3092/3280 co-relation queries the response was YES. [2022-12-13 13:20:42,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5522 conditions, 1664 events. 1047/1664 cut-off events. For 3092/3280 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 7939 event pairs, 351 based on Foata normal form. 76/1666 useless extension candidates. Maximal degree in co-relation 5503. Up to 1315 conditions per place. [2022-12-13 13:20:42,916 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 49 selfloop transitions, 15 changer transitions 0/73 dead transitions. [2022-12-13 13:20:42,916 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 73 transitions, 501 flow [2022-12-13 13:20:42,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:20:42,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:20:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 447 transitions. [2022-12-13 13:20:42,917 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5102739726027398 [2022-12-13 13:20:42,918 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 447 transitions. [2022-12-13 13:20:42,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 447 transitions. [2022-12-13 13:20:42,918 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:42,918 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 447 transitions. [2022-12-13 13:20:42,919 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 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 13:20:42,920 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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 13:20:42,920 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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 13:20:42,920 INFO L175 Difference]: Start difference. First operand has 46 places, 53 transitions, 307 flow. Second operand 4 states and 447 transitions. [2022-12-13 13:20:42,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 73 transitions, 501 flow [2022-12-13 13:20:42,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 73 transitions, 491 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-12-13 13:20:42,925 INFO L231 Difference]: Finished difference. Result has 50 places, 58 transitions, 384 flow [2022-12-13 13:20:42,925 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=384, PETRI_PLACES=50, PETRI_TRANSITIONS=58} [2022-12-13 13:20:42,926 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 16 predicate places. [2022-12-13 13:20:42,926 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 58 transitions, 384 flow [2022-12-13 13:20:42,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 103.2) internal successors, (516), 5 states have internal predecessors, (516), 0 states have call successors, (0), 0 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 13:20:42,926 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:42,926 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:20:42,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:20:42,926 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:20:42,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:42,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1588562462, now seen corresponding path program 1 times [2022-12-13 13:20:42,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:42,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207442230] [2022-12-13 13:20:42,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:42,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:42,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:43,254 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 13:20:43,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:43,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207442230] [2022-12-13 13:20:43,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207442230] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:43,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:43,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:20:43,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982579311] [2022-12-13 13:20:43,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:43,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:20:43,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:43,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:20:43,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:20:43,286 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 219 [2022-12-13 13:20:43,286 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 58 transitions, 384 flow. Second operand has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 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 13:20:43,286 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:20:43,287 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 219 [2022-12-13 13:20:43,287 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:20:43,572 INFO L130 PetriNetUnfolder]: 997/1609 cut-off events. [2022-12-13 13:20:43,572 INFO L131 PetriNetUnfolder]: For 4403/4584 co-relation queries the response was YES. [2022-12-13 13:20:43,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5903 conditions, 1609 events. 997/1609 cut-off events. For 4403/4584 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7758 event pairs, 265 based on Foata normal form. 35/1586 useless extension candidates. Maximal degree in co-relation 5881. Up to 1188 conditions per place. [2022-12-13 13:20:43,580 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 55 selfloop transitions, 11 changer transitions 0/75 dead transitions. [2022-12-13 13:20:43,580 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 75 transitions, 570 flow [2022-12-13 13:20:43,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:20:43,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:20:43,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 449 transitions. [2022-12-13 13:20:43,582 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5125570776255708 [2022-12-13 13:20:43,582 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 449 transitions. [2022-12-13 13:20:43,582 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 449 transitions. [2022-12-13 13:20:43,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:43,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 449 transitions. [2022-12-13 13:20:43,583 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.25) internal successors, (449), 4 states have internal predecessors, (449), 0 states have call successors, (0), 0 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 13:20:43,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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 13:20:43,584 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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 13:20:43,584 INFO L175 Difference]: Start difference. First operand has 50 places, 58 transitions, 384 flow. Second operand 4 states and 449 transitions. [2022-12-13 13:20:43,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 75 transitions, 570 flow [2022-12-13 13:20:43,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 75 transitions, 559 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 13:20:43,589 INFO L231 Difference]: Finished difference. Result has 53 places, 58 transitions, 403 flow [2022-12-13 13:20:43,589 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=403, PETRI_PLACES=53, PETRI_TRANSITIONS=58} [2022-12-13 13:20:43,590 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 19 predicate places. [2022-12-13 13:20:43,590 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 58 transitions, 403 flow [2022-12-13 13:20:43,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.4) internal successors, (522), 5 states have internal predecessors, (522), 0 states have call successors, (0), 0 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 13:20:43,590 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:43,590 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:20:43,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:20:43,591 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:20:43,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:43,591 INFO L85 PathProgramCache]: Analyzing trace with hash -2002046889, now seen corresponding path program 1 times [2022-12-13 13:20:43,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:43,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975198058] [2022-12-13 13:20:43,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:43,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:43,884 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 13:20:43,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:43,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975198058] [2022-12-13 13:20:43,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975198058] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:43,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:43,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:20:43,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320168779] [2022-12-13 13:20:43,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:43,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:20:43,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:43,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:20:43,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:20:43,903 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 219 [2022-12-13 13:20:43,904 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 58 transitions, 403 flow. Second operand has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:20:43,904 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:20:43,904 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 219 [2022-12-13 13:20:43,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:20:44,212 INFO L130 PetriNetUnfolder]: 1068/1708 cut-off events. [2022-12-13 13:20:44,213 INFO L131 PetriNetUnfolder]: For 5148/5366 co-relation queries the response was YES. [2022-12-13 13:20:44,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6474 conditions, 1708 events. 1068/1708 cut-off events. For 5148/5366 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8266 event pairs, 286 based on Foata normal form. 33/1685 useless extension candidates. Maximal degree in co-relation 6450. Up to 1233 conditions per place. [2022-12-13 13:20:44,220 INFO L137 encePairwiseOnDemand]: 211/219 looper letters, 55 selfloop transitions, 24 changer transitions 0/88 dead transitions. [2022-12-13 13:20:44,221 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 88 transitions, 682 flow [2022-12-13 13:20:44,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:20:44,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:20:44,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2022-12-13 13:20:44,222 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5031963470319635 [2022-12-13 13:20:44,222 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2022-12-13 13:20:44,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2022-12-13 13:20:44,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:44,223 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2022-12-13 13:20:44,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 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 13:20:44,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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 13:20:44,225 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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 13:20:44,225 INFO L175 Difference]: Start difference. First operand has 53 places, 58 transitions, 403 flow. Second operand 5 states and 551 transitions. [2022-12-13 13:20:44,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 88 transitions, 682 flow [2022-12-13 13:20:44,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 88 transitions, 661 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 13:20:44,230 INFO L231 Difference]: Finished difference. Result has 57 places, 65 transitions, 513 flow [2022-12-13 13:20:44,230 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=513, PETRI_PLACES=57, PETRI_TRANSITIONS=65} [2022-12-13 13:20:44,230 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 23 predicate places. [2022-12-13 13:20:44,230 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 65 transitions, 513 flow [2022-12-13 13:20:44,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:20:44,231 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:44,231 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:20:44,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:20:44,231 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:20:44,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:44,231 INFO L85 PathProgramCache]: Analyzing trace with hash 849953797, now seen corresponding path program 2 times [2022-12-13 13:20:44,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:44,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818767415] [2022-12-13 13:20:44,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:44,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:44,492 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 13:20:44,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:44,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818767415] [2022-12-13 13:20:44,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818767415] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:44,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:44,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:20:44,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721735111] [2022-12-13 13:20:44,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:44,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:20:44,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:44,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:20:44,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:20:44,517 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 219 [2022-12-13 13:20:44,518 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 65 transitions, 513 flow. Second operand has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:20:44,518 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:20:44,518 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 219 [2022-12-13 13:20:44,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:20:44,863 INFO L130 PetriNetUnfolder]: 1084/1742 cut-off events. [2022-12-13 13:20:44,864 INFO L131 PetriNetUnfolder]: For 7806/8063 co-relation queries the response was YES. [2022-12-13 13:20:44,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7511 conditions, 1742 events. 1084/1742 cut-off events. For 7806/8063 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 8579 event pairs, 284 based on Foata normal form. 30/1706 useless extension candidates. Maximal degree in co-relation 7485. Up to 1254 conditions per place. [2022-12-13 13:20:44,871 INFO L137 encePairwiseOnDemand]: 211/219 looper letters, 59 selfloop transitions, 29 changer transitions 0/97 dead transitions. [2022-12-13 13:20:44,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 97 transitions, 862 flow [2022-12-13 13:20:44,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:20:44,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:20:44,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 551 transitions. [2022-12-13 13:20:44,873 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5031963470319635 [2022-12-13 13:20:44,873 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 551 transitions. [2022-12-13 13:20:44,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 551 transitions. [2022-12-13 13:20:44,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:44,873 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 551 transitions. [2022-12-13 13:20:44,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 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 13:20:44,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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 13:20:44,875 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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 13:20:44,875 INFO L175 Difference]: Start difference. First operand has 57 places, 65 transitions, 513 flow. Second operand 5 states and 551 transitions. [2022-12-13 13:20:44,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 97 transitions, 862 flow [2022-12-13 13:20:44,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 97 transitions, 838 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 13:20:44,884 INFO L231 Difference]: Finished difference. Result has 62 places, 75 transitions, 690 flow [2022-12-13 13:20:44,884 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=497, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=690, PETRI_PLACES=62, PETRI_TRANSITIONS=75} [2022-12-13 13:20:44,884 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 28 predicate places. [2022-12-13 13:20:44,884 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 75 transitions, 690 flow [2022-12-13 13:20:44,885 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 102.16666666666667) internal successors, (613), 6 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:20:44,885 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:44,885 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:20:44,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:20:44,885 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:20:44,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:44,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1898629959, now seen corresponding path program 3 times [2022-12-13 13:20:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:44,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680941881] [2022-12-13 13:20:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:44,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:45,160 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 13:20:45,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:45,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680941881] [2022-12-13 13:20:45,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680941881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:45,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:45,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:20:45,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166877027] [2022-12-13 13:20:45,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:45,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:20:45,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:45,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:20:45,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:20:45,179 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 219 [2022-12-13 13:20:45,180 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 75 transitions, 690 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 13:20:45,180 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:20:45,180 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 219 [2022-12-13 13:20:45,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:20:45,556 INFO L130 PetriNetUnfolder]: 1222/1983 cut-off events. [2022-12-13 13:20:45,556 INFO L131 PetriNetUnfolder]: For 13842/14185 co-relation queries the response was YES. [2022-12-13 13:20:45,559 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9424 conditions, 1983 events. 1222/1983 cut-off events. For 13842/14185 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 10213 event pairs, 243 based on Foata normal form. 111/2020 useless extension candidates. Maximal degree in co-relation 9395. Up to 1196 conditions per place. [2022-12-13 13:20:45,565 INFO L137 encePairwiseOnDemand]: 212/219 looper letters, 62 selfloop transitions, 32 changer transitions 0/103 dead transitions. [2022-12-13 13:20:45,565 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 103 transitions, 1018 flow [2022-12-13 13:20:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:20:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:20:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 646 transitions. [2022-12-13 13:20:45,567 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4916286149162861 [2022-12-13 13:20:45,567 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 646 transitions. [2022-12-13 13:20:45,567 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 646 transitions. [2022-12-13 13:20:45,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:45,567 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 646 transitions. [2022-12-13 13:20:45,568 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 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 13:20:45,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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 13:20:45,571 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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 13:20:45,571 INFO L175 Difference]: Start difference. First operand has 62 places, 75 transitions, 690 flow. Second operand 6 states and 646 transitions. [2022-12-13 13:20:45,571 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 103 transitions, 1018 flow [2022-12-13 13:20:45,584 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 103 transitions, 979 flow, removed 12 selfloop flow, removed 1 redundant places. [2022-12-13 13:20:45,586 INFO L231 Difference]: Finished difference. Result has 67 places, 78 transitions, 786 flow [2022-12-13 13:20:45,586 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=786, PETRI_PLACES=67, PETRI_TRANSITIONS=78} [2022-12-13 13:20:45,587 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 33 predicate places. [2022-12-13 13:20:45,587 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 78 transitions, 786 flow [2022-12-13 13:20:45,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 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 13:20:45,588 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:45,588 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:20:45,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:20:45,588 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:20:45,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:45,588 INFO L85 PathProgramCache]: Analyzing trace with hash 2083467805, now seen corresponding path program 1 times [2022-12-13 13:20:45,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:45,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910117834] [2022-12-13 13:20:45,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:45,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:45,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:45,711 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 13:20:45,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:45,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910117834] [2022-12-13 13:20:45,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910117834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:45,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:45,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:20:45,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264399710] [2022-12-13 13:20:45,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:45,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:20:45,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:45,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:20:45,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:20:45,718 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 219 [2022-12-13 13:20:45,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 78 transitions, 786 flow. Second operand has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 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 13:20:45,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:20:45,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 219 [2022-12-13 13:20:45,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:20:46,122 INFO L130 PetriNetUnfolder]: 1741/2818 cut-off events. [2022-12-13 13:20:46,122 INFO L131 PetriNetUnfolder]: For 26718/27122 co-relation queries the response was YES. [2022-12-13 13:20:46,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14368 conditions, 2818 events. 1741/2818 cut-off events. For 26718/27122 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 15783 event pairs, 291 based on Foata normal form. 161/2915 useless extension candidates. Maximal degree in co-relation 14337. Up to 1215 conditions per place. [2022-12-13 13:20:46,132 INFO L137 encePairwiseOnDemand]: 216/219 looper letters, 108 selfloop transitions, 2 changer transitions 17/141 dead transitions. [2022-12-13 13:20:46,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 141 transitions, 1672 flow [2022-12-13 13:20:46,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:20:46,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:20:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions. [2022-12-13 13:20:46,134 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 13:20:46,134 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 438 transitions. [2022-12-13 13:20:46,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 438 transitions. [2022-12-13 13:20:46,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:46,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 438 transitions. [2022-12-13 13:20:46,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 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 13:20:46,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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 13:20:46,136 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 0 states have call successors, (0), 0 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 13:20:46,136 INFO L175 Difference]: Start difference. First operand has 67 places, 78 transitions, 786 flow. Second operand 4 states and 438 transitions. [2022-12-13 13:20:46,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 141 transitions, 1672 flow [2022-12-13 13:20:46,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 141 transitions, 1596 flow, removed 22 selfloop flow, removed 4 redundant places. [2022-12-13 13:20:46,154 INFO L231 Difference]: Finished difference. Result has 68 places, 79 transitions, 761 flow [2022-12-13 13:20:46,154 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=761, PETRI_PLACES=68, PETRI_TRANSITIONS=79} [2022-12-13 13:20:46,154 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 34 predicate places. [2022-12-13 13:20:46,154 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 79 transitions, 761 flow [2022-12-13 13:20:46,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 103.25) internal successors, (413), 4 states have internal predecessors, (413), 0 states have call successors, (0), 0 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 13:20:46,154 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:46,154 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:20:46,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:20:46,155 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:20:46,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:46,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1792060937, now seen corresponding path program 2 times [2022-12-13 13:20:46,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:46,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725368909] [2022-12-13 13:20:46,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:46,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:46,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:46,231 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 13:20:46,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:46,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725368909] [2022-12-13 13:20:46,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725368909] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:46,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:46,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:20:46,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402484517] [2022-12-13 13:20:46,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:46,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:20:46,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:46,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:20:46,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:20:46,243 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 219 [2022-12-13 13:20:46,244 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 79 transitions, 761 flow. Second operand has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 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 13:20:46,244 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:20:46,244 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 219 [2022-12-13 13:20:46,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:20:46,567 INFO L130 PetriNetUnfolder]: 1223/2060 cut-off events. [2022-12-13 13:20:46,567 INFO L131 PetriNetUnfolder]: For 19060/19484 co-relation queries the response was YES. [2022-12-13 13:20:46,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10414 conditions, 2060 events. 1223/2060 cut-off events. For 19060/19484 co-relation queries the response was YES. Maximal size of possible extension queue 182. Compared 12049 event pairs, 190 based on Foata normal form. 379/2327 useless extension candidates. Maximal degree in co-relation 10383. Up to 1052 conditions per place. [2022-12-13 13:20:46,574 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 86 selfloop transitions, 8 changer transitions 34/144 dead transitions. [2022-12-13 13:20:46,574 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 144 transitions, 1660 flow [2022-12-13 13:20:46,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:20:46,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:20:46,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 532 transitions. [2022-12-13 13:20:46,576 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4858447488584475 [2022-12-13 13:20:46,576 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 532 transitions. [2022-12-13 13:20:46,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 532 transitions. [2022-12-13 13:20:46,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:46,577 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 532 transitions. [2022-12-13 13:20:46,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 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 13:20:46,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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 13:20:46,580 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 0 states have call successors, (0), 0 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 13:20:46,580 INFO L175 Difference]: Start difference. First operand has 68 places, 79 transitions, 761 flow. Second operand 5 states and 532 transitions. [2022-12-13 13:20:46,580 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 144 transitions, 1660 flow [2022-12-13 13:20:46,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 144 transitions, 1646 flow, removed 5 selfloop flow, removed 1 redundant places. [2022-12-13 13:20:46,595 INFO L231 Difference]: Finished difference. Result has 74 places, 71 transitions, 692 flow [2022-12-13 13:20:46,596 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=692, PETRI_PLACES=74, PETRI_TRANSITIONS=71} [2022-12-13 13:20:46,596 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 40 predicate places. [2022-12-13 13:20:46,596 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 71 transitions, 692 flow [2022-12-13 13:20:46,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 0 states have call successors, (0), 0 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 13:20:46,597 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:46,597 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:20:46,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:20:46,597 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:20:46,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:46,597 INFO L85 PathProgramCache]: Analyzing trace with hash 364409890, now seen corresponding path program 1 times [2022-12-13 13:20:46,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:46,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032453748] [2022-12-13 13:20:46,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:46,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:46,706 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 13:20:46,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:46,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032453748] [2022-12-13 13:20:46,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032453748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:46,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:46,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:20:46,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705041262] [2022-12-13 13:20:46,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:46,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:20:46,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:46,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:20:46,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:20:46,721 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 219 [2022-12-13 13:20:46,721 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 71 transitions, 692 flow. Second operand has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:20:46,721 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:20:46,721 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 219 [2022-12-13 13:20:46,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:20:47,018 INFO L130 PetriNetUnfolder]: 912/1586 cut-off events. [2022-12-13 13:20:47,018 INFO L131 PetriNetUnfolder]: For 15765/16151 co-relation queries the response was YES. [2022-12-13 13:20:47,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8700 conditions, 1586 events. 912/1586 cut-off events. For 15765/16151 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 9212 event pairs, 77 based on Foata normal form. 247/1764 useless extension candidates. Maximal degree in co-relation 8665. Up to 626 conditions per place. [2022-12-13 13:20:47,023 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 85 selfloop transitions, 14 changer transitions 38/152 dead transitions. [2022-12-13 13:20:47,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 152 transitions, 1750 flow [2022-12-13 13:20:47,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 13:20:47,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 13:20:47,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 745 transitions. [2022-12-13 13:20:47,025 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48597521200260924 [2022-12-13 13:20:47,025 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 745 transitions. [2022-12-13 13:20:47,025 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 745 transitions. [2022-12-13 13:20:47,026 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:47,026 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 745 transitions. [2022-12-13 13:20:47,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 106.42857142857143) internal successors, (745), 7 states have internal predecessors, (745), 0 states have call successors, (0), 0 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 13:20:47,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 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 13:20:47,028 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 0 states have call successors, (0), 0 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 13:20:47,028 INFO L175 Difference]: Start difference. First operand has 74 places, 71 transitions, 692 flow. Second operand 7 states and 745 transitions. [2022-12-13 13:20:47,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 152 transitions, 1750 flow [2022-12-13 13:20:47,043 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 152 transitions, 1558 flow, removed 30 selfloop flow, removed 7 redundant places. [2022-12-13 13:20:47,045 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 611 flow [2022-12-13 13:20:47,045 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=611, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2022-12-13 13:20:47,045 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 42 predicate places. [2022-12-13 13:20:47,045 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 611 flow [2022-12-13 13:20:47,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 98.6) internal successors, (493), 5 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:20:47,046 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:47,046 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:20:47,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:20:47,046 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:20:47,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:47,046 INFO L85 PathProgramCache]: Analyzing trace with hash -994585125, now seen corresponding path program 1 times [2022-12-13 13:20:47,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:47,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483962121] [2022-12-13 13:20:47,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:47,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:47,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:47,179 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 13:20:47,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:47,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483962121] [2022-12-13 13:20:47,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483962121] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:47,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:47,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:20:47,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965398786] [2022-12-13 13:20:47,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:47,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:20:47,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:47,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:20:47,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:20:47,195 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 219 [2022-12-13 13:20:47,196 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 611 flow. Second operand has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 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 13:20:47,196 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:20:47,196 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 219 [2022-12-13 13:20:47,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:20:47,512 INFO L130 PetriNetUnfolder]: 851/1488 cut-off events. [2022-12-13 13:20:47,512 INFO L131 PetriNetUnfolder]: For 11529/11927 co-relation queries the response was YES. [2022-12-13 13:20:47,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8230 conditions, 1488 events. 851/1488 cut-off events. For 11529/11927 co-relation queries the response was YES. Maximal size of possible extension queue 150. Compared 8664 event pairs, 65 based on Foata normal form. 153/1577 useless extension candidates. Maximal degree in co-relation 8195. Up to 612 conditions per place. [2022-12-13 13:20:47,517 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 67 selfloop transitions, 17 changer transitions 61/152 dead transitions. [2022-12-13 13:20:47,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 152 transitions, 1625 flow [2022-12-13 13:20:47,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:20:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:20:47,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 937 transitions. [2022-12-13 13:20:47,519 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47539320142059865 [2022-12-13 13:20:47,519 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 937 transitions. [2022-12-13 13:20:47,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 937 transitions. [2022-12-13 13:20:47,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:47,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 937 transitions. [2022-12-13 13:20:47,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 104.11111111111111) internal successors, (937), 9 states have internal predecessors, (937), 0 states have call successors, (0), 0 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 13:20:47,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 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 13:20:47,522 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 0 states have call successors, (0), 0 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 13:20:47,522 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 611 flow. Second operand 9 states and 937 transitions. [2022-12-13 13:20:47,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 152 transitions, 1625 flow [2022-12-13 13:20:47,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 152 transitions, 1534 flow, removed 31 selfloop flow, removed 4 redundant places. [2022-12-13 13:20:47,539 INFO L231 Difference]: Finished difference. Result has 83 places, 53 transitions, 465 flow [2022-12-13 13:20:47,539 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=465, PETRI_PLACES=83, PETRI_TRANSITIONS=53} [2022-12-13 13:20:47,540 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 49 predicate places. [2022-12-13 13:20:47,540 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 53 transitions, 465 flow [2022-12-13 13:20:47,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.5) internal successors, (591), 6 states have internal predecessors, (591), 0 states have call successors, (0), 0 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 13:20:47,540 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:47,540 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:20:47,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:20:47,540 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:20:47,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1470116420, now seen corresponding path program 1 times [2022-12-13 13:20:47,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:47,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503515131] [2022-12-13 13:20:47,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:47,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:47,820 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 13:20:47,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:47,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503515131] [2022-12-13 13:20:47,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503515131] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:47,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:47,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:20:47,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847474128] [2022-12-13 13:20:47,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:47,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:20:47,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:47,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:20:47,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:20:47,861 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 219 [2022-12-13 13:20:47,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 53 transitions, 465 flow. Second operand has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 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 13:20:47,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:20:47,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 219 [2022-12-13 13:20:47,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:20:48,159 INFO L130 PetriNetUnfolder]: 758/1363 cut-off events. [2022-12-13 13:20:48,159 INFO L131 PetriNetUnfolder]: For 7213/7253 co-relation queries the response was YES. [2022-12-13 13:20:48,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7194 conditions, 1363 events. 758/1363 cut-off events. For 7213/7253 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 7297 event pairs, 155 based on Foata normal form. 35/1396 useless extension candidates. Maximal degree in co-relation 7164. Up to 814 conditions per place. [2022-12-13 13:20:48,163 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 42 selfloop transitions, 3 changer transitions 71/118 dead transitions. [2022-12-13 13:20:48,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 118 transitions, 1213 flow [2022-12-13 13:20:48,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:20:48,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:20:48,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 610 transitions. [2022-12-13 13:20:48,165 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4642313546423135 [2022-12-13 13:20:48,165 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 610 transitions. [2022-12-13 13:20:48,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 610 transitions. [2022-12-13 13:20:48,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:20:48,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 610 transitions. [2022-12-13 13:20:48,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 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 13:20:48,167 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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 13:20:48,167 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 0 states have call successors, (0), 0 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 13:20:48,167 INFO L175 Difference]: Start difference. First operand has 83 places, 53 transitions, 465 flow. Second operand 6 states and 610 transitions. [2022-12-13 13:20:48,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 118 transitions, 1213 flow [2022-12-13 13:20:48,180 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 118 transitions, 1025 flow, removed 36 selfloop flow, removed 14 redundant places. [2022-12-13 13:20:48,181 INFO L231 Difference]: Finished difference. Result has 72 places, 37 transitions, 256 flow [2022-12-13 13:20:48,181 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=256, PETRI_PLACES=72, PETRI_TRANSITIONS=37} [2022-12-13 13:20:48,181 INFO L288 CegarLoopForPetriNet]: 34 programPoint places, 38 predicate places. [2022-12-13 13:20:48,181 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 37 transitions, 256 flow [2022-12-13 13:20:48,182 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 96.2) internal successors, (481), 5 states have internal predecessors, (481), 0 states have call successors, (0), 0 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 13:20:48,182 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:48,182 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:20:48,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:20:48,182 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-12-13 13:20:48,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:48,182 INFO L85 PathProgramCache]: Analyzing trace with hash -838662268, now seen corresponding path program 2 times [2022-12-13 13:20:48,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:48,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539925518] [2022-12-13 13:20:48,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:48,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:48,206 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:20:48,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:20:48,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:20:48,260 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 13:20:48,260 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-12-13 13:20:48,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-12-13 13:20:48,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-12-13 13:20:48,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-12-13 13:20:48,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-12-13 13:20:48,262 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-12-13 13:20:48,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:20:48,262 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-12-13 13:20:48,268 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:20:48,268 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:20:48,320 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:20:48 BasicIcfg [2022-12-13 13:20:48,321 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:20:48,321 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:20:48,321 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:20:48,321 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:20:48,322 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:20:35" (3/4) ... [2022-12-13 13:20:48,324 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 13:20:48,391 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b940c-132d-4db8-8072-ef542bf64f65/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:20:48,391 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:20:48,391 INFO L158 Benchmark]: Toolchain (without parser) took 14058.12ms. Allocated memory was 136.3MB in the beginning and 343.9MB in the end (delta: 207.6MB). Free memory was 102.6MB in the beginning and 188.9MB in the end (delta: -86.3MB). Peak memory consumption was 122.1MB. Max. memory is 16.1GB. [2022-12-13 13:20:48,391 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:20:48,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 366.72ms. Allocated memory is still 136.3MB. Free memory was 102.4MB in the beginning and 75.5MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 13:20:48,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.51ms. Allocated memory is still 136.3MB. Free memory was 75.5MB in the beginning and 73.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:20:48,392 INFO L158 Benchmark]: Boogie Preprocessor took 21.14ms. Allocated memory is still 136.3MB. Free memory was 73.0MB in the beginning and 71.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:20:48,393 INFO L158 Benchmark]: RCFGBuilder took 542.68ms. Allocated memory is still 136.3MB. Free memory was 71.3MB in the beginning and 75.2MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-12-13 13:20:48,393 INFO L158 Benchmark]: TraceAbstraction took 13017.08ms. Allocated memory was 136.3MB in the beginning and 343.9MB in the end (delta: 207.6MB). Free memory was 74.3MB in the beginning and 199.4MB in the end (delta: -125.1MB). Peak memory consumption was 85.3MB. Max. memory is 16.1GB. [2022-12-13 13:20:48,393 INFO L158 Benchmark]: Witness Printer took 69.70ms. Allocated memory is still 343.9MB. Free memory was 199.4MB in the beginning and 188.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 13:20:48,395 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.15ms. Allocated memory is still 104.9MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 366.72ms. Allocated memory is still 136.3MB. Free memory was 102.4MB in the beginning and 75.5MB in the end (delta: 26.9MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.51ms. Allocated memory is still 136.3MB. Free memory was 75.5MB in the beginning and 73.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.14ms. Allocated memory is still 136.3MB. Free memory was 73.0MB in the beginning and 71.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 542.68ms. Allocated memory is still 136.3MB. Free memory was 71.3MB in the beginning and 75.2MB in the end (delta: -3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13017.08ms. Allocated memory was 136.3MB in the beginning and 343.9MB in the end (delta: 207.6MB). Free memory was 74.3MB in the beginning and 199.4MB in the end (delta: -125.1MB). Peak memory consumption was 85.3MB. Max. memory is 16.1GB. * Witness Printer took 69.70ms. Allocated memory is still 343.9MB. Free memory was 199.4MB in the beginning and 188.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.5s, 122 PlacesBefore, 34 PlacesAfterwards, 114 TransitionsBefore, 24 TransitionsAfterwards, 2178 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 2 ChoiceCompositions, 102 TotalNumberOfCompositions, 6120 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3078, independent: 2875, independent conditional: 0, independent unconditional: 2875, dependent: 203, dependent conditional: 0, dependent unconditional: 203, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1202, independent: 1150, independent conditional: 0, independent unconditional: 1150, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3078, independent: 1725, independent conditional: 0, independent unconditional: 1725, dependent: 151, dependent conditional: 0, dependent unconditional: 151, unknown: 1202, unknown conditional: 0, unknown unconditional: 1202] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 71, Positive conditional cache size: 0, Positive unconditional cache size: 71, 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p1_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L715] 0 int __unbuffered_p2_EBX = 0; [L716] 0 _Bool main$tmp_guard0; [L717] 0 _Bool main$tmp_guard1; [L719] 0 int x = 0; [L720] 0 _Bool x$flush_delayed; [L721] 0 int x$mem_tmp; [L722] 0 _Bool x$r_buff0_thd0; [L723] 0 _Bool x$r_buff0_thd1; [L724] 0 _Bool x$r_buff0_thd2; [L725] 0 _Bool x$r_buff0_thd3; [L726] 0 _Bool x$r_buff1_thd0; [L727] 0 _Bool x$r_buff1_thd1; [L728] 0 _Bool x$r_buff1_thd2; [L729] 0 _Bool x$r_buff1_thd3; [L730] 0 _Bool x$read_delayed; [L731] 0 int *x$read_delayed_var; [L732] 0 int x$w_buff0; [L733] 0 _Bool x$w_buff0_used; [L734] 0 int x$w_buff1; [L735] 0 _Bool x$w_buff1_used; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L825] 0 pthread_t t515; [L826] FCALL, FORK 0 pthread_create(&t515, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t515, ((void *)0), P0, ((void *)0))=-2, t515={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L827] 0 pthread_t t516; [L828] FCALL, FORK 0 pthread_create(&t516, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t516, ((void *)0), P1, ((void *)0))=-1, t515={5:0}, t516={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L829] 0 pthread_t t517; [L830] FCALL, FORK 0 pthread_create(&t517, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t517, ((void *)0), P2, ((void *)0))=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$w_buff1 = x$w_buff0 [L766] 2 x$w_buff0 = 2 [L767] 2 x$w_buff1_used = x$w_buff0_used [L768] 2 x$w_buff0_used = (_Bool)1 [L769] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L769] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L770] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L771] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L772] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L773] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L774] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L777] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L794] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L797] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L800] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L745] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L748] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L751] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L752] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L753] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L754] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L755] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L758] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L760] 1 return 0; [L780] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L781] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L782] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L783] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L784] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L803] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L804] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L805] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L806] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L807] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L832] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L834] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L834] RET 0 assume_abort_if_not(main$tmp_guard0) [L836] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L837] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L838] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L839] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L840] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t515={5:0}, t516={6:0}, t517={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L843] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L844] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L845] 0 x$flush_delayed = weak$$choice2 [L846] 0 x$mem_tmp = x [L847] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L848] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L849] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L850] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L851] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L852] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L853] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L854] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L855] 0 x = x$flush_delayed ? x$mem_tmp : x [L856] 0 x$flush_delayed = (_Bool)0 [L858] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 828]: 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: 830]: 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: 826]: 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, 145 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 12.9s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.6s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 644 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 482 mSDsluCounter, 267 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 139 mSDsCounter, 177 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1427 IncrementalHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 177 mSolverCounterUnsat, 128 mSDtfsCounter, 1427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 61 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=786occurred in iteration=9, InterpolantAutomatonStates: 73, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 173 ConstructedInterpolants, 0 QuantifiedInterpolants, 2353 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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 13:20:48,411 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f73b940c-132d-4db8-8072-ef542bf64f65/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