./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix010.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix010.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 15:45:12,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:45:12,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:45:12,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:45:12,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:45:12,927 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:45:12,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:45:12,936 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:45:12,938 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:45:12,944 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:45:12,945 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:45:12,948 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:45:12,948 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:45:12,951 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:45:12,953 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:45:12,955 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:45:12,957 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:45:12,958 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:45:12,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:45:12,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:45:12,970 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:45:12,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:45:12,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:45:12,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:45:12,985 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:45:12,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:45:12,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:45:12,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:45:12,990 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:45:12,991 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:45:12,991 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:45:12,992 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:45:12,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:45:12,995 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:45:12,996 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:45:12,996 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:45:12,997 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:45:12,997 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:45:12,998 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:45:12,999 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:45:13,000 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:45:13,001 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 15:45:13,044 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:45:13,044 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:45:13,045 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:45:13,045 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:45:13,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:45:13,046 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:45:13,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:45:13,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:45:13,048 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:45:13,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:45:13,049 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 15:45:13,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:45:13,050 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 15:45:13,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:45:13,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:45:13,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:45:13,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:45:13,051 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 15:45:13,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:45:13,051 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:45:13,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:45:13,052 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:45:13,052 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:45:13,052 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:45:13,052 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:45:13,053 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:45:13,053 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:45:13,053 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:45:13,054 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:45:13,054 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:45:13,054 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:45:13,055 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:45:13,055 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:45:13,055 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:45:13,055 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_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 371e0ad4620d67bc913500e97f289ec14c56f7c02bd7df3fa28779e14d33459a [2022-11-25 15:45:13,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:45:13,367 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:45:13,370 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:45:13,371 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:45:13,372 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:45:13,373 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/mix010.opt.i [2022-11-25 15:45:16,351 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:45:16,641 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:45:16,650 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/sv-benchmarks/c/pthread-wmm/mix010.opt.i [2022-11-25 15:45:16,665 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R/data/fb4ee6844/ddd70cae5ec140b2bd0a55af9eacbdbe/FLAG9372ae37f [2022-11-25 15:45:16,683 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R/data/fb4ee6844/ddd70cae5ec140b2bd0a55af9eacbdbe [2022-11-25 15:45:16,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:45:16,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:45:16,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:45:16,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:45:16,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:45:16,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:45:16" (1/1) ... [2022-11-25 15:45:16,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72333acc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:16, skipping insertion in model container [2022-11-25 15:45:16,698 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:45:16" (1/1) ... [2022-11-25 15:45:16,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:45:16,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:45:17,029 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_0d9727f9-3732-435c-a4a7-aee1a63fd014/sv-benchmarks/c/pthread-wmm/mix010.opt.i[944,957] [2022-11-25 15:45:17,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,274 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,275 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,284 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,286 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,287 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,289 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,298 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,309 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,314 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,317 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,320 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,321 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,329 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:45:17,357 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:45:17,374 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_0d9727f9-3732-435c-a4a7-aee1a63fd014/sv-benchmarks/c/pthread-wmm/mix010.opt.i[944,957] [2022-11-25 15:45:17,412 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,415 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,416 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,417 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,418 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,419 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,420 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,443 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,445 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,449 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 15:45:17,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 15:45:17,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:45:17,511 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:45:17,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:17 WrapperNode [2022-11-25 15:45:17,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:45:17,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:45:17,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:45:17,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:45:17,521 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:17" (1/1) ... [2022-11-25 15:45:17,556 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:17" (1/1) ... [2022-11-25 15:45:17,584 INFO L138 Inliner]: procedures = 176, calls = 60, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 150 [2022-11-25 15:45:17,585 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:45:17,585 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:45:17,585 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:45:17,586 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:45:17,595 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:17" (1/1) ... [2022-11-25 15:45:17,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:17" (1/1) ... [2022-11-25 15:45:17,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:17" (1/1) ... [2022-11-25 15:45:17,599 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:17" (1/1) ... [2022-11-25 15:45:17,606 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:17" (1/1) ... [2022-11-25 15:45:17,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:17" (1/1) ... [2022-11-25 15:45:17,610 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:17" (1/1) ... [2022-11-25 15:45:17,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:17" (1/1) ... [2022-11-25 15:45:17,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:45:17,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:45:17,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:45:17,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:45:17,617 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:17" (1/1) ... [2022-11-25 15:45:17,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:45:17,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:45:17,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:45:17,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:45:17,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 15:45:17,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 15:45:17,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:45:17,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:45:17,697 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:45:17,697 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 15:45:17,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 15:45:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 15:45:17,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 15:45:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 15:45:17,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 15:45:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:45:17,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 15:45:17,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:45:17,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:45:17,700 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 15:45:17,838 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:45:17,840 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:45:18,284 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:45:18,493 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:45:18,494 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:45:18,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:45:18 BoogieIcfgContainer [2022-11-25 15:45:18,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:45:18,499 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:45:18,499 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:45:18,503 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:45:18,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:45:16" (1/3) ... [2022-11-25 15:45:18,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3f9fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:45:18, skipping insertion in model container [2022-11-25 15:45:18,504 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:45:17" (2/3) ... [2022-11-25 15:45:18,504 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c3f9fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:45:18, skipping insertion in model container [2022-11-25 15:45:18,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:45:18" (3/3) ... [2022-11-25 15:45:18,506 INFO L112 eAbstractionObserver]: Analyzing ICFG mix010.opt.i [2022-11-25 15:45:18,515 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-25 15:45:18,526 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:45:18,527 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-25 15:45:18,527 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 15:45:18,602 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 15:45:18,643 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 255 flow [2022-11-25 15:45:18,694 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2022-11-25 15:45:18,694 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:18,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-25 15:45:18,700 INFO L82 GeneralOperation]: Start removeDead. Operand has 128 places, 120 transitions, 255 flow [2022-11-25 15:45:18,705 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 125 places, 117 transitions, 243 flow [2022-11-25 15:45:18,709 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 15:45:18,724 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 125 places, 117 transitions, 243 flow [2022-11-25 15:45:18,727 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 125 places, 117 transitions, 243 flow [2022-11-25 15:45:18,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 117 transitions, 243 flow [2022-11-25 15:45:18,754 INFO L130 PetriNetUnfolder]: 2/117 cut-off events. [2022-11-25 15:45:18,755 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:18,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 127 conditions, 117 events. 2/117 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 74. Up to 2 conditions per place. [2022-11-25 15:45:18,757 INFO L119 LiptonReduction]: Number of co-enabled transitions 2146 [2022-11-25 15:45:23,900 INFO L134 LiptonReduction]: Checked pairs total: 5237 [2022-11-25 15:45:23,907 INFO L136 LiptonReduction]: Total number of compositions: 109 [2022-11-25 15:45:23,932 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:45:23,940 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;@6a0cca05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:45:23,940 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-25 15:45:23,952 INFO L130 PetriNetUnfolder]: 0/12 cut-off events. [2022-11-25 15:45:23,953 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 15:45:23,953 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:23,954 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:23,954 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:23,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:23,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1907911569, now seen corresponding path program 1 times [2022-11-25 15:45:23,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:23,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685367694] [2022-11-25 15:45:23,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:23,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:24,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:24,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:24,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685367694] [2022-11-25 15:45:24,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685367694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:24,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:24,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:45:24,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238563324] [2022-11-25 15:45:24,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:24,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:45:24,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:24,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:45:24,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:45:24,564 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 229 [2022-11-25 15:45:24,569 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 57 flow. Second operand has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:24,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:24,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 229 [2022-11-25 15:45:24,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:24,931 INFO L130 PetriNetUnfolder]: 824/1312 cut-off events. [2022-11-25 15:45:24,931 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-11-25 15:45:24,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2591 conditions, 1312 events. 824/1312 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 6201 event pairs, 144 based on Foata normal form. 0/1236 useless extension candidates. Maximal degree in co-relation 2580. Up to 981 conditions per place. [2022-11-25 15:45:24,947 INFO L137 encePairwiseOnDemand]: 225/229 looper letters, 26 selfloop transitions, 2 changer transitions 2/32 dead transitions. [2022-11-25 15:45:24,948 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 32 transitions, 133 flow [2022-11-25 15:45:24,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:24,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:24,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2022-11-25 15:45:24,972 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5152838427947598 [2022-11-25 15:45:24,973 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2022-11-25 15:45:24,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2022-11-25 15:45:24,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:24,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2022-11-25 15:45:24,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:24,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:24,995 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:24,997 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 57 flow. Second operand 3 states and 354 transitions. [2022-11-25 15:45:24,998 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 32 transitions, 133 flow [2022-11-25 15:45:25,001 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 32 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 15:45:25,003 INFO L231 Difference]: Finished difference. Result has 31 places, 21 transitions, 52 flow [2022-11-25 15:45:25,004 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=52, PETRI_PLACES=31, PETRI_TRANSITIONS=21} [2022-11-25 15:45:25,009 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-11-25 15:45:25,009 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 21 transitions, 52 flow [2022-11-25 15:45:25,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.33333333333333) internal successors, (328), 3 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,010 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:25,010 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:25,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:45:25,011 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:25,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:25,013 INFO L85 PathProgramCache]: Analyzing trace with hash -447933828, now seen corresponding path program 1 times [2022-11-25 15:45:25,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:25,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726066607] [2022-11-25 15:45:25,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:25,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:25,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:25,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726066607] [2022-11-25 15:45:25,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726066607] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:25,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:25,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:45:25,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847575928] [2022-11-25 15:45:25,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:25,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:45:25,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:25,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:45:25,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:45:25,299 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 229 [2022-11-25 15:45:25,300 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 21 transitions, 52 flow. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,300 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:25,300 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 229 [2022-11-25 15:45:25,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:25,641 INFO L130 PetriNetUnfolder]: 1069/1590 cut-off events. [2022-11-25 15:45:25,641 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-11-25 15:45:25,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3310 conditions, 1590 events. 1069/1590 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6321 event pairs, 409 based on Foata normal form. 8/1598 useless extension candidates. Maximal degree in co-relation 3300. Up to 1515 conditions per place. [2022-11-25 15:45:25,650 INFO L137 encePairwiseOnDemand]: 224/229 looper letters, 29 selfloop transitions, 4 changer transitions 0/33 dead transitions. [2022-11-25 15:45:25,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 33 transitions, 148 flow [2022-11-25 15:45:25,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:25,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:25,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 334 transitions. [2022-11-25 15:45:25,653 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4861717612809316 [2022-11-25 15:45:25,653 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 334 transitions. [2022-11-25 15:45:25,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 334 transitions. [2022-11-25 15:45:25,654 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:25,654 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 334 transitions. [2022-11-25 15:45:25,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,659 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,659 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,660 INFO L175 Difference]: Start difference. First operand has 31 places, 21 transitions, 52 flow. Second operand 3 states and 334 transitions. [2022-11-25 15:45:25,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 33 transitions, 148 flow [2022-11-25 15:45:25,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:25,663 INFO L231 Difference]: Finished difference. Result has 31 places, 24 transitions, 74 flow [2022-11-25 15:45:25,663 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=31, PETRI_TRANSITIONS=24} [2022-11-25 15:45:25,664 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, -2 predicate places. [2022-11-25 15:45:25,664 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 24 transitions, 74 flow [2022-11-25 15:45:25,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,665 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:25,665 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:25,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:45:25,666 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:25,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:25,667 INFO L85 PathProgramCache]: Analyzing trace with hash 795077557, now seen corresponding path program 1 times [2022-11-25 15:45:25,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:25,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883103517] [2022-11-25 15:45:25,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:25,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:25,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:25,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:25,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883103517] [2022-11-25 15:45:25,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883103517] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:25,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:25,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:45:25,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388984934] [2022-11-25 15:45:25,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:25,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:45:25,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:25,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:45:25,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:45:25,950 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 229 [2022-11-25 15:45:25,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 24 transitions, 74 flow. Second operand has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:25,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:25,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 229 [2022-11-25 15:45:25,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:26,240 INFO L130 PetriNetUnfolder]: 991/1480 cut-off events. [2022-11-25 15:45:26,240 INFO L131 PetriNetUnfolder]: For 249/249 co-relation queries the response was YES. [2022-11-25 15:45:26,243 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3419 conditions, 1480 events. 991/1480 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 5658 event pairs, 311 based on Foata normal form. 32/1512 useless extension candidates. Maximal degree in co-relation 3408. Up to 1037 conditions per place. [2022-11-25 15:45:26,250 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 30 selfloop transitions, 3 changer transitions 0/33 dead transitions. [2022-11-25 15:45:26,250 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 33 transitions, 162 flow [2022-11-25 15:45:26,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:26,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:26,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 331 transitions. [2022-11-25 15:45:26,252 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48180494905385735 [2022-11-25 15:45:26,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 331 transitions. [2022-11-25 15:45:26,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 331 transitions. [2022-11-25 15:45:26,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:26,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 331 transitions. [2022-11-25 15:45:26,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,255 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,256 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,256 INFO L175 Difference]: Start difference. First operand has 31 places, 24 transitions, 74 flow. Second operand 3 states and 331 transitions. [2022-11-25 15:45:26,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 33 transitions, 162 flow [2022-11-25 15:45:26,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 33 transitions, 158 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:45:26,258 INFO L231 Difference]: Finished difference. Result has 33 places, 24 transitions, 81 flow [2022-11-25 15:45:26,258 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=33, PETRI_TRANSITIONS=24} [2022-11-25 15:45:26,260 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 0 predicate places. [2022-11-25 15:45:26,260 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 24 transitions, 81 flow [2022-11-25 15:45:26,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.75) internal successors, (411), 4 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,260 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:26,260 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:26,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:45:26,262 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:26,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:26,262 INFO L85 PathProgramCache]: Analyzing trace with hash -970143305, now seen corresponding path program 1 times [2022-11-25 15:45:26,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:26,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192673489] [2022-11-25 15:45:26,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:26,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:26,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:26,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:26,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:26,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192673489] [2022-11-25 15:45:26,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192673489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:26,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:26,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 15:45:26,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121041291] [2022-11-25 15:45:26,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:26,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:45:26,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:26,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:45:26,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:45:26,482 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 229 [2022-11-25 15:45:26,482 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 24 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,482 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:26,483 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 229 [2022-11-25 15:45:26,483 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:26,692 INFO L130 PetriNetUnfolder]: 672/1082 cut-off events. [2022-11-25 15:45:26,692 INFO L131 PetriNetUnfolder]: For 302/302 co-relation queries the response was YES. [2022-11-25 15:45:26,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2493 conditions, 1082 events. 672/1082 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4778 event pairs, 259 based on Foata normal form. 24/1105 useless extension candidates. Maximal degree in co-relation 2480. Up to 697 conditions per place. [2022-11-25 15:45:26,700 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 28 selfloop transitions, 3 changer transitions 0/34 dead transitions. [2022-11-25 15:45:26,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 34 transitions, 170 flow [2022-11-25 15:45:26,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:45:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 15:45:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 348 transitions. [2022-11-25 15:45:26,704 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5065502183406113 [2022-11-25 15:45:26,704 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 348 transitions. [2022-11-25 15:45:26,704 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 348 transitions. [2022-11-25 15:45:26,705 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:26,705 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 348 transitions. [2022-11-25 15:45:26,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 116.0) internal successors, (348), 3 states have internal predecessors, (348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,707 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,708 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 229.0) internal successors, (916), 4 states have internal predecessors, (916), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,708 INFO L175 Difference]: Start difference. First operand has 33 places, 24 transitions, 81 flow. Second operand 3 states and 348 transitions. [2022-11-25 15:45:26,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 34 transitions, 170 flow [2022-11-25 15:45:26,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:26,711 INFO L231 Difference]: Finished difference. Result has 34 places, 24 transitions, 86 flow [2022-11-25 15:45:26,712 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=75, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=86, PETRI_PLACES=34, PETRI_TRANSITIONS=24} [2022-11-25 15:45:26,713 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 1 predicate places. [2022-11-25 15:45:26,713 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 24 transitions, 86 flow [2022-11-25 15:45:26,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,714 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:26,714 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:26,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:45:26,714 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:26,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1626212931, now seen corresponding path program 1 times [2022-11-25 15:45:26,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:26,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896433877] [2022-11-25 15:45:26,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:26,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:26,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:26,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:26,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:26,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896433877] [2022-11-25 15:45:26,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896433877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:26,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:26,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:45:26,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888218234] [2022-11-25 15:45:26,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:26,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:45:26,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:26,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:45:26,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:45:26,947 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 229 [2022-11-25 15:45:26,948 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 24 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:26,948 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:26,948 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 229 [2022-11-25 15:45:26,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:27,214 INFO L130 PetriNetUnfolder]: 528/904 cut-off events. [2022-11-25 15:45:27,214 INFO L131 PetriNetUnfolder]: For 314/314 co-relation queries the response was YES. [2022-11-25 15:45:27,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2224 conditions, 904 events. 528/904 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 4126 event pairs, 100 based on Foata normal form. 96/998 useless extension candidates. Maximal degree in co-relation 2210. Up to 495 conditions per place. [2022-11-25 15:45:27,220 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 49 selfloop transitions, 7 changer transitions 2/61 dead transitions. [2022-11-25 15:45:27,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 61 transitions, 312 flow [2022-11-25 15:45:27,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:45:27,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:45:27,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 571 transitions. [2022-11-25 15:45:27,235 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49868995633187774 [2022-11-25 15:45:27,235 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 571 transitions. [2022-11-25 15:45:27,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 571 transitions. [2022-11-25 15:45:27,236 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:27,236 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 571 transitions. [2022-11-25 15:45:27,238 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.2) internal successors, (571), 5 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:27,241 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:27,241 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:27,242 INFO L175 Difference]: Start difference. First operand has 34 places, 24 transitions, 86 flow. Second operand 5 states and 571 transitions. [2022-11-25 15:45:27,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 61 transitions, 312 flow [2022-11-25 15:45:27,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 61 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:27,246 INFO L231 Difference]: Finished difference. Result has 39 places, 30 transitions, 134 flow [2022-11-25 15:45:27,246 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=39, PETRI_TRANSITIONS=30} [2022-11-25 15:45:27,248 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 6 predicate places. [2022-11-25 15:45:27,248 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 30 transitions, 134 flow [2022-11-25 15:45:27,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:27,249 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:27,249 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:27,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:45:27,250 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:27,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:27,250 INFO L85 PathProgramCache]: Analyzing trace with hash 651449423, now seen corresponding path program 1 times [2022-11-25 15:45:27,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:27,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040545877] [2022-11-25 15:45:27,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:27,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:27,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:27,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040545877] [2022-11-25 15:45:27,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040545877] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:27,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:27,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:45:27,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535898584] [2022-11-25 15:45:27,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:27,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:45:27,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:27,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:45:27,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:45:27,531 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 229 [2022-11-25 15:45:27,532 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 30 transitions, 134 flow. Second operand has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:27,532 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:27,532 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 229 [2022-11-25 15:45:27,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:27,854 INFO L130 PetriNetUnfolder]: 390/706 cut-off events. [2022-11-25 15:45:27,855 INFO L131 PetriNetUnfolder]: For 435/435 co-relation queries the response was YES. [2022-11-25 15:45:27,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 706 events. 390/706 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3199 event pairs, 66 based on Foata normal form. 52/756 useless extension candidates. Maximal degree in co-relation 2146. Up to 233 conditions per place. [2022-11-25 15:45:27,860 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 57 selfloop transitions, 13 changer transitions 10/83 dead transitions. [2022-11-25 15:45:27,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 83 transitions, 480 flow [2022-11-25 15:45:27,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:45:27,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:45:27,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 799 transitions. [2022-11-25 15:45:27,863 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4984404242046163 [2022-11-25 15:45:27,863 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 799 transitions. [2022-11-25 15:45:27,863 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 799 transitions. [2022-11-25 15:45:27,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:27,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 799 transitions. [2022-11-25 15:45:27,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.14285714285714) internal successors, (799), 7 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:27,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:27,871 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:27,871 INFO L175 Difference]: Start difference. First operand has 39 places, 30 transitions, 134 flow. Second operand 7 states and 799 transitions. [2022-11-25 15:45:27,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 83 transitions, 480 flow [2022-11-25 15:45:27,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 83 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 15:45:27,878 INFO L231 Difference]: Finished difference. Result has 47 places, 36 transitions, 218 flow [2022-11-25 15:45:27,879 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=218, PETRI_PLACES=47, PETRI_TRANSITIONS=36} [2022-11-25 15:45:27,885 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 14 predicate places. [2022-11-25 15:45:27,885 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 36 transitions, 218 flow [2022-11-25 15:45:27,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.0) internal successors, (530), 5 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:27,886 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:27,886 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:27,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:45:27,887 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:27,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:27,887 INFO L85 PathProgramCache]: Analyzing trace with hash 484615768, now seen corresponding path program 1 times [2022-11-25 15:45:27,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:27,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915906047] [2022-11-25 15:45:27,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:27,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:28,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:28,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915906047] [2022-11-25 15:45:28,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915906047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:28,157 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:28,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 15:45:28,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706403548] [2022-11-25 15:45:28,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:28,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 15:45:28,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:28,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 15:45:28,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:45:28,180 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2022-11-25 15:45:28,181 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 36 transitions, 218 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:28,181 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:28,181 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2022-11-25 15:45:28,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:28,532 INFO L130 PetriNetUnfolder]: 679/1178 cut-off events. [2022-11-25 15:45:28,532 INFO L131 PetriNetUnfolder]: For 2160/2160 co-relation queries the response was YES. [2022-11-25 15:45:28,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4149 conditions, 1178 events. 679/1178 cut-off events. For 2160/2160 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5738 event pairs, 67 based on Foata normal form. 7/1185 useless extension candidates. Maximal degree in co-relation 4128. Up to 656 conditions per place. [2022-11-25 15:45:28,539 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 49 selfloop transitions, 8 changer transitions 37/94 dead transitions. [2022-11-25 15:45:28,539 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 94 transitions, 733 flow [2022-11-25 15:45:28,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 15:45:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 15:45:28,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2022-11-25 15:45:28,542 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.475254730713246 [2022-11-25 15:45:28,542 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 653 transitions. [2022-11-25 15:45:28,542 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 653 transitions. [2022-11-25 15:45:28,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:28,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 653 transitions. [2022-11-25 15:45:28,545 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:28,547 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:28,547 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 229.0) internal successors, (1603), 7 states have internal predecessors, (1603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:28,548 INFO L175 Difference]: Start difference. First operand has 47 places, 36 transitions, 218 flow. Second operand 6 states and 653 transitions. [2022-11-25 15:45:28,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 94 transitions, 733 flow [2022-11-25 15:45:28,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 94 transitions, 651 flow, removed 29 selfloop flow, removed 2 redundant places. [2022-11-25 15:45:28,563 INFO L231 Difference]: Finished difference. Result has 52 places, 33 transitions, 184 flow [2022-11-25 15:45:28,563 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=184, PETRI_PLACES=52, PETRI_TRANSITIONS=33} [2022-11-25 15:45:28,564 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2022-11-25 15:45:28,564 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 33 transitions, 184 flow [2022-11-25 15:45:28,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:28,564 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:28,565 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:28,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:45:28,565 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:28,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:28,566 INFO L85 PathProgramCache]: Analyzing trace with hash 2051883810, now seen corresponding path program 2 times [2022-11-25 15:45:28,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:28,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983987264] [2022-11-25 15:45:28,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:28,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:28,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:28,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:28,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:28,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983987264] [2022-11-25 15:45:28,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983987264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:28,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:28,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:45:28,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356080395] [2022-11-25 15:45:28,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:28,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 15:45:28,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:28,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 15:45:28,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 15:45:28,844 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 229 [2022-11-25 15:45:28,844 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 33 transitions, 184 flow. Second operand has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:28,845 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:28,845 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 229 [2022-11-25 15:45:28,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:29,048 INFO L130 PetriNetUnfolder]: 237/456 cut-off events. [2022-11-25 15:45:29,049 INFO L131 PetriNetUnfolder]: For 555/555 co-relation queries the response was YES. [2022-11-25 15:45:29,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1502 conditions, 456 events. 237/456 cut-off events. For 555/555 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1959 event pairs, 64 based on Foata normal form. 21/467 useless extension candidates. Maximal degree in co-relation 1478. Up to 172 conditions per place. [2022-11-25 15:45:29,052 INFO L137 encePairwiseOnDemand]: 223/229 looper letters, 35 selfloop transitions, 10 changer transitions 16/64 dead transitions. [2022-11-25 15:45:29,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 64 transitions, 423 flow [2022-11-25 15:45:29,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 15:45:29,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 15:45:29,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 779 transitions. [2022-11-25 15:45:29,055 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4859638178415471 [2022-11-25 15:45:29,055 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 779 transitions. [2022-11-25 15:45:29,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 779 transitions. [2022-11-25 15:45:29,056 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:29,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 779 transitions. [2022-11-25 15:45:29,058 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 111.28571428571429) internal successors, (779), 7 states have internal predecessors, (779), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:29,060 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:29,061 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 229.0) internal successors, (1832), 8 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:29,061 INFO L175 Difference]: Start difference. First operand has 52 places, 33 transitions, 184 flow. Second operand 7 states and 779 transitions. [2022-11-25 15:45:29,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 64 transitions, 423 flow [2022-11-25 15:45:29,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 64 transitions, 377 flow, removed 14 selfloop flow, removed 6 redundant places. [2022-11-25 15:45:29,065 INFO L231 Difference]: Finished difference. Result has 51 places, 29 transitions, 160 flow [2022-11-25 15:45:29,065 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=160, PETRI_PLACES=51, PETRI_TRANSITIONS=29} [2022-11-25 15:45:29,067 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 18 predicate places. [2022-11-25 15:45:29,068 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 29 transitions, 160 flow [2022-11-25 15:45:29,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.83333333333333) internal successors, (635), 6 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:29,068 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:29,068 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:29,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:45:29,069 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:29,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:29,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1897388346, now seen corresponding path program 1 times [2022-11-25 15:45:29,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:29,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505350807] [2022-11-25 15:45:29,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:29,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:29,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:29,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:29,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505350807] [2022-11-25 15:45:29,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505350807] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:29,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:29,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:45:29,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163372548] [2022-11-25 15:45:29,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:29,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:45:29,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:29,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:45:29,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:45:29,332 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 229 [2022-11-25 15:45:29,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 29 transitions, 160 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-11-25 15:45:29,333 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:29,333 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 229 [2022-11-25 15:45:29,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:29,520 INFO L130 PetriNetUnfolder]: 194/381 cut-off events. [2022-11-25 15:45:29,521 INFO L131 PetriNetUnfolder]: For 623/623 co-relation queries the response was YES. [2022-11-25 15:45:29,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1313 conditions, 381 events. 194/381 cut-off events. For 623/623 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1506 event pairs, 42 based on Foata normal form. 1/382 useless extension candidates. Maximal degree in co-relation 1296. Up to 251 conditions per place. [2022-11-25 15:45:29,523 INFO L137 encePairwiseOnDemand]: 221/229 looper letters, 43 selfloop transitions, 10 changer transitions 13/66 dead transitions. [2022-11-25 15:45:29,523 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 484 flow [2022-11-25 15:45:29,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 15:45:29,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 15:45:29,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 542 transitions. [2022-11-25 15:45:29,526 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4733624454148472 [2022-11-25 15:45:29,526 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 542 transitions. [2022-11-25 15:45:29,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 542 transitions. [2022-11-25 15:45:29,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:29,527 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 542 transitions. [2022-11-25 15:45:29,528 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:29,532 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:29,533 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 229.0) internal successors, (1374), 6 states have internal predecessors, (1374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:29,533 INFO L175 Difference]: Start difference. First operand has 51 places, 29 transitions, 160 flow. Second operand 5 states and 542 transitions. [2022-11-25 15:45:29,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 484 flow [2022-11-25 15:45:29,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 66 transitions, 405 flow, removed 19 selfloop flow, removed 8 redundant places. [2022-11-25 15:45:29,537 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 187 flow [2022-11-25 15:45:29,538 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=187, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-11-25 15:45:29,539 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 12 predicate places. [2022-11-25 15:45:29,539 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 187 flow [2022-11-25 15:45:29,541 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-11-25 15:45:29,542 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:29,542 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:29,542 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:45:29,543 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:29,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:29,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1387353878, now seen corresponding path program 2 times [2022-11-25 15:45:29,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:29,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579660149] [2022-11-25 15:45:29,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:29,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:29,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:29,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:29,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579660149] [2022-11-25 15:45:29,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579660149] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:29,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:29,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:45:29,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471619866] [2022-11-25 15:45:29,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:29,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:45:29,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:29,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:45:29,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:45:29,828 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 229 [2022-11-25 15:45:29,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 187 flow. Second operand has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:29,828 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:29,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 229 [2022-11-25 15:45:29,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:29,983 INFO L130 PetriNetUnfolder]: 217/443 cut-off events. [2022-11-25 15:45:29,984 INFO L131 PetriNetUnfolder]: For 670/670 co-relation queries the response was YES. [2022-11-25 15:45:29,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1535 conditions, 443 events. 217/443 cut-off events. For 670/670 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 1932 event pairs, 66 based on Foata normal form. 1/441 useless extension candidates. Maximal degree in co-relation 1515. Up to 224 conditions per place. [2022-11-25 15:45:29,986 INFO L137 encePairwiseOnDemand]: 226/229 looper letters, 27 selfloop transitions, 1 changer transitions 34/63 dead transitions. [2022-11-25 15:45:29,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 63 transitions, 437 flow [2022-11-25 15:45:29,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:45:29,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 15:45:29,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2022-11-25 15:45:29,989 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5010917030567685 [2022-11-25 15:45:29,989 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 459 transitions. [2022-11-25 15:45:29,989 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 459 transitions. [2022-11-25 15:45:29,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:29,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 459 transitions. [2022-11-25 15:45:29,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:29,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:29,994 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 229.0) internal successors, (1145), 5 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:29,995 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 187 flow. Second operand 4 states and 459 transitions. [2022-11-25 15:45:29,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 63 transitions, 437 flow [2022-11-25 15:45:29,999 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 63 transitions, 437 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 15:45:30,000 INFO L231 Difference]: Finished difference. Result has 49 places, 27 transitions, 134 flow [2022-11-25 15:45:30,002 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=187, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=134, PETRI_PLACES=49, PETRI_TRANSITIONS=27} [2022-11-25 15:45:30,002 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 16 predicate places. [2022-11-25 15:45:30,003 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 27 transitions, 134 flow [2022-11-25 15:45:30,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.0) internal successors, (436), 4 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:30,003 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:30,003 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:30,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:45:30,004 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:30,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:30,004 INFO L85 PathProgramCache]: Analyzing trace with hash -852128728, now seen corresponding path program 3 times [2022-11-25 15:45:30,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:30,005 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755186183] [2022-11-25 15:45:30,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:30,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:45:31,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 15:45:31,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:45:31,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755186183] [2022-11-25 15:45:31,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755186183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:45:31,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:45:31,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 15:45:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27660730] [2022-11-25 15:45:31,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:45:31,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 15:45:31,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:45:31,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 15:45:31,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 15:45:31,605 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 229 [2022-11-25 15:45:31,605 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 27 transitions, 134 flow. Second operand has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:31,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 15:45:31,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 229 [2022-11-25 15:45:31,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 15:45:32,115 INFO L130 PetriNetUnfolder]: 76/178 cut-off events. [2022-11-25 15:45:32,115 INFO L131 PetriNetUnfolder]: For 358/358 co-relation queries the response was YES. [2022-11-25 15:45:32,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 178 events. 76/178 cut-off events. For 358/358 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 661 event pairs, 12 based on Foata normal form. 1/174 useless extension candidates. Maximal degree in co-relation 626. Up to 58 conditions per place. [2022-11-25 15:45:32,116 INFO L137 encePairwiseOnDemand]: 222/229 looper letters, 22 selfloop transitions, 4 changer transitions 22/50 dead transitions. [2022-11-25 15:45:32,117 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 50 transitions, 356 flow [2022-11-25 15:45:32,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 15:45:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 15:45:32,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 835 transitions. [2022-11-25 15:45:32,120 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4557860262008734 [2022-11-25 15:45:32,120 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 835 transitions. [2022-11-25 15:45:32,120 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 835 transitions. [2022-11-25 15:45:32,121 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 15:45:32,121 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 835 transitions. [2022-11-25 15:45:32,123 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 104.375) internal successors, (835), 8 states have internal predecessors, (835), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:32,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 229.0) internal successors, (2061), 9 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:32,127 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 229.0) internal successors, (2061), 9 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:32,127 INFO L175 Difference]: Start difference. First operand has 49 places, 27 transitions, 134 flow. Second operand 8 states and 835 transitions. [2022-11-25 15:45:32,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 50 transitions, 356 flow [2022-11-25 15:45:32,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 50 transitions, 330 flow, removed 9 selfloop flow, removed 5 redundant places. [2022-11-25 15:45:32,130 INFO L231 Difference]: Finished difference. Result has 52 places, 27 transitions, 133 flow [2022-11-25 15:45:32,130 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=229, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=133, PETRI_PLACES=52, PETRI_TRANSITIONS=27} [2022-11-25 15:45:32,130 INFO L288 CegarLoopForPetriNet]: 33 programPoint places, 19 predicate places. [2022-11-25 15:45:32,131 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 27 transitions, 133 flow [2022-11-25 15:45:32,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 102.71428571428571) internal successors, (719), 7 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 15:45:32,131 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 15:45:32,131 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:32,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:45:32,132 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-25 15:45:32,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:45:32,132 INFO L85 PathProgramCache]: Analyzing trace with hash -860596760, now seen corresponding path program 4 times [2022-11-25 15:45:32,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:45:32,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865024547] [2022-11-25 15:45:32,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:45:32,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:45:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:45:32,186 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 15:45:32,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 15:45:32,297 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 15:45:32,297 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 15:45:32,298 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-25 15:45:32,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-25 15:45:32,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-25 15:45:32,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-25 15:45:32,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-25 15:45:32,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-25 15:45:32,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:45:32,302 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 15:45:32,308 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 15:45:32,308 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:45:32,366 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:45:32 BasicIcfg [2022-11-25 15:45:32,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:45:32,366 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:45:32,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:45:32,369 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:45:32,370 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:45:18" (3/4) ... [2022-11-25 15:45:32,372 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 15:45:32,471 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:45:32,471 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:45:32,472 INFO L158 Benchmark]: Toolchain (without parser) took 15785.15ms. Allocated memory was 130.0MB in the beginning and 297.8MB in the end (delta: 167.8MB). Free memory was 98.5MB in the beginning and 154.6MB in the end (delta: -56.1MB). Peak memory consumption was 112.1MB. Max. memory is 16.1GB. [2022-11-25 15:45:32,472 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 130.0MB. Free memory was 77.3MB in the beginning and 77.1MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:45:32,472 INFO L158 Benchmark]: CACSL2BoogieTranslator took 823.77ms. Allocated memory is still 130.0MB. Free memory was 98.2MB in the beginning and 70.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-25 15:45:32,473 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.22ms. Allocated memory is still 130.0MB. Free memory was 70.5MB in the beginning and 68.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:45:32,473 INFO L158 Benchmark]: Boogie Preprocessor took 30.03ms. Allocated memory is still 130.0MB. Free memory was 68.0MB in the beginning and 65.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:45:32,474 INFO L158 Benchmark]: RCFGBuilder took 880.53ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 65.9MB in the beginning and 115.6MB in the end (delta: -49.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. [2022-11-25 15:45:32,474 INFO L158 Benchmark]: TraceAbstraction took 13866.97ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 115.2MB in the beginning and 166.1MB in the end (delta: -50.9MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. [2022-11-25 15:45:32,474 INFO L158 Benchmark]: Witness Printer took 104.86ms. Allocated memory is still 297.8MB. Free memory was 166.1MB in the beginning and 154.6MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 15:45:32,476 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 130.0MB. Free memory was 77.3MB in the beginning and 77.1MB in the end (delta: 119.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 823.77ms. Allocated memory is still 130.0MB. Free memory was 98.2MB in the beginning and 70.9MB in the end (delta: 27.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.22ms. Allocated memory is still 130.0MB. Free memory was 70.5MB in the beginning and 68.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.03ms. Allocated memory is still 130.0MB. Free memory was 68.0MB in the beginning and 65.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 880.53ms. Allocated memory was 130.0MB in the beginning and 169.9MB in the end (delta: 39.8MB). Free memory was 65.9MB in the beginning and 115.6MB in the end (delta: -49.7MB). Peak memory consumption was 21.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13866.97ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 115.2MB in the beginning and 166.1MB in the end (delta: -50.9MB). Peak memory consumption was 78.1MB. Max. memory is 16.1GB. * Witness Printer took 104.86ms. Allocated memory is still 297.8MB. Free memory was 166.1MB in the beginning and 154.6MB in the end (delta: 11.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: 5.2s, 125 PlacesBefore, 33 PlacesAfterwards, 117 TransitionsBefore, 24 TransitionsAfterwards, 2146 CoEnabledTransitionPairs, 7 FixpointIterations, 45 TrivialSequentialCompositions, 54 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 109 TotalNumberOfCompositions, 5237 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3061, independent: 2884, independent conditional: 0, independent unconditional: 2884, dependent: 177, dependent conditional: 0, dependent unconditional: 177, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1634, independent: 1576, independent conditional: 0, independent unconditional: 1576, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1634, independent: 1555, independent conditional: 0, independent unconditional: 1555, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 79, independent: 21, independent conditional: 0, independent unconditional: 21, dependent: 58, dependent conditional: 0, dependent unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 489, independent: 43, independent conditional: 0, independent unconditional: 43, dependent: 445, dependent conditional: 0, dependent unconditional: 445, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3061, independent: 1308, independent conditional: 0, independent unconditional: 1308, dependent: 119, dependent conditional: 0, dependent unconditional: 119, unknown: 1634, unknown conditional: 0, unknown unconditional: 1634] , Statistics on independence cache: Total cache size (in pairs): 172, Positive cache size: 153, Positive conditional cache size: 0, Positive unconditional cache size: 153, Negative cache size: 19, Negative conditional cache size: 0, Negative unconditional cache size: 19, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L715] 0 int __unbuffered_p1_EBX = 0; [L717] 0 int __unbuffered_p2_EAX = 0; [L719] 0 int __unbuffered_p2_EBX = 0; [L721] 0 int a = 0; [L722] 0 _Bool main$tmp_guard0; [L723] 0 _Bool main$tmp_guard1; [L725] 0 int x = 0; [L727] 0 int y = 0; [L729] 0 int z = 0; [L730] 0 _Bool z$flush_delayed; [L731] 0 int z$mem_tmp; [L732] 0 _Bool z$r_buff0_thd0; [L733] 0 _Bool z$r_buff0_thd1; [L734] 0 _Bool z$r_buff0_thd2; [L735] 0 _Bool z$r_buff0_thd3; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$read_delayed; [L741] 0 int *z$read_delayed_var; [L742] 0 int z$w_buff0; [L743] 0 _Bool z$w_buff0_used; [L744] 0 int z$w_buff1; [L745] 0 _Bool z$w_buff1_used; [L746] 0 _Bool weak$$choice0; [L747] 0 _Bool weak$$choice2; [L853] 0 pthread_t t260; [L854] FCALL, FORK 0 pthread_create(&t260, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t260, ((void *)0), P0, ((void *)0))=-2, t260={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 pthread_t t261; [L856] FCALL, FORK 0 pthread_create(&t261, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t261, ((void *)0), P1, ((void *)0))=-1, t260={5:0}, t261={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] 0 pthread_t t262; [L858] FCALL, FORK 0 pthread_create(&t262, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t262, ((void *)0), P2, ((void *)0))=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L800] 3 z$w_buff1 = z$w_buff0 [L801] 3 z$w_buff0 = 1 [L802] 3 z$w_buff1_used = z$w_buff0_used [L803] 3 z$w_buff0_used = (_Bool)1 [L804] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L804] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L805] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L806] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L807] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L808] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L809] 3 z$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 3 z$flush_delayed = weak$$choice2 [L815] 3 z$mem_tmp = z [L816] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L817] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L818] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L819] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L820] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L821] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L822] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L823] 3 __unbuffered_p2_EAX = z [L824] 3 z = z$flush_delayed ? z$mem_tmp : z [L825] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 3 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 y = 1 [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L761] 1 return 0; [L775] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L776] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L777] 2 z$flush_delayed = weak$$choice2 [L778] 2 z$mem_tmp = z [L779] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L780] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L781] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L782] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L783] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L784] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L785] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L786] 2 __unbuffered_p1_EBX = z [L787] 2 z = z$flush_delayed ? z$mem_tmp : z [L788] 2 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L832] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L833] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L834] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L835] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L865] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L866] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L867] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L868] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t260={5:0}, t261={6:0}, t262={3:0}, weak$$choice0=2, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L873] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=255, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 148 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 449 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 356 mSDsluCounter, 137 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 100 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 952 IncrementalHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 37 mSDtfsCounter, 952 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218occurred in iteration=6, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 1275 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-25 15:45:32,502 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0d9727f9-3732-435c-a4a7-aee1a63fd014/bin/uautomizer-ZsLfNo2U6R/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