./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/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_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 --- 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 15:41:53,087 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:41:53,089 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:41:53,101 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:41:53,101 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:41:53,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:41:53,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:41:53,104 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:41:53,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:41:53,105 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:41:53,106 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:41:53,107 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:41:53,107 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:41:53,107 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:41:53,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:41:53,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:41:53,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:41:53,110 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:41:53,111 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:41:53,112 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:41:53,113 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:41:53,114 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:41:53,115 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:41:53,115 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:41:53,117 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:41:53,118 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:41:53,118 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:41:53,118 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:41:53,119 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:41:53,119 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:41:53,119 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:41:53,120 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:41:53,120 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:41:53,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:41:53,122 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:41:53,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:41:53,122 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:41:53,122 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:41:53,122 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:41:53,123 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:41:53,123 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:41:53,124 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 15:41:53,138 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:41:53,138 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:41:53,138 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:41:53,139 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:41:53,139 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:41:53,139 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:41:53,140 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:41:53,140 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:41:53,140 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:41:53,140 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:41:53,140 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:41:53,140 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:41:53,140 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:41:53,140 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:41:53,140 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:41:53,140 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 15:41:53,140 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 15:41:53,141 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 15:41:53,141 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:41:53,141 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 15:41:53,141 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:41:53,141 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:41:53,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:41:53,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:41:53,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:41:53,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:41:53,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:41:53,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:41:53,142 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 15:41:53,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 15:41:53,142 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:41:53,142 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:41:53,142 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:41:53,142 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:41:53,142 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_a33a70d5-1ce7-4918-9900-79001c2812fd/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_a33a70d5-1ce7-4918-9900-79001c2812fd/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 [2022-12-13 15:41:53,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:41:53,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:41:53,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:41:53,322 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:41:53,323 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:41:53,324 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-12-13 15:41:55,967 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:41:56,167 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:41:56,168 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-12-13 15:41:56,176 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/data/a690282c5/88dc3116df4a4c1a921af078d2b20132/FLAG117df9dc1 [2022-12-13 15:41:56,187 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/data/a690282c5/88dc3116df4a4c1a921af078d2b20132 [2022-12-13 15:41:56,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:41:56,190 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:41:56,191 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:41:56,191 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:41:56,193 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:41:56,194 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:41:56" (1/1) ... [2022-12-13 15:41:56,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@140a248d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:56, skipping insertion in model container [2022-12-13 15:41:56,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:41:56" (1/1) ... [2022-12-13 15:41:56,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:41:56,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:41:56,341 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_a33a70d5-1ce7-4918-9900-79001c2812fd/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-12-13 15:41:56,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,479 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,481 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,483 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:41:56,491 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:41:56,500 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_a33a70d5-1ce7-4918-9900-79001c2812fd/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-12-13 15:41:56,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,523 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:41:56,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:41:56,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:41:56,560 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:41:56,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:56 WrapperNode [2022-12-13 15:41:56,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:41:56,561 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:41:56,561 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:41:56,561 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:41:56,566 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:56" (1/1) ... [2022-12-13 15:41:56,581 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:56" (1/1) ... [2022-12-13 15:41:56,603 INFO L138 Inliner]: procedures = 176, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2022-12-13 15:41:56,604 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:41:56,604 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:41:56,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:41:56,605 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:41:56,614 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:56" (1/1) ... [2022-12-13 15:41:56,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:56" (1/1) ... [2022-12-13 15:41:56,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:56" (1/1) ... [2022-12-13 15:41:56,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:56" (1/1) ... [2022-12-13 15:41:56,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:56" (1/1) ... [2022-12-13 15:41:56,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:56" (1/1) ... [2022-12-13 15:41:56,629 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:56" (1/1) ... [2022-12-13 15:41:56,631 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:56" (1/1) ... [2022-12-13 15:41:56,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:41:56,635 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:41:56,635 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:41:56,635 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:41:56,636 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:56" (1/1) ... [2022-12-13 15:41:56,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:41:56,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:41:56,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:41:56,664 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:41:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 15:41:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 15:41:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:41:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:41:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:41:56,698 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 15:41:56,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 15:41:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 15:41:56,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 15:41:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 15:41:56,699 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 15:41:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 15:41:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 15:41:56,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:41:56,700 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:41:56,701 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 15:41:56,814 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:41:56,816 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:41:57,114 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:41:57,217 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:41:57,218 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 15:41:57,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:41:57 BoogieIcfgContainer [2022-12-13 15:41:57,220 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:41:57,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:41:57,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:41:57,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:41:57,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:41:56" (1/3) ... [2022-12-13 15:41:57,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a26181e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:41:57, skipping insertion in model container [2022-12-13 15:41:57,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:41:56" (2/3) ... [2022-12-13 15:41:57,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a26181e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:41:57, skipping insertion in model container [2022-12-13 15:41:57,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:41:57" (3/3) ... [2022-12-13 15:41:57,229 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2022-12-13 15:41:57,244 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:41:57,244 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-13 15:41:57,245 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 15:41:57,293 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 15:41:57,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 134 transitions, 283 flow [2022-12-13 15:41:57,373 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-12-13 15:41:57,374 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:41:57,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-13 15:41:57,379 INFO L82 GeneralOperation]: Start removeDead. Operand has 142 places, 134 transitions, 283 flow [2022-12-13 15:41:57,383 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 139 places, 131 transitions, 271 flow [2022-12-13 15:41:57,387 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 15:41:57,397 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 139 places, 131 transitions, 271 flow [2022-12-13 15:41:57,400 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 139 places, 131 transitions, 271 flow [2022-12-13 15:41:57,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 139 places, 131 transitions, 271 flow [2022-12-13 15:41:57,427 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-12-13 15:41:57,427 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:41:57,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-13 15:41:57,430 INFO L119 LiptonReduction]: Number of co-enabled transitions 2824 [2022-12-13 15:42:00,403 INFO L134 LiptonReduction]: Checked pairs total: 7687 [2022-12-13 15:42:00,403 INFO L136 LiptonReduction]: Total number of compositions: 130 [2022-12-13 15:42:00,416 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:42:00,421 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@62bb7e8f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:42:00,421 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 15:42:00,422 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 15:42:00,422 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:42:00,422 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:00,423 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 15:42:00,423 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:00,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:00,427 INFO L85 PathProgramCache]: Analyzing trace with hash 569, now seen corresponding path program 1 times [2022-12-13 15:42:00,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:00,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514340825] [2022-12-13 15:42:00,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:00,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:00,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:00,521 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 15:42:00,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:00,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514340825] [2022-12-13 15:42:00,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514340825] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:00,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:00,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 15:42:00,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025626332] [2022-12-13 15:42:00,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:00,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 15:42:00,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:00,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 15:42:00,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 15:42:00,546 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 264 [2022-12-13 15:42:00,548 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 2 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 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 15:42:00,548 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:00,548 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 264 [2022-12-13 15:42:00,549 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:00,907 INFO L130 PetriNetUnfolder]: 2255/3314 cut-off events. [2022-12-13 15:42:00,907 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 15:42:00,915 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6657 conditions, 3314 events. 2255/3314 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 17044 event pairs, 2255 based on Foata normal form. 120/2846 useless extension candidates. Maximal degree in co-relation 6646. Up to 3277 conditions per place. [2022-12-13 15:42:00,927 INFO L137 encePairwiseOnDemand]: 257/264 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2022-12-13 15:42:00,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 117 flow [2022-12-13 15:42:00,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 15:42:00,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 15:42:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 274 transitions. [2022-12-13 15:42:00,952 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5189393939393939 [2022-12-13 15:42:00,952 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 274 transitions. [2022-12-13 15:42:00,953 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 274 transitions. [2022-12-13 15:42:00,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:00,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 274 transitions. [2022-12-13 15:42:00,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 137.0) internal successors, (274), 2 states have internal predecessors, (274), 0 states have call successors, (0), 0 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 15:42:00,963 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 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 15:42:00,964 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 264.0) internal successors, (792), 3 states have internal predecessors, (792), 0 states have call successors, (0), 0 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 15:42:00,965 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 2 states and 274 transitions. [2022-12-13 15:42:00,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 117 flow [2022-12-13 15:42:00,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:42:00,969 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2022-12-13 15:42:00,971 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-13 15:42:00,974 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2022-12-13 15:42:00,974 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 64 flow [2022-12-13 15:42:00,975 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 0 states have call successors, (0), 0 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 15:42:00,975 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:00,975 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:42:00,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 15:42:00,975 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:00,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:00,976 INFO L85 PathProgramCache]: Analyzing trace with hash 560922, now seen corresponding path program 1 times [2022-12-13 15:42:00,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:00,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723450128] [2022-12-13 15:42:00,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:00,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:01,189 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 15:42:01,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:01,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723450128] [2022-12-13 15:42:01,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723450128] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:01,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:01,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:42:01,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70374785] [2022-12-13 15:42:01,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:01,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:42:01,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:01,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:42:01,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:42:01,194 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 264 [2022-12-13 15:42:01,195 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 64 flow. Second operand has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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 15:42:01,195 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:01,195 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 264 [2022-12-13 15:42:01,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:01,581 INFO L130 PetriNetUnfolder]: 1851/2749 cut-off events. [2022-12-13 15:42:01,582 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:42:01,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5506 conditions, 2749 events. 1851/2749 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 13795 event pairs, 823 based on Foata normal form. 0/2436 useless extension candidates. Maximal degree in co-relation 5503. Up to 2297 conditions per place. [2022-12-13 15:42:01,590 INFO L137 encePairwiseOnDemand]: 261/264 looper letters, 36 selfloop transitions, 2 changer transitions 4/46 dead transitions. [2022-12-13 15:42:01,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 186 flow [2022-12-13 15:42:01,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:42:01,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:42:01,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2022-12-13 15:42:01,593 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5088383838383839 [2022-12-13 15:42:01,593 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 403 transitions. [2022-12-13 15:42:01,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 403 transitions. [2022-12-13 15:42:01,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:01,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 403 transitions. [2022-12-13 15:42:01,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.33333333333334) internal successors, (403), 3 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:01,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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 15:42:01,596 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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 15:42:01,596 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 64 flow. Second operand 3 states and 403 transitions. [2022-12-13 15:42:01,596 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 186 flow [2022-12-13 15:42:01,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 15:42:01,597 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 62 flow [2022-12-13 15:42:01,597 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-12-13 15:42:01,597 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, -7 predicate places. [2022-12-13 15:42:01,597 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 62 flow [2022-12-13 15:42:01,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.0) internal successors, (363), 3 states have internal predecessors, (363), 0 states have call successors, (0), 0 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 15:42:01,598 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:01,598 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:01,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 15:42:01,598 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:01,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:01,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1550626885, now seen corresponding path program 1 times [2022-12-13 15:42:01,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:01,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963706719] [2022-12-13 15:42:01,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:01,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:01,772 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 15:42:01,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:01,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963706719] [2022-12-13 15:42:01,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963706719] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:01,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:01,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:42:01,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096401495] [2022-12-13 15:42:01,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:01,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:42:01,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:01,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:42:01,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:42:01,795 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 264 [2022-12-13 15:42:01,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 62 flow. Second operand has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 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 15:42:01,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:01,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 264 [2022-12-13 15:42:01,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:02,376 INFO L130 PetriNetUnfolder]: 3955/5744 cut-off events. [2022-12-13 15:42:02,376 INFO L131 PetriNetUnfolder]: For 289/289 co-relation queries the response was YES. [2022-12-13 15:42:02,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11869 conditions, 5744 events. 3955/5744 cut-off events. For 289/289 co-relation queries the response was YES. Maximal size of possible extension queue 216. Compared 27483 event pairs, 2123 based on Foata normal form. 0/5536 useless extension candidates. Maximal degree in co-relation 11865. Up to 4365 conditions per place. [2022-12-13 15:42:02,394 INFO L137 encePairwiseOnDemand]: 258/264 looper letters, 54 selfloop transitions, 8 changer transitions 0/62 dead transitions. [2022-12-13 15:42:02,394 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 62 transitions, 268 flow [2022-12-13 15:42:02,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:42:02,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:42:02,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 609 transitions. [2022-12-13 15:42:02,396 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46136363636363636 [2022-12-13 15:42:02,396 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 609 transitions. [2022-12-13 15:42:02,396 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 609 transitions. [2022-12-13 15:42:02,396 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:02,396 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 609 transitions. [2022-12-13 15:42:02,397 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 121.8) internal successors, (609), 5 states have internal predecessors, (609), 0 states have call successors, (0), 0 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 15:42:02,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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 15:42:02,400 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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 15:42:02,400 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 62 flow. Second operand 5 states and 609 transitions. [2022-12-13 15:42:02,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 62 transitions, 268 flow [2022-12-13 15:42:02,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 62 transitions, 258 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:42:02,401 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 118 flow [2022-12-13 15:42:02,402 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2022-12-13 15:42:02,402 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, -4 predicate places. [2022-12-13 15:42:02,402 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 118 flow [2022-12-13 15:42:02,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.5) internal successors, (446), 4 states have internal predecessors, (446), 0 states have call successors, (0), 0 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 15:42:02,402 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:02,402 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:02,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 15:42:02,403 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:02,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:02,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1550626948, now seen corresponding path program 1 times [2022-12-13 15:42:02,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:02,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644640654] [2022-12-13 15:42:02,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:02,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:02,683 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 15:42:02,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:02,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644640654] [2022-12-13 15:42:02,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644640654] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:02,683 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:02,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:42:02,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75987583] [2022-12-13 15:42:02,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:02,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:42:02,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:02,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:42:02,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:42:02,841 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 264 [2022-12-13 15:42:02,842 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 118 flow. Second operand has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:02,842 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:02,842 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 264 [2022-12-13 15:42:02,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:03,321 INFO L130 PetriNetUnfolder]: 2548/4016 cut-off events. [2022-12-13 15:42:03,321 INFO L131 PetriNetUnfolder]: For 1289/1313 co-relation queries the response was YES. [2022-12-13 15:42:03,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9298 conditions, 4016 events. 2548/4016 cut-off events. For 1289/1313 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 23976 event pairs, 1231 based on Foata normal form. 254/4153 useless extension candidates. Maximal degree in co-relation 9291. Up to 1518 conditions per place. [2022-12-13 15:42:03,333 INFO L137 encePairwiseOnDemand]: 259/264 looper letters, 52 selfloop transitions, 8 changer transitions 4/70 dead transitions. [2022-12-13 15:42:03,333 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 70 transitions, 344 flow [2022-12-13 15:42:03,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:42:03,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 15:42:03,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions. [2022-12-13 15:42:03,335 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4393939393939394 [2022-12-13 15:42:03,335 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 696 transitions. [2022-12-13 15:42:03,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 696 transitions. [2022-12-13 15:42:03,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:03,336 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 696 transitions. [2022-12-13 15:42:03,337 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 15:42:03,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 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 15:42:03,339 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 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 15:42:03,339 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 118 flow. Second operand 6 states and 696 transitions. [2022-12-13 15:42:03,339 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 70 transitions, 344 flow [2022-12-13 15:42:03,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 70 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:42:03,342 INFO L231 Difference]: Finished difference. Result has 49 places, 34 transitions, 144 flow [2022-12-13 15:42:03,342 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=144, PETRI_PLACES=49, PETRI_TRANSITIONS=34} [2022-12-13 15:42:03,342 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 4 predicate places. [2022-12-13 15:42:03,342 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 34 transitions, 144 flow [2022-12-13 15:42:03,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.66666666666667) internal successors, (646), 6 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:03,343 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:03,343 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:03,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 15:42:03,343 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:03,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash -836559597, now seen corresponding path program 1 times [2022-12-13 15:42:03,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:03,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785692727] [2022-12-13 15:42:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:03,449 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 15:42:03,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:03,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785692727] [2022-12-13 15:42:03,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785692727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:03,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:03,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:42:03,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929447240] [2022-12-13 15:42:03,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:03,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:42:03,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:03,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:42:03,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:42:03,469 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 264 [2022-12-13 15:42:03,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 34 transitions, 144 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 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 15:42:03,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:03,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 264 [2022-12-13 15:42:03,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:04,185 INFO L130 PetriNetUnfolder]: 4785/7030 cut-off events. [2022-12-13 15:42:04,185 INFO L131 PetriNetUnfolder]: For 4433/4433 co-relation queries the response was YES. [2022-12-13 15:42:04,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17553 conditions, 7030 events. 4785/7030 cut-off events. For 4433/4433 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 36289 event pairs, 1426 based on Foata normal form. 336/7366 useless extension candidates. Maximal degree in co-relation 17542. Up to 4501 conditions per place. [2022-12-13 15:42:04,205 INFO L137 encePairwiseOnDemand]: 260/264 looper letters, 68 selfloop transitions, 5 changer transitions 4/77 dead transitions. [2022-12-13 15:42:04,205 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 77 transitions, 442 flow [2022-12-13 15:42:04,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:42:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:42:04,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 615 transitions. [2022-12-13 15:42:04,216 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4659090909090909 [2022-12-13 15:42:04,216 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 615 transitions. [2022-12-13 15:42:04,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 615 transitions. [2022-12-13 15:42:04,217 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:04,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 615 transitions. [2022-12-13 15:42:04,219 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 123.0) internal successors, (615), 5 states have internal predecessors, (615), 0 states have call successors, (0), 0 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 15:42:04,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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 15:42:04,224 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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 15:42:04,224 INFO L175 Difference]: Start difference. First operand has 49 places, 34 transitions, 144 flow. Second operand 5 states and 615 transitions. [2022-12-13 15:42:04,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 77 transitions, 442 flow [2022-12-13 15:42:04,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 77 transitions, 434 flow, removed 2 selfloop flow, removed 2 redundant places. [2022-12-13 15:42:04,252 INFO L231 Difference]: Finished difference. Result has 52 places, 36 transitions, 169 flow [2022-12-13 15:42:04,252 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=136, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=52, PETRI_TRANSITIONS=36} [2022-12-13 15:42:04,253 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 7 predicate places. [2022-12-13 15:42:04,253 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 36 transitions, 169 flow [2022-12-13 15:42:04,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 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 15:42:04,253 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:04,253 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:04,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 15:42:04,253 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:04,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:04,253 INFO L85 PathProgramCache]: Analyzing trace with hash -836559534, now seen corresponding path program 1 times [2022-12-13 15:42:04,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:04,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777084263] [2022-12-13 15:42:04,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:04,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:04,547 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 15:42:04,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:04,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777084263] [2022-12-13 15:42:04,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777084263] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:04,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:04,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:42:04,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721571960] [2022-12-13 15:42:04,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:04,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:42:04,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:04,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:42:04,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:42:04,676 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 264 [2022-12-13 15:42:04,676 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 36 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 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 15:42:04,676 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:04,676 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 264 [2022-12-13 15:42:04,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:05,090 INFO L130 PetriNetUnfolder]: 2365/3656 cut-off events. [2022-12-13 15:42:05,090 INFO L131 PetriNetUnfolder]: For 3473/3539 co-relation queries the response was YES. [2022-12-13 15:42:05,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9516 conditions, 3656 events. 2365/3656 cut-off events. For 3473/3539 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 20825 event pairs, 339 based on Foata normal form. 144/3767 useless extension candidates. Maximal degree in co-relation 9503. Up to 2436 conditions per place. [2022-12-13 15:42:05,100 INFO L137 encePairwiseOnDemand]: 259/264 looper letters, 42 selfloop transitions, 7 changer transitions 3/56 dead transitions. [2022-12-13 15:42:05,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 56 transitions, 331 flow [2022-12-13 15:42:05,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 15:42:05,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 15:42:05,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 682 transitions. [2022-12-13 15:42:05,102 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4305555555555556 [2022-12-13 15:42:05,102 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 682 transitions. [2022-12-13 15:42:05,103 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 682 transitions. [2022-12-13 15:42:05,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:05,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 682 transitions. [2022-12-13 15:42:05,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.66666666666667) internal successors, (682), 6 states have internal predecessors, (682), 0 states have call successors, (0), 0 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 15:42:05,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 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 15:42:05,107 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 264.0) internal successors, (1848), 7 states have internal predecessors, (1848), 0 states have call successors, (0), 0 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 15:42:05,107 INFO L175 Difference]: Start difference. First operand has 52 places, 36 transitions, 169 flow. Second operand 6 states and 682 transitions. [2022-12-13 15:42:05,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 56 transitions, 331 flow [2022-12-13 15:42:05,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 56 transitions, 321 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:42:05,112 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 151 flow [2022-12-13 15:42:05,113 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2022-12-13 15:42:05,113 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 8 predicate places. [2022-12-13 15:42:05,113 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 151 flow [2022-12-13 15:42:05,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.0) internal successors, (648), 6 states have internal predecessors, (648), 0 states have call successors, (0), 0 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 15:42:05,114 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:05,114 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:05,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 15:42:05,114 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:05,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:05,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1596123643, now seen corresponding path program 1 times [2022-12-13 15:42:05,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:05,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139787800] [2022-12-13 15:42:05,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:05,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:05,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:05,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:42:05,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:05,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139787800] [2022-12-13 15:42:05,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139787800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:05,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:05,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:42:05,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037800607] [2022-12-13 15:42:05,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:05,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:42:05,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:05,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:42:05,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:42:05,252 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 264 [2022-12-13 15:42:05,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 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 15:42:05,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:05,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 264 [2022-12-13 15:42:05,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:05,837 INFO L130 PetriNetUnfolder]: 3621/5338 cut-off events. [2022-12-13 15:42:05,837 INFO L131 PetriNetUnfolder]: For 4767/4767 co-relation queries the response was YES. [2022-12-13 15:42:05,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13759 conditions, 5338 events. 3621/5338 cut-off events. For 4767/4767 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 26198 event pairs, 2037 based on Foata normal form. 144/5482 useless extension candidates. Maximal degree in co-relation 13748. Up to 4267 conditions per place. [2022-12-13 15:42:05,851 INFO L137 encePairwiseOnDemand]: 260/264 looper letters, 41 selfloop transitions, 6 changer transitions 22/69 dead transitions. [2022-12-13 15:42:05,851 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 69 transitions, 399 flow [2022-12-13 15:42:05,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:42:05,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:42:05,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 610 transitions. [2022-12-13 15:42:05,852 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4621212121212121 [2022-12-13 15:42:05,852 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 610 transitions. [2022-12-13 15:42:05,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 610 transitions. [2022-12-13 15:42:05,853 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:05,853 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 610 transitions. [2022-12-13 15:42:05,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 122.0) internal successors, (610), 5 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:05,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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 15:42:05,855 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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 15:42:05,855 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 151 flow. Second operand 5 states and 610 transitions. [2022-12-13 15:42:05,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 69 transitions, 399 flow [2022-12-13 15:42:05,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 69 transitions, 376 flow, removed 2 selfloop flow, removed 7 redundant places. [2022-12-13 15:42:05,877 INFO L231 Difference]: Finished difference. Result has 51 places, 33 transitions, 156 flow [2022-12-13 15:42:05,877 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=51, PETRI_TRANSITIONS=33} [2022-12-13 15:42:05,877 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 6 predicate places. [2022-12-13 15:42:05,878 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 33 transitions, 156 flow [2022-12-13 15:42:05,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 111.4) internal successors, (557), 5 states have internal predecessors, (557), 0 states have call successors, (0), 0 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 15:42:05,878 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:05,878 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:05,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 15:42:05,878 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:05,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:05,879 INFO L85 PathProgramCache]: Analyzing trace with hash -514377223, now seen corresponding path program 1 times [2022-12-13 15:42:05,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:05,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601563647] [2022-12-13 15:42:05,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:05,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:06,301 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 15:42:06,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:06,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601563647] [2022-12-13 15:42:06,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601563647] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:06,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:06,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:42:06,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725685250] [2022-12-13 15:42:06,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:06,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 15:42:06,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:06,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 15:42:06,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 15:42:06,348 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 264 [2022-12-13 15:42:06,348 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 33 transitions, 156 flow. Second operand has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 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 15:42:06,348 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:06,349 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 264 [2022-12-13 15:42:06,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:06,996 INFO L130 PetriNetUnfolder]: 4163/6200 cut-off events. [2022-12-13 15:42:06,997 INFO L131 PetriNetUnfolder]: For 5244/5244 co-relation queries the response was YES. [2022-12-13 15:42:07,002 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16373 conditions, 6200 events. 4163/6200 cut-off events. For 5244/5244 co-relation queries the response was YES. Maximal size of possible extension queue 240. Compared 32072 event pairs, 391 based on Foata normal form. 240/6440 useless extension candidates. Maximal degree in co-relation 16361. Up to 4181 conditions per place. [2022-12-13 15:42:07,012 INFO L137 encePairwiseOnDemand]: 253/264 looper letters, 67 selfloop transitions, 14 changer transitions 28/109 dead transitions. [2022-12-13 15:42:07,012 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 109 transitions, 635 flow [2022-12-13 15:42:07,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 15:42:07,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 15:42:07,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 949 transitions. [2022-12-13 15:42:07,014 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4493371212121212 [2022-12-13 15:42:07,015 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 949 transitions. [2022-12-13 15:42:07,015 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 949 transitions. [2022-12-13 15:42:07,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:07,015 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 949 transitions. [2022-12-13 15:42:07,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 118.625) internal successors, (949), 8 states have internal predecessors, (949), 0 states have call successors, (0), 0 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 15:42:07,018 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 264.0) internal successors, (2376), 9 states have internal predecessors, (2376), 0 states have call successors, (0), 0 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 15:42:07,018 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 264.0) internal successors, (2376), 9 states have internal predecessors, (2376), 0 states have call successors, (0), 0 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 15:42:07,018 INFO L175 Difference]: Start difference. First operand has 51 places, 33 transitions, 156 flow. Second operand 8 states and 949 transitions. [2022-12-13 15:42:07,018 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 109 transitions, 635 flow [2022-12-13 15:42:07,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 109 transitions, 613 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-12-13 15:42:07,041 INFO L231 Difference]: Finished difference. Result has 58 places, 45 transitions, 280 flow [2022-12-13 15:42:07,041 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=280, PETRI_PLACES=58, PETRI_TRANSITIONS=45} [2022-12-13 15:42:07,041 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2022-12-13 15:42:07,042 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 45 transitions, 280 flow [2022-12-13 15:42:07,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 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 15:42:07,042 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:07,042 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:07,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 15:42:07,042 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:07,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:07,043 INFO L85 PathProgramCache]: Analyzing trace with hash 2061525726, now seen corresponding path program 1 times [2022-12-13 15:42:07,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:07,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306046859] [2022-12-13 15:42:07,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:07,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:07,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:07,132 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 15:42:07,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:07,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306046859] [2022-12-13 15:42:07,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306046859] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:07,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:07,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:42:07,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714587954] [2022-12-13 15:42:07,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:07,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:42:07,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:07,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:42:07,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:42:07,140 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 264 [2022-12-13 15:42:07,140 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 45 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 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 15:42:07,140 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:07,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 264 [2022-12-13 15:42:07,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:07,671 INFO L130 PetriNetUnfolder]: 2827/4351 cut-off events. [2022-12-13 15:42:07,671 INFO L131 PetriNetUnfolder]: For 9370/9641 co-relation queries the response was YES. [2022-12-13 15:42:07,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14259 conditions, 4351 events. 2827/4351 cut-off events. For 9370/9641 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 24178 event pairs, 1017 based on Foata normal form. 136/4320 useless extension candidates. Maximal degree in co-relation 14243. Up to 2503 conditions per place. [2022-12-13 15:42:07,686 INFO L137 encePairwiseOnDemand]: 260/264 looper letters, 39 selfloop transitions, 7 changer transitions 14/67 dead transitions. [2022-12-13 15:42:07,686 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 494 flow [2022-12-13 15:42:07,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:42:07,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:42:07,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2022-12-13 15:42:07,689 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4825757575757576 [2022-12-13 15:42:07,689 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions. [2022-12-13 15:42:07,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions. [2022-12-13 15:42:07,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:07,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions. [2022-12-13 15:42:07,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 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 15:42:07,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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 15:42:07,692 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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 15:42:07,692 INFO L175 Difference]: Start difference. First operand has 58 places, 45 transitions, 280 flow. Second operand 5 states and 637 transitions. [2022-12-13 15:42:07,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 494 flow [2022-12-13 15:42:07,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 476 flow, removed 9 selfloop flow, removed 1 redundant places. [2022-12-13 15:42:07,702 INFO L231 Difference]: Finished difference. Result has 61 places, 45 transitions, 289 flow [2022-12-13 15:42:07,702 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=289, PETRI_PLACES=61, PETRI_TRANSITIONS=45} [2022-12-13 15:42:07,702 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 16 predicate places. [2022-12-13 15:42:07,702 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 45 transitions, 289 flow [2022-12-13 15:42:07,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 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 15:42:07,703 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:07,703 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:07,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 15:42:07,703 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:07,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:07,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1239724029, now seen corresponding path program 1 times [2022-12-13 15:42:07,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:07,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666326610] [2022-12-13 15:42:07,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:07,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:07,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:07,792 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 15:42:07,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:07,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666326610] [2022-12-13 15:42:07,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666326610] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:07,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:07,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:42:07,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131695189] [2022-12-13 15:42:07,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:07,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:42:07,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:07,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:42:07,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:42:07,799 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 264 [2022-12-13 15:42:07,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 45 transitions, 289 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 15:42:07,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:07,800 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 264 [2022-12-13 15:42:07,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:08,069 INFO L130 PetriNetUnfolder]: 1269/2188 cut-off events. [2022-12-13 15:42:08,069 INFO L131 PetriNetUnfolder]: For 4374/4447 co-relation queries the response was YES. [2022-12-13 15:42:08,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7077 conditions, 2188 events. 1269/2188 cut-off events. For 4374/4447 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 12479 event pairs, 315 based on Foata normal form. 129/2248 useless extension candidates. Maximal degree in co-relation 7058. Up to 1628 conditions per place. [2022-12-13 15:42:08,076 INFO L137 encePairwiseOnDemand]: 259/264 looper letters, 49 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2022-12-13 15:42:08,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 66 transitions, 494 flow [2022-12-13 15:42:08,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:42:08,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:42:08,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2022-12-13 15:42:08,078 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4898989898989899 [2022-12-13 15:42:08,078 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2022-12-13 15:42:08,078 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2022-12-13 15:42:08,079 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:08,079 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2022-12-13 15:42:08,079 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 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 15:42:08,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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 15:42:08,080 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 264.0) internal successors, (1056), 4 states have internal predecessors, (1056), 0 states have call successors, (0), 0 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 15:42:08,080 INFO L175 Difference]: Start difference. First operand has 61 places, 45 transitions, 289 flow. Second operand 3 states and 388 transitions. [2022-12-13 15:42:08,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 66 transitions, 494 flow [2022-12-13 15:42:08,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 474 flow, removed 3 selfloop flow, removed 4 redundant places. [2022-12-13 15:42:08,086 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 295 flow [2022-12-13 15:42:08,086 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=295, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2022-12-13 15:42:08,086 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 13 predicate places. [2022-12-13 15:42:08,086 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 295 flow [2022-12-13 15:42:08,086 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 15:42:08,086 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:08,087 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:08,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 15:42:08,087 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:08,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:08,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1742837245, now seen corresponding path program 1 times [2022-12-13 15:42:08,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:08,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786685235] [2022-12-13 15:42:08,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:08,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:08,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:08,178 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 15:42:08,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:08,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786685235] [2022-12-13 15:42:08,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786685235] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:08,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:08,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:42:08,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015566258] [2022-12-13 15:42:08,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:08,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:42:08,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:08,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:42:08,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:42:08,190 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 264 [2022-12-13 15:42:08,191 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 295 flow. Second operand has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 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 15:42:08,191 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:08,191 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 264 [2022-12-13 15:42:08,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:08,695 INFO L130 PetriNetUnfolder]: 2208/3885 cut-off events. [2022-12-13 15:42:08,696 INFO L131 PetriNetUnfolder]: For 6322/6376 co-relation queries the response was YES. [2022-12-13 15:42:08,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13448 conditions, 3885 events. 2208/3885 cut-off events. For 6322/6376 co-relation queries the response was YES. Maximal size of possible extension queue 200. Compared 24763 event pairs, 578 based on Foata normal form. 66/3894 useless extension candidates. Maximal degree in co-relation 13430. Up to 1838 conditions per place. [2022-12-13 15:42:08,707 INFO L137 encePairwiseOnDemand]: 260/264 looper letters, 70 selfloop transitions, 3 changer transitions 10/94 dead transitions. [2022-12-13 15:42:08,707 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 94 transitions, 676 flow [2022-12-13 15:42:08,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:42:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:42:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 637 transitions. [2022-12-13 15:42:08,708 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4825757575757576 [2022-12-13 15:42:08,708 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 637 transitions. [2022-12-13 15:42:08,708 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 637 transitions. [2022-12-13 15:42:08,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:08,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 637 transitions. [2022-12-13 15:42:08,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.4) internal successors, (637), 5 states have internal predecessors, (637), 0 states have call successors, (0), 0 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 15:42:08,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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 15:42:08,711 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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 15:42:08,711 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 295 flow. Second operand 5 states and 637 transitions. [2022-12-13 15:42:08,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 94 transitions, 676 flow [2022-12-13 15:42:08,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 94 transitions, 657 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 15:42:08,715 INFO L231 Difference]: Finished difference. Result has 63 places, 49 transitions, 306 flow [2022-12-13 15:42:08,716 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=306, PETRI_PLACES=63, PETRI_TRANSITIONS=49} [2022-12-13 15:42:08,716 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 18 predicate places. [2022-12-13 15:42:08,716 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 49 transitions, 306 flow [2022-12-13 15:42:08,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 119.4) internal successors, (597), 5 states have internal predecessors, (597), 0 states have call successors, (0), 0 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 15:42:08,716 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:08,716 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:08,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 15:42:08,717 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:08,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:08,717 INFO L85 PathProgramCache]: Analyzing trace with hash -2143684483, now seen corresponding path program 2 times [2022-12-13 15:42:08,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:08,717 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307743267] [2022-12-13 15:42:08,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:08,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:08,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:08,821 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 15:42:08,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:08,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307743267] [2022-12-13 15:42:08,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307743267] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:08,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:08,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:42:08,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825386883] [2022-12-13 15:42:08,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:08,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:42:08,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:08,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:42:08,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:42:08,828 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 264 [2022-12-13 15:42:08,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 49 transitions, 306 flow. Second operand has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:08,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:08,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 264 [2022-12-13 15:42:08,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:09,077 INFO L130 PetriNetUnfolder]: 899/1738 cut-off events. [2022-12-13 15:42:09,077 INFO L131 PetriNetUnfolder]: For 2516/2561 co-relation queries the response was YES. [2022-12-13 15:42:09,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5953 conditions, 1738 events. 899/1738 cut-off events. For 2516/2561 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 10898 event pairs, 223 based on Foata normal form. 186/1848 useless extension candidates. Maximal degree in co-relation 5933. Up to 577 conditions per place. [2022-12-13 15:42:09,082 INFO L137 encePairwiseOnDemand]: 259/264 looper letters, 58 selfloop transitions, 7 changer transitions 1/80 dead transitions. [2022-12-13 15:42:09,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 80 transitions, 588 flow [2022-12-13 15:42:09,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:42:09,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:42:09,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 518 transitions. [2022-12-13 15:42:09,085 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49053030303030304 [2022-12-13 15:42:09,085 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 518 transitions. [2022-12-13 15:42:09,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 518 transitions. [2022-12-13 15:42:09,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:09,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 518 transitions. [2022-12-13 15:42:09,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 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 15:42:09,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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 15:42:09,087 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 264.0) internal successors, (1320), 5 states have internal predecessors, (1320), 0 states have call successors, (0), 0 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 15:42:09,087 INFO L175 Difference]: Start difference. First operand has 63 places, 49 transitions, 306 flow. Second operand 4 states and 518 transitions. [2022-12-13 15:42:09,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 80 transitions, 588 flow [2022-12-13 15:42:09,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 80 transitions, 583 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 15:42:09,091 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 343 flow [2022-12-13 15:42:09,091 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=343, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2022-12-13 15:42:09,091 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 19 predicate places. [2022-12-13 15:42:09,092 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 343 flow [2022-12-13 15:42:09,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:09,092 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:09,092 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:09,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 15:42:09,092 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:09,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:09,092 INFO L85 PathProgramCache]: Analyzing trace with hash 47512217, now seen corresponding path program 1 times [2022-12-13 15:42:09,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:09,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614066579] [2022-12-13 15:42:09,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:09,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:09,609 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 15:42:09,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:09,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614066579] [2022-12-13 15:42:09,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614066579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:09,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:09,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 15:42:09,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415351289] [2022-12-13 15:42:09,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:09,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 15:42:09,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:09,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 15:42:09,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-12-13 15:42:09,709 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 264 [2022-12-13 15:42:09,710 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 343 flow. Second operand has 10 states, 10 states have (on average 104.2) internal successors, (1042), 10 states have internal predecessors, (1042), 0 states have call successors, (0), 0 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 15:42:09,710 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:09,710 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 264 [2022-12-13 15:42:09,710 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:10,648 INFO L130 PetriNetUnfolder]: 2006/3609 cut-off events. [2022-12-13 15:42:10,648 INFO L131 PetriNetUnfolder]: For 7393/7393 co-relation queries the response was YES. [2022-12-13 15:42:10,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14580 conditions, 3609 events. 2006/3609 cut-off events. For 7393/7393 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 22411 event pairs, 305 based on Foata normal form. 8/3617 useless extension candidates. Maximal degree in co-relation 14560. Up to 1578 conditions per place. [2022-12-13 15:42:10,657 INFO L137 encePairwiseOnDemand]: 250/264 looper letters, 127 selfloop transitions, 26 changer transitions 5/158 dead transitions. [2022-12-13 15:42:10,657 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 158 transitions, 1258 flow [2022-12-13 15:42:10,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 15:42:10,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 15:42:10,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1242 transitions. [2022-12-13 15:42:10,659 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42768595041322316 [2022-12-13 15:42:10,659 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1242 transitions. [2022-12-13 15:42:10,659 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1242 transitions. [2022-12-13 15:42:10,659 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:10,659 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1242 transitions. [2022-12-13 15:42:10,661 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 112.9090909090909) internal successors, (1242), 11 states have internal predecessors, (1242), 0 states have call successors, (0), 0 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 15:42:10,663 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 264.0) internal successors, (3168), 12 states have internal predecessors, (3168), 0 states have call successors, (0), 0 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 15:42:10,663 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 264.0) internal successors, (3168), 12 states have internal predecessors, (3168), 0 states have call successors, (0), 0 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 15:42:10,663 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 343 flow. Second operand 11 states and 1242 transitions. [2022-12-13 15:42:10,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 158 transitions, 1258 flow [2022-12-13 15:42:10,668 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 158 transitions, 1200 flow, removed 14 selfloop flow, removed 2 redundant places. [2022-12-13 15:42:10,670 INFO L231 Difference]: Finished difference. Result has 78 places, 67 transitions, 488 flow [2022-12-13 15:42:10,670 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=488, PETRI_PLACES=78, PETRI_TRANSITIONS=67} [2022-12-13 15:42:10,670 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 33 predicate places. [2022-12-13 15:42:10,670 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 67 transitions, 488 flow [2022-12-13 15:42:10,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 104.2) internal successors, (1042), 10 states have internal predecessors, (1042), 0 states have call successors, (0), 0 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 15:42:10,670 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:10,671 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:10,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 15:42:10,671 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:10,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:10,671 INFO L85 PathProgramCache]: Analyzing trace with hash -535528968, now seen corresponding path program 1 times [2022-12-13 15:42:10,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:10,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291345606] [2022-12-13 15:42:10,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:10,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:10,793 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 15:42:10,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:10,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291345606] [2022-12-13 15:42:10,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291345606] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:10,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:10,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:42:10,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047058752] [2022-12-13 15:42:10,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:10,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:42:10,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:10,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:42:10,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:42:10,804 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 264 [2022-12-13 15:42:10,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 67 transitions, 488 flow. Second operand has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:10,805 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:10,805 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 264 [2022-12-13 15:42:10,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:11,096 INFO L130 PetriNetUnfolder]: 1097/2136 cut-off events. [2022-12-13 15:42:11,096 INFO L131 PetriNetUnfolder]: For 5412/5532 co-relation queries the response was YES. [2022-12-13 15:42:11,101 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9060 conditions, 2136 events. 1097/2136 cut-off events. For 5412/5532 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 14796 event pairs, 204 based on Foata normal form. 107/2148 useless extension candidates. Maximal degree in co-relation 9034. Up to 866 conditions per place. [2022-12-13 15:42:11,103 INFO L137 encePairwiseOnDemand]: 259/264 looper letters, 67 selfloop transitions, 10 changer transitions 20/110 dead transitions. [2022-12-13 15:42:11,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 110 transitions, 937 flow [2022-12-13 15:42:11,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:42:11,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:42:11,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 635 transitions. [2022-12-13 15:42:11,104 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4810606060606061 [2022-12-13 15:42:11,104 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 635 transitions. [2022-12-13 15:42:11,104 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 635 transitions. [2022-12-13 15:42:11,105 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:11,105 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 635 transitions. [2022-12-13 15:42:11,105 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 127.0) internal successors, (635), 5 states have internal predecessors, (635), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:11,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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 15:42:11,106 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 264.0) internal successors, (1584), 6 states have internal predecessors, (1584), 0 states have call successors, (0), 0 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 15:42:11,107 INFO L175 Difference]: Start difference. First operand has 78 places, 67 transitions, 488 flow. Second operand 5 states and 635 transitions. [2022-12-13 15:42:11,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 110 transitions, 937 flow [2022-12-13 15:42:11,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 110 transitions, 863 flow, removed 20 selfloop flow, removed 6 redundant places. [2022-12-13 15:42:11,121 INFO L231 Difference]: Finished difference. Result has 75 places, 58 transitions, 388 flow [2022-12-13 15:42:11,121 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=388, PETRI_PLACES=75, PETRI_TRANSITIONS=58} [2022-12-13 15:42:11,121 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2022-12-13 15:42:11,121 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 58 transitions, 388 flow [2022-12-13 15:42:11,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 120.8) internal successors, (604), 5 states have internal predecessors, (604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:11,122 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:11,122 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] [2022-12-13 15:42:11,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 15:42:11,122 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:11,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:11,122 INFO L85 PathProgramCache]: Analyzing trace with hash -294130418, now seen corresponding path program 1 times [2022-12-13 15:42:11,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:11,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092477999] [2022-12-13 15:42:11,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:11,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:11,335 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 15:42:11,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:11,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092477999] [2022-12-13 15:42:11,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092477999] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:11,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:11,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 15:42:11,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558025079] [2022-12-13 15:42:11,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:11,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 15:42:11,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:11,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 15:42:11,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 15:42:11,364 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 264 [2022-12-13 15:42:11,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 58 transitions, 388 flow. Second operand has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 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 15:42:11,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:11,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 264 [2022-12-13 15:42:11,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:11,722 INFO L130 PetriNetUnfolder]: 1021/1891 cut-off events. [2022-12-13 15:42:11,723 INFO L131 PetriNetUnfolder]: For 5134/5134 co-relation queries the response was YES. [2022-12-13 15:42:11,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8498 conditions, 1891 events. 1021/1891 cut-off events. For 5134/5134 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 10878 event pairs, 178 based on Foata normal form. 3/1894 useless extension candidates. Maximal degree in co-relation 8475. Up to 890 conditions per place. [2022-12-13 15:42:11,728 INFO L137 encePairwiseOnDemand]: 257/264 looper letters, 51 selfloop transitions, 6 changer transitions 53/110 dead transitions. [2022-12-13 15:42:11,728 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 110 transitions, 960 flow [2022-12-13 15:42:11,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:42:11,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:42:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 808 transitions. [2022-12-13 15:42:11,730 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43722943722943725 [2022-12-13 15:42:11,730 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 808 transitions. [2022-12-13 15:42:11,730 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 808 transitions. [2022-12-13 15:42:11,730 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:11,730 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 808 transitions. [2022-12-13 15:42:11,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.42857142857143) internal successors, (808), 7 states have internal predecessors, (808), 0 states have call successors, (0), 0 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 15:42:11,732 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 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 15:42:11,733 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 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 15:42:11,733 INFO L175 Difference]: Start difference. First operand has 75 places, 58 transitions, 388 flow. Second operand 7 states and 808 transitions. [2022-12-13 15:42:11,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 110 transitions, 960 flow [2022-12-13 15:42:11,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 110 transitions, 868 flow, removed 26 selfloop flow, removed 8 redundant places. [2022-12-13 15:42:11,759 INFO L231 Difference]: Finished difference. Result has 75 places, 47 transitions, 293 flow [2022-12-13 15:42:11,759 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=344, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=293, PETRI_PLACES=75, PETRI_TRANSITIONS=47} [2022-12-13 15:42:11,760 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 30 predicate places. [2022-12-13 15:42:11,760 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 47 transitions, 293 flow [2022-12-13 15:42:11,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 111.16666666666667) internal successors, (667), 6 states have internal predecessors, (667), 0 states have call successors, (0), 0 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 15:42:11,760 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:11,760 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] [2022-12-13 15:42:11,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 15:42:11,761 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:11,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:11,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1310440186, now seen corresponding path program 2 times [2022-12-13 15:42:11,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:11,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740903385] [2022-12-13 15:42:11,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:11,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:12,402 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 15:42:12,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 15:42:12,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740903385] [2022-12-13 15:42:12,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740903385] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:12,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:12,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:42:12,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050637562] [2022-12-13 15:42:12,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:12,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 15:42:12,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 15:42:12,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 15:42:12,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:42:12,457 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 264 [2022-12-13 15:42:12,458 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 47 transitions, 293 flow. Second operand has 8 states, 8 states have (on average 117.625) internal successors, (941), 8 states have internal predecessors, (941), 0 states have call successors, (0), 0 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 15:42:12,458 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:12,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 264 [2022-12-13 15:42:12,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:12,736 INFO L130 PetriNetUnfolder]: 448/951 cut-off events. [2022-12-13 15:42:12,736 INFO L131 PetriNetUnfolder]: For 1880/1888 co-relation queries the response was YES. [2022-12-13 15:42:12,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3835 conditions, 951 events. 448/951 cut-off events. For 1880/1888 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 5462 event pairs, 88 based on Foata normal form. 2/906 useless extension candidates. Maximal degree in co-relation 3813. Up to 484 conditions per place. [2022-12-13 15:42:12,739 INFO L137 encePairwiseOnDemand]: 258/264 looper letters, 41 selfloop transitions, 3 changer transitions 31/80 dead transitions. [2022-12-13 15:42:12,739 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 80 transitions, 605 flow [2022-12-13 15:42:12,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 15:42:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 15:42:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 852 transitions. [2022-12-13 15:42:12,741 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.461038961038961 [2022-12-13 15:42:12,741 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 852 transitions. [2022-12-13 15:42:12,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 852 transitions. [2022-12-13 15:42:12,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:12,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 852 transitions. [2022-12-13 15:42:12,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 121.71428571428571) internal successors, (852), 7 states have internal predecessors, (852), 0 states have call successors, (0), 0 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 15:42:12,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 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 15:42:12,745 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 264.0) internal successors, (2112), 8 states have internal predecessors, (2112), 0 states have call successors, (0), 0 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 15:42:12,746 INFO L175 Difference]: Start difference. First operand has 75 places, 47 transitions, 293 flow. Second operand 7 states and 852 transitions. [2022-12-13 15:42:12,746 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 80 transitions, 605 flow [2022-12-13 15:42:12,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 80 transitions, 575 flow, removed 9 selfloop flow, removed 7 redundant places. [2022-12-13 15:42:12,754 INFO L231 Difference]: Finished difference. Result has 72 places, 39 transitions, 228 flow [2022-12-13 15:42:12,754 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=264, PETRI_DIFFERENCE_MINUEND_FLOW=269, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=228, PETRI_PLACES=72, PETRI_TRANSITIONS=39} [2022-12-13 15:42:12,755 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 27 predicate places. [2022-12-13 15:42:12,755 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 39 transitions, 228 flow [2022-12-13 15:42:12,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.625) internal successors, (941), 8 states have internal predecessors, (941), 0 states have call successors, (0), 0 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 15:42:12,755 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:12,756 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] [2022-12-13 15:42:12,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 15:42:12,756 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:12,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash 427042544, now seen corresponding path program 3 times [2022-12-13 15:42:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 15:42:12,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254517108] [2022-12-13 15:42:12,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:12,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 15:42:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:42:12,791 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:42:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:42:12,834 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 15:42:12,835 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 15:42:12,835 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-13 15:42:12,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-13 15:42:12,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-13 15:42:12,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-13 15:42:12,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-13 15:42:12,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-13 15:42:12,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-13 15:42:12,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-13 15:42:12,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-13 15:42:12,837 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-13 15:42:12,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-13 15:42:12,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-13 15:42:12,838 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-13 15:42:12,838 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 15:42:12,838 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:12,842 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 15:42:12,842 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:42:12,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:42:12 BasicIcfg [2022-12-13 15:42:12,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:42:12,883 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:42:12,883 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:42:12,883 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:42:12,883 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:41:57" (3/4) ... [2022-12-13 15:42:12,886 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 15:42:12,886 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:42:12,886 INFO L158 Benchmark]: Toolchain (without parser) took 16696.56ms. Allocated memory was 155.2MB in the beginning and 725.6MB in the end (delta: 570.4MB). Free memory was 120.5MB in the beginning and 386.8MB in the end (delta: -266.3MB). Peak memory consumption was 306.3MB. Max. memory is 16.1GB. [2022-12-13 15:42:12,886 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 59.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:42:12,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.76ms. Allocated memory is still 155.2MB. Free memory was 120.0MB in the beginning and 92.8MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 15:42:12,887 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.16ms. Allocated memory is still 155.2MB. Free memory was 92.8MB in the beginning and 90.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:42:12,887 INFO L158 Benchmark]: Boogie Preprocessor took 29.52ms. Allocated memory is still 155.2MB. Free memory was 90.2MB in the beginning and 88.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:42:12,887 INFO L158 Benchmark]: RCFGBuilder took 585.77ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 88.1MB in the beginning and 137.3MB in the end (delta: -49.1MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2022-12-13 15:42:12,887 INFO L158 Benchmark]: TraceAbstraction took 15659.67ms. Allocated memory was 186.6MB in the beginning and 725.6MB in the end (delta: 539.0MB). Free memory was 136.2MB in the beginning and 386.9MB in the end (delta: -250.6MB). Peak memory consumption was 288.3MB. Max. memory is 16.1GB. [2022-12-13 15:42:12,887 INFO L158 Benchmark]: Witness Printer took 2.75ms. Allocated memory is still 725.6MB. Free memory was 386.9MB in the beginning and 386.8MB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:42:12,888 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.21ms. Allocated memory is still 109.1MB. Free memory is still 59.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.76ms. Allocated memory is still 155.2MB. Free memory was 120.0MB in the beginning and 92.8MB in the end (delta: 27.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.16ms. Allocated memory is still 155.2MB. Free memory was 92.8MB in the beginning and 90.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.52ms. Allocated memory is still 155.2MB. Free memory was 90.2MB in the beginning and 88.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 585.77ms. Allocated memory was 155.2MB in the beginning and 186.6MB in the end (delta: 31.5MB). Free memory was 88.1MB in the beginning and 137.3MB in the end (delta: -49.1MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. * TraceAbstraction took 15659.67ms. Allocated memory was 186.6MB in the beginning and 725.6MB in the end (delta: 539.0MB). Free memory was 136.2MB in the beginning and 386.9MB in the end (delta: -250.6MB). Peak memory consumption was 288.3MB. Max. memory is 16.1GB. * Witness Printer took 2.75ms. Allocated memory is still 725.6MB. Free memory was 386.9MB in the beginning and 386.8MB in the end (delta: 2.6kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.0s, 139 PlacesBefore, 45 PlacesAfterwards, 131 TransitionsBefore, 36 TransitionsAfterwards, 2824 CoEnabledTransitionPairs, 6 FixpointIterations, 57 TrivialSequentialCompositions, 65 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 130 TotalNumberOfCompositions, 7687 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3942, independent: 3745, independent conditional: 0, independent unconditional: 3745, dependent: 197, dependent conditional: 0, dependent unconditional: 197, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1468, independent: 1435, independent conditional: 0, independent unconditional: 1435, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 3942, independent: 2310, independent conditional: 0, independent unconditional: 2310, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 1468, unknown conditional: 0, unknown unconditional: 1468] , Statistics on independence cache: Total cache size (in pairs): 175, Positive cache size: 157, Positive conditional cache size: 0, Positive unconditional cache size: 157, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool a$flush_delayed; [L725] 0 int a$mem_tmp; [L726] 0 _Bool a$r_buff0_thd0; [L727] 0 _Bool a$r_buff0_thd1; [L728] 0 _Bool a$r_buff0_thd2; [L729] 0 _Bool a$r_buff0_thd3; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$read_delayed; [L735] 0 int *a$read_delayed_var; [L736] 0 int a$w_buff0; [L737] 0 _Bool a$w_buff0_used; [L738] 0 int a$w_buff1; [L739] 0 _Bool a$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t38; [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t38, ((void *)0), P0, ((void *)0))=-1, t38={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t39; [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=0, t38={5:0}, t39={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L765] 1 x = 1 [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L859] 0 pthread_t t40; [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=1, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice2=1, x=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 1 return 0; [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={5:0}, t39={6:0}, t40={3:0}, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 165 locations, 13 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: 15.5s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1095 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 902 mSDsluCounter, 684 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 625 mSDsCounter, 139 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3023 IncrementalHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 139 mSolverCounterUnsat, 59 mSDtfsCounter, 3023 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=488occurred in iteration=13, InterpolantAutomatonStates: 87, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 222 ConstructedInterpolants, 0 QuantifiedInterpolants, 2530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 could not prove your program: unable to determine feasibility of some traces [2022-12-13 15:42:12,904 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/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_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 --- 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 15:42:14,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 15:42:14,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 15:42:14,676 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 15:42:14,676 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 15:42:14,677 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 15:42:14,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 15:42:14,680 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 15:42:14,681 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 15:42:14,682 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 15:42:14,683 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 15:42:14,684 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 15:42:14,685 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 15:42:14,686 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 15:42:14,687 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 15:42:14,688 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 15:42:14,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 15:42:14,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 15:42:14,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 15:42:14,692 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 15:42:14,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 15:42:14,695 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 15:42:14,696 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 15:42:14,697 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 15:42:14,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 15:42:14,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 15:42:14,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 15:42:14,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 15:42:14,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 15:42:14,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 15:42:14,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 15:42:14,704 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 15:42:14,704 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 15:42:14,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 15:42:14,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 15:42:14,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 15:42:14,712 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 15:42:14,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 15:42:14,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 15:42:14,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 15:42:14,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 15:42:14,715 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 15:42:14,738 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 15:42:14,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 15:42:14,739 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 15:42:14,739 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 15:42:14,739 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 15:42:14,740 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 15:42:14,740 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 15:42:14,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 15:42:14,741 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 15:42:14,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 15:42:14,741 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 15:42:14,741 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 15:42:14,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 15:42:14,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 15:42:14,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 15:42:14,742 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 15:42:14,742 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 15:42:14,743 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 15:42:14,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 15:42:14,743 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 15:42:14,743 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 15:42:14,743 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 15:42:14,743 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 15:42:14,744 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 15:42:14,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 15:42:14,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 15:42:14,744 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 15:42:14,744 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:42:14,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 15:42:14,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 15:42:14,745 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 15:42:14,745 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 15:42:14,745 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 15:42:14,746 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 15:42:14,746 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 15:42:14,746 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 15:42:14,746 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 15:42:14,746 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_a33a70d5-1ce7-4918-9900-79001c2812fd/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_a33a70d5-1ce7-4918-9900-79001c2812fd/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> e77d530bbfcfe22638f8b89e94c23e25f591d8037158e571482779188378fc47 [2022-12-13 15:42:14,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 15:42:14,968 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 15:42:14,970 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 15:42:14,971 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 15:42:14,971 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 15:42:14,972 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-12-13 15:42:17,619 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 15:42:17,853 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 15:42:17,854 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/sv-benchmarks/c/pthread-wmm/mix002.oepc.i [2022-12-13 15:42:17,867 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/data/a3f83a566/c5a6dfe95a2c48f6b0b24e55d4b1ccdb/FLAGc0e15ae55 [2022-12-13 15:42:18,172 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/data/a3f83a566/c5a6dfe95a2c48f6b0b24e55d4b1ccdb [2022-12-13 15:42:18,175 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 15:42:18,176 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 15:42:18,177 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 15:42:18,177 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 15:42:18,179 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 15:42:18,180 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:42:18" (1/1) ... [2022-12-13 15:42:18,181 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74a213d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:42:18, skipping insertion in model container [2022-12-13 15:42:18,181 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 03:42:18" (1/1) ... [2022-12-13 15:42:18,186 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 15:42:18,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 15:42:18,345 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_a33a70d5-1ce7-4918-9900-79001c2812fd/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-12-13 15:42:18,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,464 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,469 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,471 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,473 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,474 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,493 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,500 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,503 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:42:18,524 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 15:42:18,535 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_a33a70d5-1ce7-4918-9900-79001c2812fd/sv-benchmarks/c/pthread-wmm/mix002.oepc.i[945,958] [2022-12-13 15:42:18,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,553 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,555 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,559 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,560 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,561 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,565 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,566 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,570 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,571 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 15:42:18,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 15:42:18,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 15:42:18,596 INFO L208 MainTranslator]: Completed translation [2022-12-13 15:42:18,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:42:18 WrapperNode [2022-12-13 15:42:18,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 15:42:18,597 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 15:42:18,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 15:42:18,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 15:42:18,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:42:18" (1/1) ... [2022-12-13 15:42:18,615 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:42:18" (1/1) ... [2022-12-13 15:42:18,636 INFO L138 Inliner]: procedures = 179, calls = 62, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 140 [2022-12-13 15:42:18,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 15:42:18,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 15:42:18,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 15:42:18,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 15:42:18,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:42:18" (1/1) ... [2022-12-13 15:42:18,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:42:18" (1/1) ... [2022-12-13 15:42:18,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:42:18" (1/1) ... [2022-12-13 15:42:18,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:42:18" (1/1) ... [2022-12-13 15:42:18,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:42:18" (1/1) ... [2022-12-13 15:42:18,657 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:42:18" (1/1) ... [2022-12-13 15:42:18,659 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:42:18" (1/1) ... [2022-12-13 15:42:18,660 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:42:18" (1/1) ... [2022-12-13 15:42:18,662 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 15:42:18,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 15:42:18,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 15:42:18,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 15:42:18,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:42:18" (1/1) ... [2022-12-13 15:42:18,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 15:42:18,678 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 15:42:18,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 15:42:18,690 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 15:42:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 15:42:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 15:42:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 15:42:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 15:42:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 15:42:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 15:42:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 15:42:18,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 15:42:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 15:42:18,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 15:42:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 15:42:18,730 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 15:42:18,730 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 15:42:18,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 15:42:18,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 15:42:18,736 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 15:42:18,851 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 15:42:18,852 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 15:42:19,169 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 15:42:19,267 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 15:42:19,267 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 15:42:19,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:42:19 BoogieIcfgContainer [2022-12-13 15:42:19,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 15:42:19,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 15:42:19,271 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 15:42:19,274 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 15:42:19,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 03:42:18" (1/3) ... [2022-12-13 15:42:19,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff1c263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:42:19, skipping insertion in model container [2022-12-13 15:42:19,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 03:42:18" (2/3) ... [2022-12-13 15:42:19,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ff1c263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 03:42:19, skipping insertion in model container [2022-12-13 15:42:19,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:42:19" (3/3) ... [2022-12-13 15:42:19,277 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002.oepc.i [2022-12-13 15:42:19,294 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 15:42:19,294 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-13 15:42:19,294 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 15:42:19,352 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 15:42:19,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 143 places, 135 transitions, 285 flow [2022-12-13 15:42:19,441 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-12-13 15:42:19,441 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:42:19,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-13 15:42:19,446 INFO L82 GeneralOperation]: Start removeDead. Operand has 143 places, 135 transitions, 285 flow [2022-12-13 15:42:19,450 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 140 places, 132 transitions, 273 flow [2022-12-13 15:42:19,454 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 15:42:19,465 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 132 transitions, 273 flow [2022-12-13 15:42:19,467 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 132 transitions, 273 flow [2022-12-13 15:42:19,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 140 places, 132 transitions, 273 flow [2022-12-13 15:42:19,502 INFO L130 PetriNetUnfolder]: 2/132 cut-off events. [2022-12-13 15:42:19,502 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:42:19,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142 conditions, 132 events. 2/132 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 88 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 84. Up to 2 conditions per place. [2022-12-13 15:42:19,505 INFO L119 LiptonReduction]: Number of co-enabled transitions 2824 [2022-12-13 15:42:25,482 INFO L134 LiptonReduction]: Checked pairs total: 8516 [2022-12-13 15:42:25,482 INFO L136 LiptonReduction]: Total number of compositions: 132 [2022-12-13 15:42:25,496 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 15:42:25,502 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@c14aee4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 15:42:25,502 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 15:42:25,503 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 15:42:25,503 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:42:25,503 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:25,504 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 15:42:25,504 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:25,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:25,508 INFO L85 PathProgramCache]: Analyzing trace with hash 575, now seen corresponding path program 1 times [2022-12-13 15:42:25,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:42:25,517 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [966232639] [2022-12-13 15:42:25,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:25,517 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:25,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:42:25,518 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:42:25,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 15:42:25,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:25,574 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 15:42:25,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:42:25,581 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 15:42:25,581 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:42:25,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:42:25,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [966232639] [2022-12-13 15:42:25,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [966232639] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:25,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:25,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 15:42:25,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012117785] [2022-12-13 15:42:25,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:25,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 15:42:25,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:42:25,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 15:42:25,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 15:42:25,616 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 267 [2022-12-13 15:42:25,618 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 36 transitions, 81 flow. Second operand has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 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 15:42:25,618 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:25,618 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 267 [2022-12-13 15:42:25,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:26,210 INFO L130 PetriNetUnfolder]: 2255/3314 cut-off events. [2022-12-13 15:42:26,210 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-12-13 15:42:26,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6657 conditions, 3314 events. 2255/3314 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 16980 event pairs, 2255 based on Foata normal form. 120/2846 useless extension candidates. Maximal degree in co-relation 6646. Up to 3277 conditions per place. [2022-12-13 15:42:26,231 INFO L137 encePairwiseOnDemand]: 260/267 looper letters, 25 selfloop transitions, 0 changer transitions 0/29 dead transitions. [2022-12-13 15:42:26,231 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 29 transitions, 117 flow [2022-12-13 15:42:26,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 15:42:26,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 15:42:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 276 transitions. [2022-12-13 15:42:26,245 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5168539325842697 [2022-12-13 15:42:26,246 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 276 transitions. [2022-12-13 15:42:26,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 276 transitions. [2022-12-13 15:42:26,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:26,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 276 transitions. [2022-12-13 15:42:26,253 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 138.0) internal successors, (276), 2 states have internal predecessors, (276), 0 states have call successors, (0), 0 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 15:42:26,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 0 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 15:42:26,259 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 267.0) internal successors, (801), 3 states have internal predecessors, (801), 0 states have call successors, (0), 0 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 15:42:26,261 INFO L175 Difference]: Start difference. First operand has 45 places, 36 transitions, 81 flow. Second operand 2 states and 276 transitions. [2022-12-13 15:42:26,262 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 29 transitions, 117 flow [2022-12-13 15:42:26,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 114 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:42:26,267 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 64 flow [2022-12-13 15:42:26,269 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=64, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-13 15:42:26,273 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2022-12-13 15:42:26,273 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 64 flow [2022-12-13 15:42:26,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 0 states have call successors, (0), 0 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 15:42:26,273 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:26,274 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 15:42:26,285 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 15:42:26,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:26,475 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:26,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:26,476 INFO L85 PathProgramCache]: Analyzing trace with hash 564724, now seen corresponding path program 1 times [2022-12-13 15:42:26,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:42:26,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2032660938] [2022-12-13 15:42:26,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:26,478 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:26,479 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:42:26,481 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:42:26,482 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 15:42:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:26,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 15:42:26,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:42:26,687 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 15:42:26,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:42:26,688 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:42:26,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2032660938] [2022-12-13 15:42:26,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2032660938] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:26,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:26,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 15:42:26,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638935807] [2022-12-13 15:42:26,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:26,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:42:26,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:42:26,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:42:26,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:42:26,695 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 267 [2022-12-13 15:42:26,696 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 64 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 15:42:26,696 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:26,696 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 267 [2022-12-13 15:42:26,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:27,073 INFO L130 PetriNetUnfolder]: 1851/2879 cut-off events. [2022-12-13 15:42:27,073 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 15:42:27,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5636 conditions, 2879 events. 1851/2879 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17017 event pairs, 235 based on Foata normal form. 0/2566 useless extension candidates. Maximal degree in co-relation 5633. Up to 2297 conditions per place. [2022-12-13 15:42:27,082 INFO L137 encePairwiseOnDemand]: 264/267 looper letters, 36 selfloop transitions, 2 changer transitions 4/46 dead transitions. [2022-12-13 15:42:27,082 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 186 flow [2022-12-13 15:42:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:42:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:42:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2022-12-13 15:42:27,085 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5068664169787765 [2022-12-13 15:42:27,085 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2022-12-13 15:42:27,085 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2022-12-13 15:42:27,085 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:27,085 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2022-12-13 15:42:27,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 0 states have call successors, (0), 0 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 15:42:27,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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 15:42:27,088 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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 15:42:27,088 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 64 flow. Second operand 3 states and 406 transitions. [2022-12-13 15:42:27,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 186 flow [2022-12-13 15:42:27,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 46 transitions, 186 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 15:42:27,089 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 62 flow [2022-12-13 15:42:27,089 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-12-13 15:42:27,089 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, -7 predicate places. [2022-12-13 15:42:27,089 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 62 flow [2022-12-13 15:42:27,090 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 15:42:27,090 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:27,090 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:27,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-12-13 15:42:27,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:27,290 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:27,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:27,291 INFO L85 PathProgramCache]: Analyzing trace with hash -66739852, now seen corresponding path program 1 times [2022-12-13 15:42:27,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:42:27,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1744412240] [2022-12-13 15:42:27,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:27,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:27,292 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:42:27,293 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:42:27,294 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 15:42:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:27,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 15:42:27,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:42:27,394 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 15:42:27,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:42:27,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:42:27,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1744412240] [2022-12-13 15:42:27,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1744412240] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:27,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:27,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 15:42:27,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705953702] [2022-12-13 15:42:27,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:27,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 15:42:27,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:42:27,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 15:42:27,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 15:42:27,405 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 267 [2022-12-13 15:42:27,406 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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 15:42:27,406 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:27,406 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 267 [2022-12-13 15:42:27,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:27,618 INFO L130 PetriNetUnfolder]: 661/1102 cut-off events. [2022-12-13 15:42:27,618 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-13 15:42:27,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2301 conditions, 1102 events. 661/1102 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 5272 event pairs, 163 based on Foata normal form. 48/1088 useless extension candidates. Maximal degree in co-relation 2297. Up to 895 conditions per place. [2022-12-13 15:42:27,624 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 33 selfloop transitions, 4 changer transitions 0/41 dead transitions. [2022-12-13 15:42:27,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 41 transitions, 172 flow [2022-12-13 15:42:27,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 15:42:27,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 15:42:27,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2022-12-13 15:42:27,626 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4893882646691635 [2022-12-13 15:42:27,626 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2022-12-13 15:42:27,626 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2022-12-13 15:42:27,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:27,627 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2022-12-13 15:42:27,628 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 15:42:27,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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 15:42:27,631 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 267.0) internal successors, (1068), 4 states have internal predecessors, (1068), 0 states have call successors, (0), 0 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 15:42:27,631 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 62 flow. Second operand 3 states and 392 transitions. [2022-12-13 15:42:27,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 41 transitions, 172 flow [2022-12-13 15:42:27,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 41 transitions, 166 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 15:42:27,633 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 84 flow [2022-12-13 15:42:27,633 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-13 15:42:27,634 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, -8 predicate places. [2022-12-13 15:42:27,634 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 84 flow [2022-12-13 15:42:27,634 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 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 15:42:27,634 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:27,634 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:27,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 15:42:27,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:27,836 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:27,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:27,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1738651209, now seen corresponding path program 1 times [2022-12-13 15:42:27,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:42:27,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1592306054] [2022-12-13 15:42:27,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:27,840 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:27,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:42:27,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:42:27,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 15:42:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:27,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:42:27,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:42:27,978 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 15:42:27,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:42:27,978 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:42:27,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1592306054] [2022-12-13 15:42:27,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1592306054] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:27,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:27,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:42:27,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268707461] [2022-12-13 15:42:27,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:27,979 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 15:42:27,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:42:27,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 15:42:27,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 15:42:27,992 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 267 [2022-12-13 15:42:27,993 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 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 15:42:27,993 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:27,993 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 267 [2022-12-13 15:42:27,993 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:28,152 INFO L130 PetriNetUnfolder]: 261/503 cut-off events. [2022-12-13 15:42:28,153 INFO L131 PetriNetUnfolder]: For 45/45 co-relation queries the response was YES. [2022-12-13 15:42:28,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 503 events. 261/503 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2173 event pairs, 102 based on Foata normal form. 40/520 useless extension candidates. Maximal degree in co-relation 1196. Up to 178 conditions per place. [2022-12-13 15:42:28,155 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 43 selfloop transitions, 7 changer transitions 0/54 dead transitions. [2022-12-13 15:42:28,155 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 54 transitions, 246 flow [2022-12-13 15:42:28,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 15:42:28,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 15:42:28,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 523 transitions. [2022-12-13 15:42:28,158 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4897003745318352 [2022-12-13 15:42:28,158 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 523 transitions. [2022-12-13 15:42:28,158 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 523 transitions. [2022-12-13 15:42:28,158 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:28,158 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 523 transitions. [2022-12-13 15:42:28,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 130.75) internal successors, (523), 4 states have internal predecessors, (523), 0 states have call successors, (0), 0 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 15:42:28,162 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 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 15:42:28,163 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 267.0) internal successors, (1335), 5 states have internal predecessors, (1335), 0 states have call successors, (0), 0 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 15:42:28,163 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 84 flow. Second operand 4 states and 523 transitions. [2022-12-13 15:42:28,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 54 transitions, 246 flow [2022-12-13 15:42:28,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 54 transitions, 242 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:42:28,165 INFO L231 Difference]: Finished difference. Result has 40 places, 32 transitions, 120 flow [2022-12-13 15:42:28,165 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=40, PETRI_TRANSITIONS=32} [2022-12-13 15:42:28,165 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, -5 predicate places. [2022-12-13 15:42:28,166 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 32 transitions, 120 flow [2022-12-13 15:42:28,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 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 15:42:28,166 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:28,166 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 15:42:28,178 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 15:42:28,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:28,367 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:28,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:28,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1427555878, now seen corresponding path program 1 times [2022-12-13 15:42:28,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:42:28,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [963178484] [2022-12-13 15:42:28,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:28,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:28,369 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:42:28,369 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:42:28,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 15:42:28,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:28,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 15:42:28,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:42:28,499 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 15:42:28,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:42:28,499 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:42:28,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [963178484] [2022-12-13 15:42:28,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [963178484] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:28,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:28,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:42:28,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151488110] [2022-12-13 15:42:28,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:28,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:42:28,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:42:28,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:42:28,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:42:28,511 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 267 [2022-12-13 15:42:28,512 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 32 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:28,512 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:28,512 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 267 [2022-12-13 15:42:28,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:28,731 INFO L130 PetriNetUnfolder]: 206/393 cut-off events. [2022-12-13 15:42:28,732 INFO L131 PetriNetUnfolder]: For 267/267 co-relation queries the response was YES. [2022-12-13 15:42:28,732 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1013 conditions, 393 events. 206/393 cut-off events. For 267/267 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1653 event pairs, 97 based on Foata normal form. 11/392 useless extension candidates. Maximal degree in co-relation 1007. Up to 178 conditions per place. [2022-12-13 15:42:28,733 INFO L137 encePairwiseOnDemand]: 262/267 looper letters, 40 selfloop transitions, 10 changer transitions 0/54 dead transitions. [2022-12-13 15:42:28,733 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 270 flow [2022-12-13 15:42:28,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:42:28,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:42:28,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 641 transitions. [2022-12-13 15:42:28,736 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4801498127340824 [2022-12-13 15:42:28,736 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 641 transitions. [2022-12-13 15:42:28,736 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 641 transitions. [2022-12-13 15:42:28,736 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:28,736 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 641 transitions. [2022-12-13 15:42:28,737 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 128.2) internal successors, (641), 5 states have internal predecessors, (641), 0 states have call successors, (0), 0 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 15:42:28,739 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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 15:42:28,740 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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 15:42:28,740 INFO L175 Difference]: Start difference. First operand has 40 places, 32 transitions, 120 flow. Second operand 5 states and 641 transitions. [2022-12-13 15:42:28,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 270 flow [2022-12-13 15:42:28,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 54 transitions, 256 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-12-13 15:42:28,744 INFO L231 Difference]: Finished difference. Result has 43 places, 32 transitions, 134 flow [2022-12-13 15:42:28,744 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=43, PETRI_TRANSITIONS=32} [2022-12-13 15:42:28,745 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, -2 predicate places. [2022-12-13 15:42:28,745 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 32 transitions, 134 flow [2022-12-13 15:42:28,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:28,746 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:28,746 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] [2022-12-13 15:42:28,755 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 15:42:28,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:28,948 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:28,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:28,949 INFO L85 PathProgramCache]: Analyzing trace with hash 952762416, now seen corresponding path program 1 times [2022-12-13 15:42:28,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:42:28,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060305168] [2022-12-13 15:42:28,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:28,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:28,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:42:28,955 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:42:28,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 15:42:29,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:29,125 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 15:42:29,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:42:29,351 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 15:42:29,351 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:42:29,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:42:29,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060305168] [2022-12-13 15:42:29,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060305168] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:29,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:29,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 15:42:29,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026537769] [2022-12-13 15:42:29,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:29,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 15:42:29,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:42:29,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 15:42:29,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 15:42:29,398 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 267 [2022-12-13 15:42:29,400 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 32 transitions, 134 flow. Second operand has 8 states, 8 states have (on average 117.625) internal successors, (941), 8 states have internal predecessors, (941), 0 states have call successors, (0), 0 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 15:42:29,400 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:29,400 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 267 [2022-12-13 15:42:29,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:29,733 INFO L130 PetriNetUnfolder]: 228/449 cut-off events. [2022-12-13 15:42:29,733 INFO L131 PetriNetUnfolder]: For 442/442 co-relation queries the response was YES. [2022-12-13 15:42:29,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1229 conditions, 449 events. 228/449 cut-off events. For 442/442 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2109 event pairs, 17 based on Foata normal form. 0/443 useless extension candidates. Maximal degree in co-relation 1222. Up to 154 conditions per place. [2022-12-13 15:42:29,735 INFO L137 encePairwiseOnDemand]: 260/267 looper letters, 63 selfloop transitions, 7 changer transitions 0/74 dead transitions. [2022-12-13 15:42:29,735 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 74 transitions, 470 flow [2022-12-13 15:42:29,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 15:42:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 15:42:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 975 transitions. [2022-12-13 15:42:29,737 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45646067415730335 [2022-12-13 15:42:29,737 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 975 transitions. [2022-12-13 15:42:29,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 975 transitions. [2022-12-13 15:42:29,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:29,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 975 transitions. [2022-12-13 15:42:29,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 121.875) internal successors, (975), 8 states have internal predecessors, (975), 0 states have call successors, (0), 0 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 15:42:29,741 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 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 15:42:29,741 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 267.0) internal successors, (2403), 9 states have internal predecessors, (2403), 0 states have call successors, (0), 0 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 15:42:29,741 INFO L175 Difference]: Start difference. First operand has 43 places, 32 transitions, 134 flow. Second operand 8 states and 975 transitions. [2022-12-13 15:42:29,742 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 74 transitions, 470 flow [2022-12-13 15:42:29,743 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 74 transitions, 408 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 15:42:29,744 INFO L231 Difference]: Finished difference. Result has 50 places, 35 transitions, 140 flow [2022-12-13 15:42:29,744 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=140, PETRI_PLACES=50, PETRI_TRANSITIONS=35} [2022-12-13 15:42:29,745 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 5 predicate places. [2022-12-13 15:42:29,745 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 35 transitions, 140 flow [2022-12-13 15:42:29,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 117.625) internal successors, (941), 8 states have internal predecessors, (941), 0 states have call successors, (0), 0 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 15:42:29,745 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:29,745 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] [2022-12-13 15:42:29,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 15:42:29,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:29,946 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:29,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:29,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1861350006, now seen corresponding path program 2 times [2022-12-13 15:42:29,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:42:29,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602474930] [2022-12-13 15:42:29,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 15:42:29,948 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:29,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:42:29,949 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:42:29,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 15:42:30,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 15:42:30,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:42:30,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:42:30,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:42:30,100 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 15:42:30,101 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:42:30,101 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:42:30,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602474930] [2022-12-13 15:42:30,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602474930] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:30,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:30,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:42:30,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786525291] [2022-12-13 15:42:30,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:30,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:42:30,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:42:30,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:42:30,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:42:30,113 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 267 [2022-12-13 15:42:30,113 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 35 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:30,114 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:30,114 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 267 [2022-12-13 15:42:30,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:30,303 INFO L130 PetriNetUnfolder]: 365/742 cut-off events. [2022-12-13 15:42:30,303 INFO L131 PetriNetUnfolder]: For 502/502 co-relation queries the response was YES. [2022-12-13 15:42:30,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2031 conditions, 742 events. 365/742 cut-off events. For 502/502 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3834 event pairs, 69 based on Foata normal form. 1/743 useless extension candidates. Maximal degree in co-relation 2021. Up to 366 conditions per place. [2022-12-13 15:42:30,305 INFO L137 encePairwiseOnDemand]: 263/267 looper letters, 65 selfloop transitions, 4 changer transitions 0/72 dead transitions. [2022-12-13 15:42:30,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 72 transitions, 438 flow [2022-12-13 15:42:30,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:42:30,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:42:30,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 634 transitions. [2022-12-13 15:42:30,307 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4749063670411985 [2022-12-13 15:42:30,307 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 634 transitions. [2022-12-13 15:42:30,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 634 transitions. [2022-12-13 15:42:30,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:30,307 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 634 transitions. [2022-12-13 15:42:30,308 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 15:42:30,309 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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 15:42:30,309 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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 15:42:30,309 INFO L175 Difference]: Start difference. First operand has 50 places, 35 transitions, 140 flow. Second operand 5 states and 634 transitions. [2022-12-13 15:42:30,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 72 transitions, 438 flow [2022-12-13 15:42:30,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 72 transitions, 427 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 15:42:30,313 INFO L231 Difference]: Finished difference. Result has 54 places, 38 transitions, 169 flow [2022-12-13 15:42:30,314 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=169, PETRI_PLACES=54, PETRI_TRANSITIONS=38} [2022-12-13 15:42:30,314 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 9 predicate places. [2022-12-13 15:42:30,314 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 38 transitions, 169 flow [2022-12-13 15:42:30,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:30,314 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:30,314 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] [2022-12-13 15:42:30,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 15:42:30,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:30,515 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:30,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:30,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1013601308, now seen corresponding path program 3 times [2022-12-13 15:42:30,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:42:30,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1532086901] [2022-12-13 15:42:30,516 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 15:42:30,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:30,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:42:30,517 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:42:30,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 15:42:30,602 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 15:42:30,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 15:42:30,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 15:42:30,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:42:30,636 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 15:42:30,636 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:42:30,636 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:42:30,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1532086901] [2022-12-13 15:42:30,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1532086901] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:30,637 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:30,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 15:42:30,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233009978] [2022-12-13 15:42:30,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:30,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:42:30,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:42:30,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:42:30,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:42:30,654 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 267 [2022-12-13 15:42:30,654 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 38 transitions, 169 flow. Second operand has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:30,654 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:30,654 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 267 [2022-12-13 15:42:30,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:30,883 INFO L130 PetriNetUnfolder]: 571/1105 cut-off events. [2022-12-13 15:42:30,883 INFO L131 PetriNetUnfolder]: For 899/899 co-relation queries the response was YES. [2022-12-13 15:42:30,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3206 conditions, 1105 events. 571/1105 cut-off events. For 899/899 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5934 event pairs, 167 based on Foata normal form. 1/1094 useless extension candidates. Maximal degree in co-relation 3193. Up to 458 conditions per place. [2022-12-13 15:42:30,887 INFO L137 encePairwiseOnDemand]: 263/267 looper letters, 62 selfloop transitions, 6 changer transitions 0/72 dead transitions. [2022-12-13 15:42:30,887 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 72 transitions, 466 flow [2022-12-13 15:42:30,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:42:30,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:42:30,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 630 transitions. [2022-12-13 15:42:30,889 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47191011235955055 [2022-12-13 15:42:30,889 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 630 transitions. [2022-12-13 15:42:30,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 630 transitions. [2022-12-13 15:42:30,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:30,890 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 630 transitions. [2022-12-13 15:42:30,890 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 126.0) internal successors, (630), 5 states have internal predecessors, (630), 0 states have call successors, (0), 0 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 15:42:30,892 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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 15:42:30,892 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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 15:42:30,892 INFO L175 Difference]: Start difference. First operand has 54 places, 38 transitions, 169 flow. Second operand 5 states and 630 transitions. [2022-12-13 15:42:30,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 72 transitions, 466 flow [2022-12-13 15:42:30,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:42:30,896 INFO L231 Difference]: Finished difference. Result has 60 places, 43 transitions, 237 flow [2022-12-13 15:42:30,897 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=168, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=237, PETRI_PLACES=60, PETRI_TRANSITIONS=43} [2022-12-13 15:42:30,897 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 15 predicate places. [2022-12-13 15:42:30,897 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 43 transitions, 237 flow [2022-12-13 15:42:30,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 121.4) internal successors, (607), 5 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:30,898 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:30,898 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] [2022-12-13 15:42:30,906 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 15:42:31,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:31,100 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:31,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:31,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1415138579, now seen corresponding path program 1 times [2022-12-13 15:42:31,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:42:31,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [117621208] [2022-12-13 15:42:31,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 15:42:31,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:31,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:42:31,106 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:42:31,109 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 15:42:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 15:42:31,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-13 15:42:31,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 15:42:31,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 15:42:31,582 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 15:42:31,582 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 15:42:31,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [117621208] [2022-12-13 15:42:31,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [117621208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 15:42:31,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 15:42:31,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 15:42:31,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637338819] [2022-12-13 15:42:31,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 15:42:31,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 15:42:31,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 15:42:31,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 15:42:31,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 15:42:31,794 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 267 [2022-12-13 15:42:31,795 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 43 transitions, 237 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:31,795 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 15:42:31,795 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 267 [2022-12-13 15:42:31,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 15:42:32,128 INFO L130 PetriNetUnfolder]: 475/947 cut-off events. [2022-12-13 15:42:32,128 INFO L131 PetriNetUnfolder]: For 853/865 co-relation queries the response was YES. [2022-12-13 15:42:32,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2843 conditions, 947 events. 475/947 cut-off events. For 853/865 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 5331 event pairs, 98 based on Foata normal form. 14/946 useless extension candidates. Maximal degree in co-relation 2827. Up to 824 conditions per place. [2022-12-13 15:42:32,131 INFO L137 encePairwiseOnDemand]: 263/267 looper letters, 31 selfloop transitions, 3 changer transitions 17/55 dead transitions. [2022-12-13 15:42:32,131 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 55 transitions, 385 flow [2022-12-13 15:42:32,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 15:42:32,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 15:42:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 563 transitions. [2022-12-13 15:42:32,132 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4217228464419476 [2022-12-13 15:42:32,132 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 563 transitions. [2022-12-13 15:42:32,132 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 563 transitions. [2022-12-13 15:42:32,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 15:42:32,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 563 transitions. [2022-12-13 15:42:32,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.6) internal successors, (563), 5 states have internal predecessors, (563), 0 states have call successors, (0), 0 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 15:42:32,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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 15:42:32,134 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 267.0) internal successors, (1602), 6 states have internal predecessors, (1602), 0 states have call successors, (0), 0 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 15:42:32,134 INFO L175 Difference]: Start difference. First operand has 60 places, 43 transitions, 237 flow. Second operand 5 states and 563 transitions. [2022-12-13 15:42:32,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 55 transitions, 385 flow [2022-12-13 15:42:32,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 55 transitions, 384 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 15:42:32,138 INFO L231 Difference]: Finished difference. Result has 62 places, 31 transitions, 138 flow [2022-12-13 15:42:32,138 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=62, PETRI_TRANSITIONS=31} [2022-12-13 15:42:32,138 INFO L288 CegarLoopForPetriNet]: 45 programPoint places, 17 predicate places. [2022-12-13 15:42:32,139 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 31 transitions, 138 flow [2022-12-13 15:42:32,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 15:42:32,139 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 15:42:32,139 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] [2022-12-13 15:42:32,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-12-13 15:42:32,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:32,340 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 15:42:32,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 15:42:32,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2008701140, now seen corresponding path program 4 times [2022-12-13 15:42:32,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 15:42:32,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319534061] [2022-12-13 15:42:32,343 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 15:42:32,344 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:32,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 15:42:32,347 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 15:42:32,350 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 15:42:32,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 15:42:32,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 15:42:32,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 15:42:32,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 15:42:32,593 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 15:42:32,593 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 15:42:32,594 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-13 15:42:32,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-13 15:42:32,595 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-13 15:42:32,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-13 15:42:32,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-13 15:42:32,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-13 15:42:32,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-13 15:42:32,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-13 15:42:32,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-13 15:42:32,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-13 15:42:32,596 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-13 15:42:32,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-13 15:42:32,597 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-13 15:42:32,605 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-13 15:42:32,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 15:42:32,799 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-12-13 15:42:32,814 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 15:42:32,814 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 15:42:32,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 03:42:32 BasicIcfg [2022-12-13 15:42:32,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 15:42:32,883 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 15:42:32,883 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 15:42:32,883 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 15:42:32,883 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 03:42:19" (3/4) ... [2022-12-13 15:42:32,885 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 15:42:32,885 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 15:42:32,886 INFO L158 Benchmark]: Toolchain (without parser) took 14709.79ms. Allocated memory was 69.2MB in the beginning and 192.9MB in the end (delta: 123.7MB). Free memory was 46.7MB in the beginning and 138.2MB in the end (delta: -91.6MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2022-12-13 15:42:32,886 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 54.5MB. Free memory is still 33.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:42:32,886 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.67ms. Allocated memory is still 69.2MB. Free memory was 46.5MB in the beginning and 37.1MB in the end (delta: 9.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-12-13 15:42:32,886 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.63ms. Allocated memory is still 69.2MB. Free memory was 37.1MB in the beginning and 34.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:42:32,887 INFO L158 Benchmark]: Boogie Preprocessor took 25.51ms. Allocated memory is still 69.2MB. Free memory was 34.7MB in the beginning and 32.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 15:42:32,887 INFO L158 Benchmark]: RCFGBuilder took 606.00ms. Allocated memory is still 69.2MB. Free memory was 32.3MB in the beginning and 30.0MB in the end (delta: 2.4MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2022-12-13 15:42:32,887 INFO L158 Benchmark]: TraceAbstraction took 13611.53ms. Allocated memory was 69.2MB in the beginning and 192.9MB in the end (delta: 123.7MB). Free memory was 29.3MB in the beginning and 138.2MB in the end (delta: -109.0MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. [2022-12-13 15:42:32,887 INFO L158 Benchmark]: Witness Printer took 2.38ms. Allocated memory is still 192.9MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 15:42:32,888 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 54.5MB. Free memory is still 33.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.67ms. Allocated memory is still 69.2MB. Free memory was 46.5MB in the beginning and 37.1MB in the end (delta: 9.4MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.63ms. Allocated memory is still 69.2MB. Free memory was 37.1MB in the beginning and 34.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.51ms. Allocated memory is still 69.2MB. Free memory was 34.7MB in the beginning and 32.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 606.00ms. Allocated memory is still 69.2MB. Free memory was 32.3MB in the beginning and 30.0MB in the end (delta: 2.4MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13611.53ms. Allocated memory was 69.2MB in the beginning and 192.9MB in the end (delta: 123.7MB). Free memory was 29.3MB in the beginning and 138.2MB in the end (delta: -109.0MB). Peak memory consumption was 119.2MB. Max. memory is 16.1GB. * Witness Printer took 2.38ms. Allocated memory is still 192.9MB. Free memory is still 138.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.0s, 140 PlacesBefore, 45 PlacesAfterwards, 132 TransitionsBefore, 36 TransitionsAfterwards, 2824 CoEnabledTransitionPairs, 7 FixpointIterations, 56 TrivialSequentialCompositions, 68 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 132 TotalNumberOfCompositions, 8516 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4168, independent: 3939, independent conditional: 0, independent unconditional: 3939, dependent: 229, dependent conditional: 0, dependent unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1436, independent: 1403, independent conditional: 0, independent unconditional: 1403, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4168, independent: 2536, independent conditional: 0, independent unconditional: 2536, dependent: 196, dependent conditional: 0, dependent unconditional: 196, unknown: 1436, unknown conditional: 0, unknown unconditional: 1436] , Statistics on independence cache: Total cache size (in pairs): 164, Positive cache size: 146, Positive conditional cache size: 0, Positive unconditional cache size: 146, Negative cache size: 18, Negative conditional cache size: 0, Negative unconditional cache size: 18, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool a$flush_delayed; [L725] 0 int a$mem_tmp; [L726] 0 _Bool a$r_buff0_thd0; [L727] 0 _Bool a$r_buff0_thd1; [L728] 0 _Bool a$r_buff0_thd2; [L729] 0 _Bool a$r_buff0_thd3; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$read_delayed; [L735] 0 int *a$read_delayed_var; [L736] 0 int a$w_buff0; [L737] 0 _Bool a$w_buff0_used; [L738] 0 int a$w_buff1; [L739] 0 _Bool a$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t38; [L856] FCALL, FORK 0 pthread_create(&t38, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t38, ((void *)0), P0, ((void *)0))=0, t38={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L757] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L757] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L765] 1 x = 1 [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L857] 0 pthread_t t39; [L858] FCALL, FORK 0 pthread_create(&t39, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t39, ((void *)0), P1, ((void *)0))=1, t38={3:0}, t39={7:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L859] 0 pthread_t t40; [L860] FCALL, FORK 0 pthread_create(&t40, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t40, ((void *)0), P2, ((void *)0))=2, t38={3:0}, t39={7:0}, t40={11:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L814] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice2=0, x=1, y=1, z=1] [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 1 return 0; [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L864] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L864] RET 0 assume_abort_if_not(main$tmp_guard0) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t38={3:0}, t39={7:0}, t40={11:0}, weak$$choice0=2, weak$$choice2=0, x=1, y=1, z=1] [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, weak$$choice2=0, x=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 853]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 166 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.4s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 335 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 268 mSDsluCounter, 141 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1135 IncrementalHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 7 mSDtfsCounter, 1135 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237occurred in iteration=8, InterpolantAutomatonStates: 40, 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.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 174 NumberOfCodeBlocks, 174 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 140 ConstructedInterpolants, 22 QuantifiedInterpolants, 1272 SizeOfPredicates, 20 NumberOfNonLiveVariables, 1183 ConjunctsInSsa, 63 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 could not prove your program: unable to determine feasibility of some traces [2022-12-13 15:42:32,902 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a33a70d5-1ce7-4918-9900-79001c2812fd/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 Result: UNKNOWN: Overapproximated counterexample