./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix030_tso.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix030_tso.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 20a2c57970e5e291ffc10826c9a5fbe3296a1e55ae86cfd2b786718aae571bfa --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 13:40:32,053 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:40:32,054 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:40:32,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:40:32,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:40:32,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:40:32,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:40:32,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:40:32,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:40:32,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:40:32,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:40:32,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:40:32,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:40:32,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:40:32,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:40:32,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:40:32,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:40:32,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:40:32,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:40:32,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:40:32,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:40:32,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:40:32,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:40:32,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:40:32,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:40:32,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:40:32,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:40:32,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:40:32,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:40:32,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:40:32,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:40:32,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:40:32,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:40:32,101 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:40:32,102 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:40:32,102 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:40:32,103 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:40:32,103 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:40:32,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:40:32,104 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:40:32,105 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:40:32,105 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 13:40:32,124 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:40:32,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:40:32,125 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:40:32,125 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:40:32,126 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:40:32,126 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:40:32,133 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:40:32,133 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:40:32,133 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:40:32,134 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:40:32,134 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:40:32,134 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:40:32,134 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:40:32,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:40:32,135 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 13:40:32,135 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:40:32,135 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 13:40:32,135 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:40:32,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 13:40:32,136 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:40:32,136 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 13:40:32,136 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:40:32,136 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:40:32,136 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:40:32,137 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:40:32,137 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:40:32,137 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:40:32,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 13:40:32,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:40:32,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:40:32,138 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:40:32,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 13:40:32,138 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:40:32,138 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:40:32,139 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:40:32,139 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_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 20a2c57970e5e291ffc10826c9a5fbe3296a1e55ae86cfd2b786718aae571bfa [2022-12-13 13:40:32,322 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:40:32,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:40:32,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:40:32,344 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:40:32,344 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:40:32,345 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix030_tso.i [2022-12-13 13:40:34,955 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:40:35,152 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:40:35,153 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/sv-benchmarks/c/pthread-wmm/mix030_tso.i [2022-12-13 13:40:35,165 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8/data/4ecb7595a/7bd545bc5da3464793f350d19147041e/FLAG638877fd1 [2022-12-13 13:40:35,175 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8/data/4ecb7595a/7bd545bc5da3464793f350d19147041e [2022-12-13 13:40:35,177 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:40:35,178 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:40:35,179 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:40:35,179 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:40:35,182 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:40:35,183 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:40:35" (1/1) ... [2022-12-13 13:40:35,184 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c2477b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:35, skipping insertion in model container [2022-12-13 13:40:35,184 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:40:35" (1/1) ... [2022-12-13 13:40:35,189 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:40:35,216 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:40:35,328 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_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/sv-benchmarks/c/pthread-wmm/mix030_tso.i[944,957] [2022-12-13 13:40:35,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,487 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,489 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,495 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:40:35,504 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:40:35,512 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_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/sv-benchmarks/c/pthread-wmm/mix030_tso.i[944,957] [2022-12-13 13:40:35,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,529 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,543 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:40:35,548 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:40:35,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:40:35,571 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:40:35,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:35 WrapperNode [2022-12-13 13:40:35,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:40:35,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:40:35,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:40:35,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:40:35,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:35" (1/1) ... [2022-12-13 13:40:35,589 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:35" (1/1) ... [2022-12-13 13:40:35,607 INFO L138 Inliner]: procedures = 177, calls = 69, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 176 [2022-12-13 13:40:35,608 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:40:35,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:40:35,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:40:35,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:40:35,616 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:35" (1/1) ... [2022-12-13 13:40:35,616 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:35" (1/1) ... [2022-12-13 13:40:35,618 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:35" (1/1) ... [2022-12-13 13:40:35,618 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:35" (1/1) ... [2022-12-13 13:40:35,623 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:35" (1/1) ... [2022-12-13 13:40:35,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:35" (1/1) ... [2022-12-13 13:40:35,626 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:35" (1/1) ... [2022-12-13 13:40:35,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:35" (1/1) ... [2022-12-13 13:40:35,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:40:35,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:40:35,631 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:40:35,631 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:40:35,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:35" (1/1) ... [2022-12-13 13:40:35,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:40:35,645 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:40:35,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:40:35,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:40:35,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:40:35,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:40:35,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:40:35,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:40:35,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:40:35,687 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 13:40:35,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 13:40:35,687 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 13:40:35,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 13:40:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 13:40:35,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 13:40:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 13:40:35,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 13:40:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:40:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:40:35,688 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:40:35,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:40:35,689 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 13:40:35,796 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:40:35,798 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:40:36,061 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:40:36,136 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:40:36,136 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 13:40:36,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:40:36 BoogieIcfgContainer [2022-12-13 13:40:36,138 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:40:36,139 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:40:36,139 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:40:36,141 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:40:36,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:40:35" (1/3) ... [2022-12-13 13:40:36,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e39fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:40:36, skipping insertion in model container [2022-12-13 13:40:36,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:40:35" (2/3) ... [2022-12-13 13:40:36,142 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55e39fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:40:36, skipping insertion in model container [2022-12-13 13:40:36,142 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:40:36" (3/3) ... [2022-12-13 13:40:36,143 INFO L112 eAbstractionObserver]: Analyzing ICFG mix030_tso.i [2022-12-13 13:40:36,150 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-12-13 13:40:36,157 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:40:36,157 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-12-13 13:40:36,157 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:40:36,200 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 13:40:36,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 145 places, 134 transitions, 288 flow [2022-12-13 13:40:36,265 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-12-13 13:40:36,265 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:40:36,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 13:40:36,269 INFO L82 GeneralOperation]: Start removeDead. Operand has 145 places, 134 transitions, 288 flow [2022-12-13 13:40:36,273 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 141 places, 130 transitions, 272 flow [2022-12-13 13:40:36,275 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 13:40:36,283 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 141 places, 130 transitions, 272 flow [2022-12-13 13:40:36,285 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 141 places, 130 transitions, 272 flow [2022-12-13 13:40:36,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 141 places, 130 transitions, 272 flow [2022-12-13 13:40:36,307 INFO L130 PetriNetUnfolder]: 2/130 cut-off events. [2022-12-13 13:40:36,307 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:40:36,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143 conditions, 130 events. 2/130 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-12-13 13:40:36,309 INFO L119 LiptonReduction]: Number of co-enabled transitions 3060 [2022-12-13 13:40:40,358 INFO L134 LiptonReduction]: Checked pairs total: 7866 [2022-12-13 13:40:40,358 INFO L136 LiptonReduction]: Total number of compositions: 116 [2022-12-13 13:40:40,369 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:40:40,373 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;@98d30fb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:40:40,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-13 13:40:40,377 INFO L130 PetriNetUnfolder]: 0/17 cut-off events. [2022-12-13 13:40:40,377 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:40:40,377 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:40,377 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:40,378 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:40:40,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:40,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1173691669, now seen corresponding path program 1 times [2022-12-13 13:40:40,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:40,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551648648] [2022-12-13 13:40:40,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:40,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:40,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:40,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:40,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:40,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551648648] [2022-12-13 13:40:40,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551648648] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:40,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:40,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:40:40,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872219079] [2022-12-13 13:40:40,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:40,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:40:40,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:40,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:40:40,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:40:40,766 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 250 [2022-12-13 13:40:40,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:40,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:40,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 250 [2022-12-13 13:40:40,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:41,238 INFO L130 PetriNetUnfolder]: 2594/3796 cut-off events. [2022-12-13 13:40:41,239 INFO L131 PetriNetUnfolder]: For 33/33 co-relation queries the response was YES. [2022-12-13 13:40:41,245 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7491 conditions, 3796 events. 2594/3796 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 20133 event pairs, 518 based on Foata normal form. 0/3603 useless extension candidates. Maximal degree in co-relation 7479. Up to 2797 conditions per place. [2022-12-13 13:40:41,256 INFO L137 encePairwiseOnDemand]: 247/250 looper letters, 30 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2022-12-13 13:40:41,256 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 38 transitions, 156 flow [2022-12-13 13:40:41,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:40:41,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:40:41,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2022-12-13 13:40:41,266 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5226666666666666 [2022-12-13 13:40:41,267 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2022-12-13 13:40:41,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2022-12-13 13:40:41,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:40:41,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2022-12-13 13:40:41,272 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:41,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:41,280 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:41,281 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 68 flow. Second operand 3 states and 392 transitions. [2022-12-13 13:40:41,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 38 transitions, 156 flow [2022-12-13 13:40:41,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 13:40:41,287 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 64 flow [2022-12-13 13:40:41,289 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-12-13 13:40:41,292 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-12-13 13:40:41,292 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 64 flow [2022-12-13 13:40:41,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:41,292 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:41,292 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:41,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:40:41,293 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:40:41,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:41,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1658656937, now seen corresponding path program 1 times [2022-12-13 13:40:41,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:41,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274123836] [2022-12-13 13:40:41,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:41,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:41,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:41,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:41,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:41,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274123836] [2022-12-13 13:40:41,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274123836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:41,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:41,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:40:41,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152180745] [2022-12-13 13:40:41,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:41,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:40:41,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:41,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:40:41,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:40:41,959 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 250 [2022-12-13 13:40:41,959 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:41,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:41,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 250 [2022-12-13 13:40:41,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:43,009 INFO L130 PetriNetUnfolder]: 7301/10166 cut-off events. [2022-12-13 13:40:43,009 INFO L131 PetriNetUnfolder]: For 406/406 co-relation queries the response was YES. [2022-12-13 13:40:43,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20954 conditions, 10166 events. 7301/10166 cut-off events. For 406/406 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 53190 event pairs, 625 based on Foata normal form. 336/10500 useless extension candidates. Maximal degree in co-relation 20944. Up to 6505 conditions per place. [2022-12-13 13:40:43,056 INFO L137 encePairwiseOnDemand]: 238/250 looper letters, 51 selfloop transitions, 13 changer transitions 0/65 dead transitions. [2022-12-13 13:40:43,056 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 65 transitions, 284 flow [2022-12-13 13:40:43,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:40:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:40:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 494 transitions. [2022-12-13 13:40:43,060 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.494 [2022-12-13 13:40:43,060 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 494 transitions. [2022-12-13 13:40:43,060 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 494 transitions. [2022-12-13 13:40:43,061 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:40:43,061 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 494 transitions. [2022-12-13 13:40:43,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:43,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:43,065 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:43,066 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 64 flow. Second operand 4 states and 494 transitions. [2022-12-13 13:40:43,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 65 transitions, 284 flow [2022-12-13 13:40:43,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 65 transitions, 276 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:40:43,069 INFO L231 Difference]: Finished difference. Result has 41 places, 38 transitions, 160 flow [2022-12-13 13:40:43,069 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=60, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=41, PETRI_TRANSITIONS=38} [2022-12-13 13:40:43,070 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 0 predicate places. [2022-12-13 13:40:43,070 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 38 transitions, 160 flow [2022-12-13 13:40:43,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:43,070 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:43,071 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:43,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:40:43,071 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:40:43,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:43,072 INFO L85 PathProgramCache]: Analyzing trace with hash 121241124, now seen corresponding path program 1 times [2022-12-13 13:40:43,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:43,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125981016] [2022-12-13 13:40:43,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:43,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:43,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:43,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:43,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125981016] [2022-12-13 13:40:43,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125981016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:43,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:43,701 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:40:43,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013421332] [2022-12-13 13:40:43,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:43,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:40:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:43,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:40:43,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:40:43,752 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 250 [2022-12-13 13:40:43,752 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 38 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:43,752 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:43,752 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 250 [2022-12-13 13:40:43,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:44,537 INFO L130 PetriNetUnfolder]: 6781/9482 cut-off events. [2022-12-13 13:40:44,537 INFO L131 PetriNetUnfolder]: For 6031/6069 co-relation queries the response was YES. [2022-12-13 13:40:44,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27299 conditions, 9482 events. 6781/9482 cut-off events. For 6031/6069 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 47611 event pairs, 1571 based on Foata normal form. 112/9586 useless extension candidates. Maximal degree in co-relation 27286. Up to 4561 conditions per place. [2022-12-13 13:40:44,568 INFO L137 encePairwiseOnDemand]: 239/250 looper letters, 50 selfloop transitions, 12 changer transitions 0/63 dead transitions. [2022-12-13 13:40:44,569 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 63 transitions, 378 flow [2022-12-13 13:40:44,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:40:44,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:40:44,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 479 transitions. [2022-12-13 13:40:44,570 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.479 [2022-12-13 13:40:44,570 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 479 transitions. [2022-12-13 13:40:44,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 479 transitions. [2022-12-13 13:40:44,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:40:44,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 479 transitions. [2022-12-13 13:40:44,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.75) internal successors, (479), 4 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:44,572 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:44,573 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:44,573 INFO L175 Difference]: Start difference. First operand has 41 places, 38 transitions, 160 flow. Second operand 4 states and 479 transitions. [2022-12-13 13:40:44,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 63 transitions, 378 flow [2022-12-13 13:40:44,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 63 transitions, 378 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 13:40:44,575 INFO L231 Difference]: Finished difference. Result has 47 places, 45 transitions, 266 flow [2022-12-13 13:40:44,575 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=266, PETRI_PLACES=47, PETRI_TRANSITIONS=45} [2022-12-13 13:40:44,576 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 6 predicate places. [2022-12-13 13:40:44,576 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 45 transitions, 266 flow [2022-12-13 13:40:44,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:44,576 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:44,576 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:44,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:40:44,577 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:40:44,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:44,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1838843153, now seen corresponding path program 1 times [2022-12-13 13:40:44,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:44,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20458490] [2022-12-13 13:40:44,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:44,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:44,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:44,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20458490] [2022-12-13 13:40:44,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20458490] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:44,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:44,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:40:44,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992097300] [2022-12-13 13:40:44,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:44,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:40:44,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:44,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:40:44,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:40:44,723 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 250 [2022-12-13 13:40:44,723 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 45 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:44,724 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:44,724 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 250 [2022-12-13 13:40:44,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:45,470 INFO L130 PetriNetUnfolder]: 5990/8702 cut-off events. [2022-12-13 13:40:45,471 INFO L131 PetriNetUnfolder]: For 14253/14298 co-relation queries the response was YES. [2022-12-13 13:40:45,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28308 conditions, 8702 events. 5990/8702 cut-off events. For 14253/14298 co-relation queries the response was YES. Maximal size of possible extension queue 376. Compared 48094 event pairs, 1223 based on Foata normal form. 39/8620 useless extension candidates. Maximal degree in co-relation 28290. Up to 7329 conditions per place. [2022-12-13 13:40:45,513 INFO L137 encePairwiseOnDemand]: 246/250 looper letters, 57 selfloop transitions, 7 changer transitions 0/72 dead transitions. [2022-12-13 13:40:45,513 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 72 transitions, 550 flow [2022-12-13 13:40:45,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:40:45,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:40:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2022-12-13 13:40:45,515 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.52 [2022-12-13 13:40:45,515 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 390 transitions. [2022-12-13 13:40:45,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 390 transitions. [2022-12-13 13:40:45,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:40:45,516 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 390 transitions. [2022-12-13 13:40:45,517 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.0) internal successors, (390), 3 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:45,518 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:45,518 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 250.0) internal successors, (1000), 4 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:45,518 INFO L175 Difference]: Start difference. First operand has 47 places, 45 transitions, 266 flow. Second operand 3 states and 390 transitions. [2022-12-13 13:40:45,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 72 transitions, 550 flow [2022-12-13 13:40:45,530 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 72 transitions, 545 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:40:45,531 INFO L231 Difference]: Finished difference. Result has 49 places, 51 transitions, 342 flow [2022-12-13 13:40:45,531 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=342, PETRI_PLACES=49, PETRI_TRANSITIONS=51} [2022-12-13 13:40:45,532 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 8 predicate places. [2022-12-13 13:40:45,532 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 51 transitions, 342 flow [2022-12-13 13:40:45,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:45,532 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:45,532 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:45,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:40:45,533 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:40:45,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:45,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1169546293, now seen corresponding path program 1 times [2022-12-13 13:40:45,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:45,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609338516] [2022-12-13 13:40:45,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:45,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:45,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:46,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:46,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:46,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609338516] [2022-12-13 13:40:46,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609338516] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:46,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:46,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:40:46,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153257062] [2022-12-13 13:40:46,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:46,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:40:46,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:46,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:40:46,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:40:46,106 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 250 [2022-12-13 13:40:46,106 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 51 transitions, 342 flow. Second operand has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:46,106 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:46,106 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 250 [2022-12-13 13:40:46,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:47,112 INFO L130 PetriNetUnfolder]: 8287/11714 cut-off events. [2022-12-13 13:40:47,112 INFO L131 PetriNetUnfolder]: For 19701/19707 co-relation queries the response was YES. [2022-12-13 13:40:47,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39826 conditions, 11714 events. 8287/11714 cut-off events. For 19701/19707 co-relation queries the response was YES. Maximal size of possible extension queue 460. Compared 63122 event pairs, 1673 based on Foata normal form. 134/11848 useless extension candidates. Maximal degree in co-relation 39806. Up to 5337 conditions per place. [2022-12-13 13:40:47,147 INFO L137 encePairwiseOnDemand]: 238/250 looper letters, 60 selfloop transitions, 29 changer transitions 2/92 dead transitions. [2022-12-13 13:40:47,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 92 transitions, 717 flow [2022-12-13 13:40:47,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:40:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:40:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 492 transitions. [2022-12-13 13:40:47,149 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.492 [2022-12-13 13:40:47,150 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 492 transitions. [2022-12-13 13:40:47,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 492 transitions. [2022-12-13 13:40:47,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:40:47,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 492 transitions. [2022-12-13 13:40:47,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.0) internal successors, (492), 4 states have internal predecessors, (492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:47,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:47,174 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:47,174 INFO L175 Difference]: Start difference. First operand has 49 places, 51 transitions, 342 flow. Second operand 4 states and 492 transitions. [2022-12-13 13:40:47,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 92 transitions, 717 flow [2022-12-13 13:40:47,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 92 transitions, 709 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:40:47,195 INFO L231 Difference]: Finished difference. Result has 54 places, 64 transitions, 580 flow [2022-12-13 13:40:47,195 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=580, PETRI_PLACES=54, PETRI_TRANSITIONS=64} [2022-12-13 13:40:47,196 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2022-12-13 13:40:47,196 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 64 transitions, 580 flow [2022-12-13 13:40:47,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.75) internal successors, (443), 4 states have internal predecessors, (443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:47,196 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:47,197 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:47,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:40:47,197 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:40:47,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:47,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1898630063, now seen corresponding path program 1 times [2022-12-13 13:40:47,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:47,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854301662] [2022-12-13 13:40:47,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:47,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:47,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:47,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:47,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:47,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854301662] [2022-12-13 13:40:47,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854301662] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:47,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:47,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:40:47,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157041278] [2022-12-13 13:40:47,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:47,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:40:47,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:47,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:40:47,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:40:47,398 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2022-12-13 13:40:47,399 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 64 transitions, 580 flow. Second operand has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:47,399 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:47,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2022-12-13 13:40:47,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:48,402 INFO L130 PetriNetUnfolder]: 5816/8671 cut-off events. [2022-12-13 13:40:48,402 INFO L131 PetriNetUnfolder]: For 38259/40211 co-relation queries the response was YES. [2022-12-13 13:40:48,414 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32597 conditions, 8671 events. 5816/8671 cut-off events. For 38259/40211 co-relation queries the response was YES. Maximal size of possible extension queue 561. Compared 53540 event pairs, 943 based on Foata normal form. 1652/10124 useless extension candidates. Maximal degree in co-relation 32573. Up to 5602 conditions per place. [2022-12-13 13:40:48,433 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 124 selfloop transitions, 10 changer transitions 6/157 dead transitions. [2022-12-13 13:40:48,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 157 transitions, 1659 flow [2022-12-13 13:40:48,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:40:48,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:40:48,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2022-12-13 13:40:48,435 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5072 [2022-12-13 13:40:48,435 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2022-12-13 13:40:48,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2022-12-13 13:40:48,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:40:48,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2022-12-13 13:40:48,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.8) internal successors, (634), 5 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:48,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:48,438 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 250.0) internal successors, (1500), 6 states have internal predecessors, (1500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:48,438 INFO L175 Difference]: Start difference. First operand has 54 places, 64 transitions, 580 flow. Second operand 5 states and 634 transitions. [2022-12-13 13:40:48,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 157 transitions, 1659 flow [2022-12-13 13:40:48,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 157 transitions, 1631 flow, removed 14 selfloop flow, removed 0 redundant places. [2022-12-13 13:40:48,452 INFO L231 Difference]: Finished difference. Result has 61 places, 72 transitions, 653 flow [2022-12-13 13:40:48,452 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=653, PETRI_PLACES=61, PETRI_TRANSITIONS=72} [2022-12-13 13:40:48,452 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2022-12-13 13:40:48,453 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 72 transitions, 653 flow [2022-12-13 13:40:48,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 117.75) internal successors, (471), 4 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:48,453 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:48,453 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:48,453 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:40:48,453 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:40:48,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:48,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1995775991, now seen corresponding path program 1 times [2022-12-13 13:40:48,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:48,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005397863] [2022-12-13 13:40:48,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:48,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:48,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:48,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:48,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005397863] [2022-12-13 13:40:48,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005397863] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:48,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:48,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:40:48,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228355645] [2022-12-13 13:40:48,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:48,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:40:48,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:48,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:40:48,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:40:48,992 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 250 [2022-12-13 13:40:48,992 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 72 transitions, 653 flow. Second operand has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:48,992 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:48,992 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 250 [2022-12-13 13:40:48,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:50,198 INFO L130 PetriNetUnfolder]: 8896/13299 cut-off events. [2022-12-13 13:40:50,198 INFO L131 PetriNetUnfolder]: For 54710/54734 co-relation queries the response was YES. [2022-12-13 13:40:50,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61981 conditions, 13299 events. 8896/13299 cut-off events. For 54710/54734 co-relation queries the response was YES. Maximal size of possible extension queue 634. Compared 82088 event pairs, 2258 based on Foata normal form. 102/13401 useless extension candidates. Maximal degree in co-relation 61952. Up to 6353 conditions per place. [2022-12-13 13:40:50,238 INFO L137 encePairwiseOnDemand]: 238/250 looper letters, 76 selfloop transitions, 25 changer transitions 29/131 dead transitions. [2022-12-13 13:40:50,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 131 transitions, 1309 flow [2022-12-13 13:40:50,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:40:50,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:40:50,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 493 transitions. [2022-12-13 13:40:50,240 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.493 [2022-12-13 13:40:50,240 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 493 transitions. [2022-12-13 13:40:50,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 493 transitions. [2022-12-13 13:40:50,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:40:50,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 493 transitions. [2022-12-13 13:40:50,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:50,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:50,242 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 250.0) internal successors, (1250), 5 states have internal predecessors, (1250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:50,242 INFO L175 Difference]: Start difference. First operand has 61 places, 72 transitions, 653 flow. Second operand 4 states and 493 transitions. [2022-12-13 13:40:50,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 131 transitions, 1309 flow [2022-12-13 13:40:50,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 131 transitions, 1253 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:40:50,323 INFO L231 Difference]: Finished difference. Result has 65 places, 68 transitions, 717 flow [2022-12-13 13:40:50,323 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=717, PETRI_PLACES=65, PETRI_TRANSITIONS=68} [2022-12-13 13:40:50,324 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 24 predicate places. [2022-12-13 13:40:50,324 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 68 transitions, 717 flow [2022-12-13 13:40:50,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.25) internal successors, (445), 4 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:50,324 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:50,324 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:50,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:40:50,325 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:40:50,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:50,325 INFO L85 PathProgramCache]: Analyzing trace with hash 426404558, now seen corresponding path program 1 times [2022-12-13 13:40:50,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:50,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93393617] [2022-12-13 13:40:50,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:50,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:50,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:50,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:50,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93393617] [2022-12-13 13:40:50,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93393617] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:50,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:50,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:40:50,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134726031] [2022-12-13 13:40:50,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:50,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:40:50,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:50,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:40:50,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:40:50,508 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2022-12-13 13:40:50,509 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 68 transitions, 717 flow. Second operand has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:50,509 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:50,510 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2022-12-13 13:40:50,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:51,371 INFO L130 PetriNetUnfolder]: 3662/5861 cut-off events. [2022-12-13 13:40:51,371 INFO L131 PetriNetUnfolder]: For 33161/34518 co-relation queries the response was YES. [2022-12-13 13:40:51,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26556 conditions, 5861 events. 3662/5861 cut-off events. For 33161/34518 co-relation queries the response was YES. Maximal size of possible extension queue 408. Compared 37956 event pairs, 364 based on Foata normal form. 1146/6884 useless extension candidates. Maximal degree in co-relation 26524. Up to 2687 conditions per place. [2022-12-13 13:40:51,391 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 143 selfloop transitions, 14 changer transitions 18/191 dead transitions. [2022-12-13 13:40:51,391 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 191 transitions, 2265 flow [2022-12-13 13:40:51,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:40:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:40:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 763 transitions. [2022-12-13 13:40:51,393 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5086666666666667 [2022-12-13 13:40:51,393 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 763 transitions. [2022-12-13 13:40:51,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 763 transitions. [2022-12-13 13:40:51,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:40:51,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 763 transitions. [2022-12-13 13:40:51,395 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.16666666666667) internal successors, (763), 6 states have internal predecessors, (763), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:51,396 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:51,397 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:51,397 INFO L175 Difference]: Start difference. First operand has 65 places, 68 transitions, 717 flow. Second operand 6 states and 763 transitions. [2022-12-13 13:40:51,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 191 transitions, 2265 flow [2022-12-13 13:40:51,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 191 transitions, 2251 flow, removed 7 selfloop flow, removed 1 redundant places. [2022-12-13 13:40:51,461 INFO L231 Difference]: Finished difference. Result has 70 places, 76 transitions, 826 flow [2022-12-13 13:40:51,461 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=703, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=826, PETRI_PLACES=70, PETRI_TRANSITIONS=76} [2022-12-13 13:40:51,461 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2022-12-13 13:40:51,461 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 76 transitions, 826 flow [2022-12-13 13:40:51,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 117.2) internal successors, (586), 5 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:51,462 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:51,462 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] [2022-12-13 13:40:51,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:40:51,462 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:40:51,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:51,462 INFO L85 PathProgramCache]: Analyzing trace with hash 779389561, now seen corresponding path program 1 times [2022-12-13 13:40:51,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:51,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911356132] [2022-12-13 13:40:51,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:51,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:51,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:51,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:51,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:51,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911356132] [2022-12-13 13:40:51,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911356132] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:51,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:51,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:40:51,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424629315] [2022-12-13 13:40:51,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:51,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:40:51,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:51,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:40:51,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:40:51,607 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2022-12-13 13:40:51,608 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 76 transitions, 826 flow. Second operand has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:51,608 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:51,608 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2022-12-13 13:40:51,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:52,241 INFO L130 PetriNetUnfolder]: 3145/5136 cut-off events. [2022-12-13 13:40:52,241 INFO L131 PetriNetUnfolder]: For 28544/29928 co-relation queries the response was YES. [2022-12-13 13:40:52,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26841 conditions, 5136 events. 3145/5136 cut-off events. For 28544/29928 co-relation queries the response was YES. Maximal size of possible extension queue 385. Compared 33713 event pairs, 188 based on Foata normal form. 818/5846 useless extension candidates. Maximal degree in co-relation 26805. Up to 2494 conditions per place. [2022-12-13 13:40:52,257 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 131 selfloop transitions, 22 changer transitions 56/223 dead transitions. [2022-12-13 13:40:52,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 223 transitions, 2690 flow [2022-12-13 13:40:52,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:40:52,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:40:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1016 transitions. [2022-12-13 13:40:52,259 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.508 [2022-12-13 13:40:52,259 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1016 transitions. [2022-12-13 13:40:52,259 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1016 transitions. [2022-12-13 13:40:52,259 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:40:52,260 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1016 transitions. [2022-12-13 13:40:52,261 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 127.0) internal successors, (1016), 8 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:52,262 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:52,263 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:52,263 INFO L175 Difference]: Start difference. First operand has 70 places, 76 transitions, 826 flow. Second operand 8 states and 1016 transitions. [2022-12-13 13:40:52,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 223 transitions, 2690 flow [2022-12-13 13:40:52,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 223 transitions, 2634 flow, removed 18 selfloop flow, removed 3 redundant places. [2022-12-13 13:40:52,469 INFO L231 Difference]: Finished difference. Result has 77 places, 79 transitions, 864 flow [2022-12-13 13:40:52,469 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=738, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=864, PETRI_PLACES=77, PETRI_TRANSITIONS=79} [2022-12-13 13:40:52,470 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 36 predicate places. [2022-12-13 13:40:52,470 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 79 transitions, 864 flow [2022-12-13 13:40:52,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 117.0) internal successors, (702), 6 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:52,470 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:52,470 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:52,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:40:52,470 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:40:52,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:52,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1718655896, now seen corresponding path program 1 times [2022-12-13 13:40:52,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:52,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36906880] [2022-12-13 13:40:52,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:52,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:52,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:52,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:52,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:52,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36906880] [2022-12-13 13:40:52,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36906880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:52,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:52,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:40:52,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649547851] [2022-12-13 13:40:52,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:52,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:40:52,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:52,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:40:52,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:40:52,632 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2022-12-13 13:40:52,633 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 79 transitions, 864 flow. Second operand has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:52,633 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:52,633 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2022-12-13 13:40:52,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:53,270 INFO L130 PetriNetUnfolder]: 2885/4803 cut-off events. [2022-12-13 13:40:53,270 INFO L131 PetriNetUnfolder]: For 26382/27172 co-relation queries the response was YES. [2022-12-13 13:40:53,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25177 conditions, 4803 events. 2885/4803 cut-off events. For 26382/27172 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 32299 event pairs, 172 based on Foata normal form. 435/5132 useless extension candidates. Maximal degree in co-relation 25139. Up to 1767 conditions per place. [2022-12-13 13:40:53,284 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 82 selfloop transitions, 21 changer transitions 102/214 dead transitions. [2022-12-13 13:40:53,284 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 214 transitions, 2600 flow [2022-12-13 13:40:53,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:40:53,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:40:53,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1244 transitions. [2022-12-13 13:40:53,286 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4976 [2022-12-13 13:40:53,286 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1244 transitions. [2022-12-13 13:40:53,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1244 transitions. [2022-12-13 13:40:53,287 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:40:53,287 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1244 transitions. [2022-12-13 13:40:53,288 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 124.4) internal successors, (1244), 10 states have internal predecessors, (1244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:53,290 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 250.0) internal successors, (2750), 11 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:53,290 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 250.0) internal successors, (2750), 11 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:53,290 INFO L175 Difference]: Start difference. First operand has 77 places, 79 transitions, 864 flow. Second operand 10 states and 1244 transitions. [2022-12-13 13:40:53,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 214 transitions, 2600 flow [2022-12-13 13:40:53,696 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 214 transitions, 2407 flow, removed 44 selfloop flow, removed 6 redundant places. [2022-12-13 13:40:53,698 INFO L231 Difference]: Finished difference. Result has 83 places, 58 transitions, 545 flow [2022-12-13 13:40:53,698 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=739, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=545, PETRI_PLACES=83, PETRI_TRANSITIONS=58} [2022-12-13 13:40:53,698 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 42 predicate places. [2022-12-13 13:40:53,698 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 58 transitions, 545 flow [2022-12-13 13:40:53,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:53,699 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:53,699 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:53,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:40:53,699 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:40:53,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:53,699 INFO L85 PathProgramCache]: Analyzing trace with hash -59233089, now seen corresponding path program 1 times [2022-12-13 13:40:53,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:53,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674134735] [2022-12-13 13:40:53,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:53,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:54,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:54,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:54,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674134735] [2022-12-13 13:40:54,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674134735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:54,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:54,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:40:54,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365947683] [2022-12-13 13:40:54,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:54,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:40:54,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:54,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:40:54,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:40:54,214 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 250 [2022-12-13 13:40:54,214 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 58 transitions, 545 flow. Second operand has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:54,215 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:54,215 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 250 [2022-12-13 13:40:54,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:54,502 INFO L130 PetriNetUnfolder]: 728/1304 cut-off events. [2022-12-13 13:40:54,503 INFO L131 PetriNetUnfolder]: For 6480/6496 co-relation queries the response was YES. [2022-12-13 13:40:54,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6790 conditions, 1304 events. 728/1304 cut-off events. For 6480/6496 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 6623 event pairs, 68 based on Foata normal form. 1/1297 useless extension candidates. Maximal degree in co-relation 6751. Up to 661 conditions per place. [2022-12-13 13:40:54,506 INFO L137 encePairwiseOnDemand]: 239/250 looper letters, 43 selfloop transitions, 9 changer transitions 67/120 dead transitions. [2022-12-13 13:40:54,506 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 120 transitions, 1294 flow [2022-12-13 13:40:54,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:40:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:40:54,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions. [2022-12-13 13:40:54,508 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.464 [2022-12-13 13:40:54,508 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 696 transitions. [2022-12-13 13:40:54,508 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 696 transitions. [2022-12-13 13:40:54,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:40:54,509 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 696 transitions. [2022-12-13 13:40:54,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:54,511 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:54,511 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 250.0) internal successors, (1750), 7 states have internal predecessors, (1750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:54,511 INFO L175 Difference]: Start difference. First operand has 83 places, 58 transitions, 545 flow. Second operand 6 states and 696 transitions. [2022-12-13 13:40:54,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 120 transitions, 1294 flow [2022-12-13 13:40:54,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 120 transitions, 1037 flow, removed 44 selfloop flow, removed 17 redundant places. [2022-12-13 13:40:54,524 INFO L231 Difference]: Finished difference. Result has 70 places, 42 transitions, 294 flow [2022-12-13 13:40:54,524 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=294, PETRI_PLACES=70, PETRI_TRANSITIONS=42} [2022-12-13 13:40:54,525 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 29 predicate places. [2022-12-13 13:40:54,525 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 42 transitions, 294 flow [2022-12-13 13:40:54,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.0) internal successors, (550), 5 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:54,525 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:54,525 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:54,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:40:54,525 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:40:54,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:54,526 INFO L85 PathProgramCache]: Analyzing trace with hash -776777079, now seen corresponding path program 2 times [2022-12-13 13:40:54,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:54,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436731526] [2022-12-13 13:40:54,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:54,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:54,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:40:55,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:40:55,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:40:55,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436731526] [2022-12-13 13:40:55,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436731526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:40:55,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:40:55,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:40:55,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099990763] [2022-12-13 13:40:55,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:40:55,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:40:55,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:40:55,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:40:55,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:40:55,340 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 250 [2022-12-13 13:40:55,341 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 42 transitions, 294 flow. Second operand has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:55,341 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:40:55,341 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 250 [2022-12-13 13:40:55,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:40:55,645 INFO L130 PetriNetUnfolder]: 164/314 cut-off events. [2022-12-13 13:40:55,645 INFO L131 PetriNetUnfolder]: For 1009/1016 co-relation queries the response was YES. [2022-12-13 13:40:55,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1377 conditions, 314 events. 164/314 cut-off events. For 1009/1016 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1138 event pairs, 20 based on Foata normal form. 2/312 useless extension candidates. Maximal degree in co-relation 1356. Up to 152 conditions per place. [2022-12-13 13:40:55,646 INFO L137 encePairwiseOnDemand]: 243/250 looper letters, 41 selfloop transitions, 4 changer transitions 37/85 dead transitions. [2022-12-13 13:40:55,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 85 transitions, 727 flow [2022-12-13 13:40:55,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:40:55,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:40:55,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 955 transitions. [2022-12-13 13:40:55,649 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4775 [2022-12-13 13:40:55,649 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 955 transitions. [2022-12-13 13:40:55,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 955 transitions. [2022-12-13 13:40:55,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:40:55,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 955 transitions. [2022-12-13 13:40:55,652 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 119.375) internal successors, (955), 8 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:55,654 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:55,655 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 250.0) internal successors, (2250), 9 states have internal predecessors, (2250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:55,655 INFO L175 Difference]: Start difference. First operand has 70 places, 42 transitions, 294 flow. Second operand 8 states and 955 transitions. [2022-12-13 13:40:55,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 85 transitions, 727 flow [2022-12-13 13:40:55,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 85 transitions, 630 flow, removed 11 selfloop flow, removed 13 redundant places. [2022-12-13 13:40:55,659 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 211 flow [2022-12-13 13:40:55,659 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=211, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2022-12-13 13:40:55,660 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2022-12-13 13:40:55,660 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 211 flow [2022-12-13 13:40:55,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:40:55,661 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:40:55,661 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:55,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:40:55,661 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-12-13 13:40:55,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:40:55,661 INFO L85 PathProgramCache]: Analyzing trace with hash 958373871, now seen corresponding path program 3 times [2022-12-13 13:40:55,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:40:55,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885521812] [2022-12-13 13:40:55,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:40:55,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:40:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:40:55,709 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:40:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:40:55,778 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:40:55,778 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 13:40:55,779 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-12-13 13:40:55,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-12-13 13:40:55,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-12-13 13:40:55,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-12-13 13:40:55,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-12-13 13:40:55,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-12-13 13:40:55,781 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-12-13 13:40:55,782 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:40:55,782 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:40:55,786 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:40:55,786 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:40:55,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:40:55 BasicIcfg [2022-12-13 13:40:55,843 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:40:55,844 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:40:55,844 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:40:55,844 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:40:55,844 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:40:36" (3/4) ... [2022-12-13 13:40:55,846 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-13 13:40:55,916 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 13:40:55,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:40:55,917 INFO L158 Benchmark]: Toolchain (without parser) took 20738.87ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 108.4MB in the beginning and 918.8MB in the end (delta: -810.4MB). Peak memory consumption was 337.7MB. Max. memory is 16.1GB. [2022-12-13 13:40:55,917 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 151.0MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:40:55,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 392.97ms. Allocated memory is still 151.0MB. Free memory was 107.9MB in the beginning and 79.5MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-13 13:40:55,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.11ms. Allocated memory is still 151.0MB. Free memory was 79.5MB in the beginning and 76.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:40:55,918 INFO L158 Benchmark]: Boogie Preprocessor took 21.85ms. Allocated memory is still 151.0MB. Free memory was 76.4MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:40:55,918 INFO L158 Benchmark]: RCFGBuilder took 507.25ms. Allocated memory is still 151.0MB. Free memory was 74.3MB in the beginning and 99.8MB in the end (delta: -25.4MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. [2022-12-13 13:40:55,919 INFO L158 Benchmark]: TraceAbstraction took 19704.44ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 99.0MB in the beginning and 933.5MB in the end (delta: -834.5MB). Peak memory consumption was 311.3MB. Max. memory is 16.1GB. [2022-12-13 13:40:55,919 INFO L158 Benchmark]: Witness Printer took 72.74ms. Allocated memory is still 1.3GB. Free memory was 933.5MB in the beginning and 918.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 13:40:55,920 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.17ms. Allocated memory is still 151.0MB. Free memory is still 120.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 392.97ms. Allocated memory is still 151.0MB. Free memory was 107.9MB in the beginning and 79.5MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.11ms. Allocated memory is still 151.0MB. Free memory was 79.5MB in the beginning and 76.4MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.85ms. Allocated memory is still 151.0MB. Free memory was 76.4MB in the beginning and 74.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 507.25ms. Allocated memory is still 151.0MB. Free memory was 74.3MB in the beginning and 99.8MB in the end (delta: -25.4MB). Peak memory consumption was 28.5MB. Max. memory is 16.1GB. * TraceAbstraction took 19704.44ms. Allocated memory was 151.0MB in the beginning and 1.3GB in the end (delta: 1.1GB). Free memory was 99.0MB in the beginning and 933.5MB in the end (delta: -834.5MB). Peak memory consumption was 311.3MB. Max. memory is 16.1GB. * Witness Printer took 72.74ms. Allocated memory is still 1.3GB. Free memory was 933.5MB in the beginning and 918.8MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4.1s, 141 PlacesBefore, 41 PlacesAfterwards, 130 TransitionsBefore, 28 TransitionsAfterwards, 3060 CoEnabledTransitionPairs, 7 FixpointIterations, 44 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 2 ChoiceCompositions, 116 TotalNumberOfCompositions, 7866 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3577, independent: 3363, independent conditional: 0, independent unconditional: 3363, dependent: 214, dependent conditional: 0, dependent unconditional: 214, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1649, independent: 1601, independent conditional: 0, independent unconditional: 1601, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3577, independent: 1762, independent conditional: 0, independent unconditional: 1762, dependent: 166, dependent conditional: 0, dependent unconditional: 166, unknown: 1649, unknown conditional: 0, unknown unconditional: 1649] , Statistics on independence cache: Total cache size (in pairs): 125, Positive cache size: 102, Positive conditional cache size: 0, Positive unconditional cache size: 102, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L724] 0 int z = 0; [L725] 0 _Bool z$flush_delayed; [L726] 0 int z$mem_tmp; [L727] 0 _Bool z$r_buff0_thd0; [L728] 0 _Bool z$r_buff0_thd1; [L729] 0 _Bool z$r_buff0_thd2; [L730] 0 _Bool z$r_buff0_thd3; [L731] 0 _Bool z$r_buff0_thd4; [L732] 0 _Bool z$r_buff1_thd0; [L733] 0 _Bool z$r_buff1_thd1; [L734] 0 _Bool z$r_buff1_thd2; [L735] 0 _Bool z$r_buff1_thd3; [L736] 0 _Bool z$r_buff1_thd4; [L737] 0 _Bool z$read_delayed; [L738] 0 int *z$read_delayed_var; [L739] 0 int z$w_buff0; [L740] 0 _Bool z$w_buff0_used; [L741] 0 int z$w_buff1; [L742] 0 _Bool z$w_buff1_used; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L852] 0 pthread_t t825; [L853] FCALL, FORK 0 pthread_create(&t825, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t825, ((void *)0), P0, ((void *)0))=-3, t825={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L854] 0 pthread_t t826; [L855] FCALL, FORK 0 pthread_create(&t826, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t826, ((void *)0), P1, ((void *)0))=-2, t825={5:0}, t826={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L856] 0 pthread_t t827; [L857] FCALL, FORK 0 pthread_create(&t827, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t827, ((void *)0), P2, ((void *)0))=-1, t825={5:0}, t826={6:0}, t827={7: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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L858] 0 pthread_t t828; [L859] FCALL, FORK 0 pthread_create(&t828, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t828, ((void *)0), P3, ((void *)0))=0, t825={5:0}, t826={6:0}, t827={7:0}, t828={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_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=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] [L798] 4 z$w_buff1 = z$w_buff0 [L799] 4 z$w_buff0 = 2 [L800] 4 z$w_buff1_used = z$w_buff0_used [L801] 4 z$w_buff0_used = (_Bool)1 [L802] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L802] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L803] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L804] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L805] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L806] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L807] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L808] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L812] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L813] 4 z$flush_delayed = weak$$choice2 [L814] 4 z$mem_tmp = z [L815] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L816] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L817] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L818] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L819] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L821] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L822] 4 __unbuffered_p3_EAX = z [L823] 4 z = z$flush_delayed ? z$mem_tmp : z [L824] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=50, weak$$choice2=255, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L827] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=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=50, weak$$choice2=255, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=50, weak$$choice2=255, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=50, weak$$choice2=255, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=50, weak$$choice2=255, x=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, 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=50, weak$$choice2=255, x=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_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=50, weak$$choice2=255, x=2, y=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L773] 2 return 0; [L781] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_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=50, weak$$choice2=255, x=2, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 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) [L785] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L786] 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 [L787] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L788] 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}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_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=50, weak$$choice2=255, x=2, y=2, 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=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L830] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L831] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L832] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L833] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L834] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L839] 4 return 0; [L791] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L793] 3 return 0; [L861] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L863] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L863] RET 0 assume_abort_if_not(main$tmp_guard0) [L865] 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) [L866] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L867] 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 [L868] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L869] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_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=1, main$tmp_guard1=0, t825={5:0}, t826={6:0}, t827={7:0}, t828={3:0}, weak$$choice0=50, weak$$choice2=255, x=2, y=2, z=2, 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_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L872] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L873] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L874] 0 z$flush_delayed = weak$$choice2 [L875] 0 z$mem_tmp = z [L876] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L877] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L878] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L879] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L880] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L882] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L883] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L884] 0 z = z$flush_delayed ? z$mem_tmp : z [L885] 0 z$flush_delayed = (_Bool)0 [L887] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, 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: 859]: 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: 853]: 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: 857]: 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: 855]: 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 9 procedures, 169 locations, 7 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: 19.6s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 10.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 763 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 590 mSDsluCounter, 319 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 237 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1432 IncrementalHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 82 mSDtfsCounter, 1432 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=864occurred in iteration=9, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 193 ConstructedInterpolants, 0 QuantifiedInterpolants, 1737 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-13 13:40:55,936 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5b1cfd24-4de3-4ec1-a37f-ede32ad8fdb9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE