./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/thin002_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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_d89d090d-70db-4e01-8ec9-7288391cb552/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 e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 --- 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 18:11:26,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:11:26,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:11:26,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:11:26,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:11:26,486 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:11:26,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:11:26,489 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:11:26,490 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:11:26,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:11:26,492 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:11:26,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:11:26,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:11:26,494 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:11:26,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:11:26,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:11:26,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:11:26,497 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:11:26,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:11:26,500 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:11:26,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:11:26,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:11:26,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:11:26,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:11:26,514 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:11:26,514 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:11:26,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:11:26,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:11:26,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:11:26,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:11:26,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:11:26,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:11:26,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:11:26,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:11:26,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:11:26,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:11:26,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:11:26,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:11:26,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:11:26,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:11:26,523 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:11:26,524 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 18:11:26,539 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:11:26,540 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:11:26,540 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:11:26,540 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:11:26,541 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:11:26,541 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:11:26,541 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:11:26,541 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:11:26,541 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:11:26,542 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:11:26,542 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:11:26,555 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 18:11:26,555 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:11:26,555 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:11:26,556 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:11:26,556 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 18:11:26,556 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 18:11:26,556 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 18:11:26,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:11:26,556 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 18:11:26,556 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:11:26,557 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:11:26,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:11:26,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:11:26,557 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:11:26,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:11:26,557 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:11:26,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:11:26,558 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:11:26,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:11:26,558 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:11:26,558 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:11:26,558 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:11:26,558 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:11:26,558 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_d89d090d-70db-4e01-8ec9-7288391cb552/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_d89d090d-70db-4e01-8ec9-7288391cb552/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 -> e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 [2022-12-13 18:11:26,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:11:26,734 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:11:26,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:11:26,737 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:11:26,738 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:11:26,739 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/thin002_power.opt.i [2022-12-13 18:11:29,287 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:11:29,493 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:11:29,494 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/sv-benchmarks/c/pthread-wmm/thin002_power.opt.i [2022-12-13 18:11:29,507 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/data/70ad86923/bee4e5adbf21483ebd31163518d659a2/FLAG644291f81 [2022-12-13 18:11:29,848 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/data/70ad86923/bee4e5adbf21483ebd31163518d659a2 [2022-12-13 18:11:29,850 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:11:29,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:11:29,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:11:29,853 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:11:29,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:11:29,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:11:29" (1/1) ... [2022-12-13 18:11:29,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10939417 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:11:29, skipping insertion in model container [2022-12-13 18:11:29,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:11:29" (1/1) ... [2022-12-13 18:11:29,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:11:29,901 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:11:30,033 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_d89d090d-70db-4e01-8ec9-7288391cb552/sv-benchmarks/c/pthread-wmm/thin002_power.opt.i[951,964] [2022-12-13 18:11:30,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,151 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,153 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,155 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,158 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,161 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,162 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,163 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,181 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,184 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,192 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,193 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,196 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,199 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:11:30,211 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:11:30,221 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_d89d090d-70db-4e01-8ec9-7288391cb552/sv-benchmarks/c/pthread-wmm/thin002_power.opt.i[951,964] [2022-12-13 18:11:30,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,245 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,246 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,249 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,250 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,251 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,252 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,255 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,270 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,273 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,278 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,281 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:11:30,282 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:11:30,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:11:30,311 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:11:30,312 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:11:30 WrapperNode [2022-12-13 18:11:30,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:11:30,313 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:11:30,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:11:30,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:11:30,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:11:30" (1/1) ... [2022-12-13 18:11:30,334 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:11:30" (1/1) ... [2022-12-13 18:11:30,359 INFO L138 Inliner]: procedures = 177, calls = 84, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 199 [2022-12-13 18:11:30,360 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:11:30,360 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:11:30,360 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:11:30,360 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:11:30,369 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:11:30" (1/1) ... [2022-12-13 18:11:30,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:11:30" (1/1) ... [2022-12-13 18:11:30,372 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:11:30" (1/1) ... [2022-12-13 18:11:30,373 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:11:30" (1/1) ... [2022-12-13 18:11:30,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:11:30" (1/1) ... [2022-12-13 18:11:30,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:11:30" (1/1) ... [2022-12-13 18:11:30,384 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:11:30" (1/1) ... [2022-12-13 18:11:30,386 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:11:30" (1/1) ... [2022-12-13 18:11:30,390 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:11:30,391 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:11:30,391 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:11:30,391 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:11:30,391 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:11:30" (1/1) ... [2022-12-13 18:11:30,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:11:30,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:11:30,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:11:30,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:11:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 18:11:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 18:11:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 18:11:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:11:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 18:11:30,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:11:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 18:11:30,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 18:11:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 18:11:30,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 18:11:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 18:11:30,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 18:11:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 18:11:30,456 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 18:11:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:11:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 18:11:30,456 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:11:30,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:11:30,458 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 18:11:30,576 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:11:30,577 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:11:30,990 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:11:31,461 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:11:31,461 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 18:11:31,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:11:31 BoogieIcfgContainer [2022-12-13 18:11:31,463 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:11:31,465 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:11:31,465 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:11:31,467 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:11:31,467 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:11:29" (1/3) ... [2022-12-13 18:11:31,467 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b3b34d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:11:31, skipping insertion in model container [2022-12-13 18:11:31,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:11:30" (2/3) ... [2022-12-13 18:11:31,468 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b3b34d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:11:31, skipping insertion in model container [2022-12-13 18:11:31,468 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:11:31" (3/3) ... [2022-12-13 18:11:31,469 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.opt.i [2022-12-13 18:11:31,483 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:11:31,483 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-12-13 18:11:31,483 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 18:11:31,554 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 18:11:31,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 209 places, 198 transitions, 416 flow [2022-12-13 18:11:31,654 INFO L130 PetriNetUnfolder]: 2/194 cut-off events. [2022-12-13 18:11:31,654 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:11:31,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 194 events. 2/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 245 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-12-13 18:11:31,660 INFO L82 GeneralOperation]: Start removeDead. Operand has 209 places, 198 transitions, 416 flow [2022-12-13 18:11:31,666 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 205 places, 194 transitions, 400 flow [2022-12-13 18:11:31,669 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 18:11:31,679 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 194 transitions, 400 flow [2022-12-13 18:11:31,682 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 205 places, 194 transitions, 400 flow [2022-12-13 18:11:31,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 205 places, 194 transitions, 400 flow [2022-12-13 18:11:31,733 INFO L130 PetriNetUnfolder]: 2/194 cut-off events. [2022-12-13 18:11:31,733 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:11:31,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 194 events. 2/194 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 250 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-12-13 18:11:31,737 INFO L119 LiptonReduction]: Number of co-enabled transitions 6900 [2022-12-13 18:11:46,756 INFO L134 LiptonReduction]: Checked pairs total: 31719 [2022-12-13 18:11:46,756 INFO L136 LiptonReduction]: Total number of compositions: 173 [2022-12-13 18:11:46,770 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:11:46,774 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;@399af1d6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:11:46,775 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-12-13 18:11:46,776 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 18:11:46,776 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:11:46,776 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:11:46,776 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 18:11:46,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:11:46,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:11:46,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1226, now seen corresponding path program 1 times [2022-12-13 18:11:46,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:11:46,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281020303] [2022-12-13 18:11:46,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:11:46,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:11:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:11:46,876 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 18:11:46,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:11:46,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281020303] [2022-12-13 18:11:46,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281020303] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:11:46,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:11:46,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 18:11:46,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753782107] [2022-12-13 18:11:46,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:11:46,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 18:11:46,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:11:46,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 18:11:46,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 18:11:46,903 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 371 [2022-12-13 18:11:46,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 73 transitions, 158 flow. Second operand has 2 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:11:46,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:11:46,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 371 [2022-12-13 18:11:46,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:11:53,257 INFO L130 PetriNetUnfolder]: 44651/59351 cut-off events. [2022-12-13 18:11:53,258 INFO L131 PetriNetUnfolder]: For 92/92 co-relation queries the response was YES. [2022-12-13 18:11:53,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 118819 conditions, 59351 events. 44651/59351 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 3452. Compared 381139 event pairs, 44651 based on Foata normal form. 0/36118 useless extension candidates. Maximal degree in co-relation 118807. Up to 59257 conditions per place. [2022-12-13 18:11:53,624 INFO L137 encePairwiseOnDemand]: 348/371 looper letters, 45 selfloop transitions, 0 changer transitions 0/49 dead transitions. [2022-12-13 18:11:53,624 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 49 transitions, 200 flow [2022-12-13 18:11:53,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 18:11:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 18:11:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 376 transitions. [2022-12-13 18:11:53,636 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5067385444743935 [2022-12-13 18:11:53,637 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 376 transitions. [2022-12-13 18:11:53,638 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 376 transitions. [2022-12-13 18:11:53,639 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:11:53,641 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 376 transitions. [2022-12-13 18:11:53,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 188.0) internal successors, (376), 2 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:11:53,648 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:11:53,649 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:11:53,650 INFO L175 Difference]: Start difference. First operand has 85 places, 73 transitions, 158 flow. Second operand 2 states and 376 transitions. [2022-12-13 18:11:53,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 49 transitions, 200 flow [2022-12-13 18:11:53,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 49 transitions, 196 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 18:11:53,656 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 106 flow [2022-12-13 18:11:53,658 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2022-12-13 18:11:53,660 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -26 predicate places. [2022-12-13 18:11:53,661 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 106 flow [2022-12-13 18:11:53,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:11:53,661 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:11:53,661 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:11:53,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:11:53,662 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:11:53,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:11:53,662 INFO L85 PathProgramCache]: Analyzing trace with hash 17959134, now seen corresponding path program 1 times [2022-12-13 18:11:53,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:11:53,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948521678] [2022-12-13 18:11:53,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:11:53,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:11:53,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:11:53,953 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 18:11:53,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:11:53,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948521678] [2022-12-13 18:11:53,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948521678] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:11:53,954 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:11:53,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:11:53,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996930307] [2022-12-13 18:11:53,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:11:53,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:11:53,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:11:53,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:11:53,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:11:53,961 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 371 [2022-12-13 18:11:53,962 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:11:53,962 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:11:53,962 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 371 [2022-12-13 18:11:53,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:11:59,689 INFO L130 PetriNetUnfolder]: 40043/53222 cut-off events. [2022-12-13 18:11:59,689 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:11:59,793 INFO L83 FinitePrefix]: Finished finitePrefix Result has 106603 conditions, 53222 events. 40043/53222 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3100. Compared 360365 event pairs, 7787 based on Foata normal form. 0/33103 useless extension candidates. Maximal degree in co-relation 106600. Up to 42463 conditions per place. [2022-12-13 18:12:00,001 INFO L137 encePairwiseOnDemand]: 368/371 looper letters, 72 selfloop transitions, 2 changer transitions 0/78 dead transitions. [2022-12-13 18:12:00,001 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 314 flow [2022-12-13 18:12:00,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:12:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:12:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 534 transitions. [2022-12-13 18:12:00,005 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4797843665768194 [2022-12-13 18:12:00,005 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 534 transitions. [2022-12-13 18:12:00,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 534 transitions. [2022-12-13 18:12:00,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:12:00,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 534 transitions. [2022-12-13 18:12:00,007 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:00,010 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:00,010 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:00,010 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 106 flow. Second operand 3 states and 534 transitions. [2022-12-13 18:12:00,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 314 flow [2022-12-13 18:12:00,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 78 transitions, 314 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 18:12:00,012 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 108 flow [2022-12-13 18:12:00,012 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2022-12-13 18:12:00,013 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -25 predicate places. [2022-12-13 18:12:00,013 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 108 flow [2022-12-13 18:12:00,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:00,013 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:12:00,014 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:12:00,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:12:00,014 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:12:00,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:12:00,014 INFO L85 PathProgramCache]: Analyzing trace with hash 556734165, now seen corresponding path program 1 times [2022-12-13 18:12:00,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:12:00,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582148911] [2022-12-13 18:12:00,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:12:00,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:12:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:12:00,185 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 18:12:00,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:12:00,186 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582148911] [2022-12-13 18:12:00,186 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582148911] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:12:00,186 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:12:00,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:12:00,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583026051] [2022-12-13 18:12:00,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:12:00,187 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:12:00,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:12:00,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:12:00,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:12:00,252 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 371 [2022-12-13 18:12:00,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:00,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:12:00,254 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 371 [2022-12-13 18:12:00,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:12:04,060 INFO L130 PetriNetUnfolder]: 30416/41534 cut-off events. [2022-12-13 18:12:04,060 INFO L131 PetriNetUnfolder]: For 1233/1233 co-relation queries the response was YES. [2022-12-13 18:12:04,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84012 conditions, 41534 events. 30416/41534 cut-off events. For 1233/1233 co-relation queries the response was YES. Maximal size of possible extension queue 2199. Compared 266327 event pairs, 13706 based on Foata normal form. 0/29497 useless extension candidates. Maximal degree in co-relation 84008. Up to 17047 conditions per place. [2022-12-13 18:12:04,270 INFO L137 encePairwiseOnDemand]: 355/371 looper letters, 69 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2022-12-13 18:12:04,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 82 transitions, 336 flow [2022-12-13 18:12:04,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:12:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:12:04,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 686 transitions. [2022-12-13 18:12:04,273 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46226415094339623 [2022-12-13 18:12:04,273 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 686 transitions. [2022-12-13 18:12:04,273 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 686 transitions. [2022-12-13 18:12:04,273 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:12:04,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 686 transitions. [2022-12-13 18:12:04,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.5) internal successors, (686), 4 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:04,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:04,278 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:04,278 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 108 flow. Second operand 4 states and 686 transitions. [2022-12-13 18:12:04,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 82 transitions, 336 flow [2022-12-13 18:12:04,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 82 transitions, 328 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:12:04,292 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 184 flow [2022-12-13 18:12:04,292 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=184, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2022-12-13 18:12:04,293 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -23 predicate places. [2022-12-13 18:12:04,293 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 184 flow [2022-12-13 18:12:04,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:04,294 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:12:04,294 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:12:04,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 18:12:04,294 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:12:04,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:12:04,295 INFO L85 PathProgramCache]: Analyzing trace with hash 556734166, now seen corresponding path program 1 times [2022-12-13 18:12:04,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:12:04,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178859580] [2022-12-13 18:12:04,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:12:04,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:12:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:12:04,359 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 18:12:04,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:12:04,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178859580] [2022-12-13 18:12:04,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1178859580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:12:04,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:12:04,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:12:04,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608364824] [2022-12-13 18:12:04,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:12:04,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:12:04,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:12:04,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:12:04,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:12:04,364 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 371 [2022-12-13 18:12:04,365 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:04,365 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:12:04,365 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 371 [2022-12-13 18:12:04,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:12:09,496 INFO L130 PetriNetUnfolder]: 38687/52496 cut-off events. [2022-12-13 18:12:09,496 INFO L131 PetriNetUnfolder]: For 12150/12150 co-relation queries the response was YES. [2022-12-13 18:12:09,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 128169 conditions, 52496 events. 38687/52496 cut-off events. For 12150/12150 co-relation queries the response was YES. Maximal size of possible extension queue 2852. Compared 348724 event pairs, 24440 based on Foata normal form. 0/43933 useless extension candidates. Maximal degree in co-relation 128163. Up to 40756 conditions per place. [2022-12-13 18:12:09,765 INFO L137 encePairwiseOnDemand]: 364/371 looper letters, 79 selfloop transitions, 8 changer transitions 0/91 dead transitions. [2022-12-13 18:12:09,766 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 91 transitions, 498 flow [2022-12-13 18:12:09,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:12:09,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:12:09,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 531 transitions. [2022-12-13 18:12:09,768 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.477088948787062 [2022-12-13 18:12:09,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 531 transitions. [2022-12-13 18:12:09,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 531 transitions. [2022-12-13 18:12:09,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:12:09,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 531 transitions. [2022-12-13 18:12:09,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 177.0) internal successors, (531), 3 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:09,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:09,771 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:09,771 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 184 flow. Second operand 3 states and 531 transitions. [2022-12-13 18:12:09,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 91 transitions, 498 flow [2022-12-13 18:12:09,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 91 transitions, 495 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:12:09,808 INFO L231 Difference]: Finished difference. Result has 64 places, 60 transitions, 256 flow [2022-12-13 18:12:09,809 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=64, PETRI_TRANSITIONS=60} [2022-12-13 18:12:09,809 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -21 predicate places. [2022-12-13 18:12:09,809 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 60 transitions, 256 flow [2022-12-13 18:12:09,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:09,810 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:12:09,810 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:12:09,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 18:12:09,810 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:12:09,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:12:09,810 INFO L85 PathProgramCache]: Analyzing trace with hash 556734168, now seen corresponding path program 1 times [2022-12-13 18:12:09,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:12:09,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662161406] [2022-12-13 18:12:09,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:12:09,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:12:09,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:12:09,952 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 18:12:09,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:12:09,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662161406] [2022-12-13 18:12:09,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662161406] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:12:09,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:12:09,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:12:09,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194559394] [2022-12-13 18:12:09,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:12:09,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:12:09,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:12:09,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:12:09,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:12:09,995 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 371 [2022-12-13 18:12:09,997 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 60 transitions, 256 flow. Second operand has 4 states, 4 states have (on average 155.25) internal successors, (621), 4 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:09,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:12:09,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 371 [2022-12-13 18:12:09,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:12:12,923 INFO L130 PetriNetUnfolder]: 16031/22298 cut-off events. [2022-12-13 18:12:12,923 INFO L131 PetriNetUnfolder]: For 14418/14535 co-relation queries the response was YES. [2022-12-13 18:12:12,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64255 conditions, 22298 events. 16031/22298 cut-off events. For 14418/14535 co-relation queries the response was YES. Maximal size of possible extension queue 1279. Compared 136574 event pairs, 13295 based on Foata normal form. 4203/24544 useless extension candidates. Maximal degree in co-relation 64247. Up to 21915 conditions per place. [2022-12-13 18:12:13,039 INFO L137 encePairwiseOnDemand]: 363/371 looper letters, 48 selfloop transitions, 1 changer transitions 0/53 dead transitions. [2022-12-13 18:12:13,039 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 53 transitions, 338 flow [2022-12-13 18:12:13,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:12:13,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:12:13,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 501 transitions. [2022-12-13 18:12:13,041 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4501347708894879 [2022-12-13 18:12:13,042 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 501 transitions. [2022-12-13 18:12:13,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 501 transitions. [2022-12-13 18:12:13,042 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:12:13,042 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 501 transitions. [2022-12-13 18:12:13,043 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.0) internal successors, (501), 3 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:13,044 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:13,045 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:13,045 INFO L175 Difference]: Start difference. First operand has 64 places, 60 transitions, 256 flow. Second operand 3 states and 501 transitions. [2022-12-13 18:12:13,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 53 transitions, 338 flow [2022-12-13 18:12:13,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 53 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:12:13,087 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 234 flow [2022-12-13 18:12:13,087 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=234, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2022-12-13 18:12:13,088 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -27 predicate places. [2022-12-13 18:12:13,088 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 234 flow [2022-12-13 18:12:13,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 155.25) internal successors, (621), 4 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:13,088 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:12:13,088 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:12:13,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 18:12:13,089 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:12:13,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:12:13,089 INFO L85 PathProgramCache]: Analyzing trace with hash -254402953, now seen corresponding path program 1 times [2022-12-13 18:12:13,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:12:13,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054671320] [2022-12-13 18:12:13,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:12:13,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:12:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:12:13,173 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 18:12:13,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:12:13,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054671320] [2022-12-13 18:12:13,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054671320] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:12:13,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:12:13,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:12:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069611827] [2022-12-13 18:12:13,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:12:13,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:12:13,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:12:13,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:12:13,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:12:13,177 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 371 [2022-12-13 18:12:13,178 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:13,178 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:12:13,178 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 371 [2022-12-13 18:12:13,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:12:15,567 INFO L130 PetriNetUnfolder]: 15689/22019 cut-off events. [2022-12-13 18:12:15,567 INFO L131 PetriNetUnfolder]: For 11808/11808 co-relation queries the response was YES. [2022-12-13 18:12:15,613 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62114 conditions, 22019 events. 15689/22019 cut-off events. For 11808/11808 co-relation queries the response was YES. Maximal size of possible extension queue 1285. Compared 137796 event pairs, 5054 based on Foata normal form. 0/20206 useless extension candidates. Maximal degree in co-relation 62106. Up to 17008 conditions per place. [2022-12-13 18:12:15,679 INFO L137 encePairwiseOnDemand]: 367/371 looper letters, 71 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2022-12-13 18:12:15,679 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 80 transitions, 503 flow [2022-12-13 18:12:15,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:12:15,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:12:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2022-12-13 18:12:15,681 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46271338724168914 [2022-12-13 18:12:15,681 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2022-12-13 18:12:15,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2022-12-13 18:12:15,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:12:15,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2022-12-13 18:12:15,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:15,684 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:15,684 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:15,684 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 234 flow. Second operand 3 states and 515 transitions. [2022-12-13 18:12:15,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 80 transitions, 503 flow [2022-12-13 18:12:15,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 80 transitions, 502 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:12:15,687 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 252 flow [2022-12-13 18:12:15,687 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2022-12-13 18:12:15,688 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -25 predicate places. [2022-12-13 18:12:15,688 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 252 flow [2022-12-13 18:12:15,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:15,688 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:12:15,688 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:12:15,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 18:12:15,689 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:12:15,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:12:15,689 INFO L85 PathProgramCache]: Analyzing trace with hash -254402612, now seen corresponding path program 1 times [2022-12-13 18:12:15,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:12:15,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652754137] [2022-12-13 18:12:15,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:12:15,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:12:15,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:12:15,795 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 18:12:15,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:12:15,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652754137] [2022-12-13 18:12:15,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652754137] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:12:15,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:12:15,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:12:15,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76232454] [2022-12-13 18:12:15,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:12:15,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:12:15,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:12:15,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:12:15,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:12:15,800 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 371 [2022-12-13 18:12:15,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:15,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:12:15,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 371 [2022-12-13 18:12:15,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:12:18,129 INFO L130 PetriNetUnfolder]: 15578/21710 cut-off events. [2022-12-13 18:12:18,129 INFO L131 PetriNetUnfolder]: For 14265/14382 co-relation queries the response was YES. [2022-12-13 18:12:18,175 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63424 conditions, 21710 events. 15578/21710 cut-off events. For 14265/14382 co-relation queries the response was YES. Maximal size of possible extension queue 1276. Compared 132875 event pairs, 5462 based on Foata normal form. 0/20068 useless extension candidates. Maximal degree in co-relation 63415. Up to 19297 conditions per place. [2022-12-13 18:12:18,237 INFO L137 encePairwiseOnDemand]: 368/371 looper letters, 75 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2022-12-13 18:12:18,238 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 81 transitions, 535 flow [2022-12-13 18:12:18,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:12:18,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:12:18,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2022-12-13 18:12:18,240 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4618149146451033 [2022-12-13 18:12:18,240 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 514 transitions. [2022-12-13 18:12:18,240 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 514 transitions. [2022-12-13 18:12:18,240 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:12:18,240 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 514 transitions. [2022-12-13 18:12:18,241 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:18,242 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:18,243 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:18,243 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 252 flow. Second operand 3 states and 514 transitions. [2022-12-13 18:12:18,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 81 transitions, 535 flow [2022-12-13 18:12:18,249 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 81 transitions, 521 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:12:18,250 INFO L231 Difference]: Finished difference. Result has 61 places, 53 transitions, 250 flow [2022-12-13 18:12:18,250 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=61, PETRI_TRANSITIONS=53} [2022-12-13 18:12:18,251 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -24 predicate places. [2022-12-13 18:12:18,251 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 53 transitions, 250 flow [2022-12-13 18:12:18,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.66666666666666) internal successors, (467), 3 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:18,251 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:12:18,251 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:12:18,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 18:12:18,252 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:12:18,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:12:18,252 INFO L85 PathProgramCache]: Analyzing trace with hash 768105467, now seen corresponding path program 1 times [2022-12-13 18:12:18,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:12:18,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074732413] [2022-12-13 18:12:18,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:12:18,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:12:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:12:18,365 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 18:12:18,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:12:18,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074732413] [2022-12-13 18:12:18,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074732413] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:12:18,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:12:18,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:12:18,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934235815] [2022-12-13 18:12:18,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:12:18,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:12:18,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:12:18,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:12:18,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:12:18,371 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 371 [2022-12-13 18:12:18,371 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 53 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:18,371 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:12:18,371 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 371 [2022-12-13 18:12:18,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:12:22,873 INFO L130 PetriNetUnfolder]: 29187/40320 cut-off events. [2022-12-13 18:12:22,873 INFO L131 PetriNetUnfolder]: For 32760/32856 co-relation queries the response was YES. [2022-12-13 18:12:22,965 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119899 conditions, 40320 events. 29187/40320 cut-off events. For 32760/32856 co-relation queries the response was YES. Maximal size of possible extension queue 2194. Compared 267774 event pairs, 8728 based on Foata normal form. 258/37811 useless extension candidates. Maximal degree in co-relation 119889. Up to 14528 conditions per place. [2022-12-13 18:12:23,078 INFO L137 encePairwiseOnDemand]: 367/371 looper letters, 129 selfloop transitions, 3 changer transitions 0/135 dead transitions. [2022-12-13 18:12:23,078 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 135 transitions, 933 flow [2022-12-13 18:12:23,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:12:23,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:12:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 692 transitions. [2022-12-13 18:12:23,080 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46630727762803237 [2022-12-13 18:12:23,080 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 692 transitions. [2022-12-13 18:12:23,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 692 transitions. [2022-12-13 18:12:23,080 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:12:23,081 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 692 transitions. [2022-12-13 18:12:23,081 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 173.0) internal successors, (692), 4 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:23,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:23,083 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:23,083 INFO L175 Difference]: Start difference. First operand has 61 places, 53 transitions, 250 flow. Second operand 4 states and 692 transitions. [2022-12-13 18:12:23,083 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 135 transitions, 933 flow [2022-12-13 18:12:23,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 135 transitions, 927 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:12:23,090 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 265 flow [2022-12-13 18:12:23,090 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=265, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2022-12-13 18:12:23,091 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -21 predicate places. [2022-12-13 18:12:23,091 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 265 flow [2022-12-13 18:12:23,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.0) internal successors, (612), 4 states have internal predecessors, (612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:23,091 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:12:23,091 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:12:23,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 18:12:23,091 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:12:23,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:12:23,092 INFO L85 PathProgramCache]: Analyzing trace with hash 700479556, now seen corresponding path program 1 times [2022-12-13 18:12:23,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:12:23,092 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023917945] [2022-12-13 18:12:23,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:12:23,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:12:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:12:23,316 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 18:12:23,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:12:23,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023917945] [2022-12-13 18:12:23,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023917945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:12:23,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:12:23,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:12:23,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992636245] [2022-12-13 18:12:23,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:12:23,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:12:23,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:12:23,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:12:23,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:12:23,382 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 371 [2022-12-13 18:12:23,383 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 265 flow. Second operand has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:23,383 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:12:23,383 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 371 [2022-12-13 18:12:23,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:12:28,102 INFO L130 PetriNetUnfolder]: 32542/45943 cut-off events. [2022-12-13 18:12:28,103 INFO L131 PetriNetUnfolder]: For 25773/25860 co-relation queries the response was YES. [2022-12-13 18:12:28,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 135746 conditions, 45943 events. 32542/45943 cut-off events. For 25773/25860 co-relation queries the response was YES. Maximal size of possible extension queue 2852. Compared 321747 event pairs, 6439 based on Foata normal form. 87/42882 useless extension candidates. Maximal degree in co-relation 135734. Up to 20756 conditions per place. [2022-12-13 18:12:28,403 INFO L137 encePairwiseOnDemand]: 367/371 looper letters, 120 selfloop transitions, 5 changer transitions 0/129 dead transitions. [2022-12-13 18:12:28,404 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 129 transitions, 853 flow [2022-12-13 18:12:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:12:28,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 18:12:28,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 831 transitions. [2022-12-13 18:12:28,406 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44797843665768194 [2022-12-13 18:12:28,406 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 831 transitions. [2022-12-13 18:12:28,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 831 transitions. [2022-12-13 18:12:28,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:12:28,407 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 831 transitions. [2022-12-13 18:12:28,408 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.2) internal successors, (831), 5 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:28,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 371.0) internal successors, (2226), 6 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:28,410 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 371.0) internal successors, (2226), 6 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:28,410 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 265 flow. Second operand 5 states and 831 transitions. [2022-12-13 18:12:28,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 129 transitions, 853 flow [2022-12-13 18:12:28,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 129 transitions, 848 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:12:28,417 INFO L231 Difference]: Finished difference. Result has 69 places, 57 transitions, 307 flow [2022-12-13 18:12:28,418 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=307, PETRI_PLACES=69, PETRI_TRANSITIONS=57} [2022-12-13 18:12:28,418 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -16 predicate places. [2022-12-13 18:12:28,418 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 57 transitions, 307 flow [2022-12-13 18:12:28,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:28,419 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:12:28,419 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:12:28,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 18:12:28,420 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:12:28,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:12:28,420 INFO L85 PathProgramCache]: Analyzing trace with hash 703451835, now seen corresponding path program 1 times [2022-12-13 18:12:28,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:12:28,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127498257] [2022-12-13 18:12:28,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:12:28,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:12:28,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:12:28,604 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 18:12:28,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:12:28,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127498257] [2022-12-13 18:12:28,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127498257] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:12:28,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:12:28,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:12:28,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758969530] [2022-12-13 18:12:28,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:12:28,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:12:28,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:12:28,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:12:28,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:12:28,677 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 371 [2022-12-13 18:12:28,678 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 57 transitions, 307 flow. Second operand has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:28,678 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:12:28,678 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 371 [2022-12-13 18:12:28,678 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:12:33,968 INFO L130 PetriNetUnfolder]: 35773/50677 cut-off events. [2022-12-13 18:12:33,968 INFO L131 PetriNetUnfolder]: For 36831/36918 co-relation queries the response was YES. [2022-12-13 18:12:34,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152468 conditions, 50677 events. 35773/50677 cut-off events. For 36831/36918 co-relation queries the response was YES. Maximal size of possible extension queue 3244. Compared 360314 event pairs, 5143 based on Foata normal form. 474/47760 useless extension candidates. Maximal degree in co-relation 152453. Up to 22661 conditions per place. [2022-12-13 18:12:34,320 INFO L137 encePairwiseOnDemand]: 360/371 looper letters, 91 selfloop transitions, 37 changer transitions 0/132 dead transitions. [2022-12-13 18:12:34,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 132 transitions, 867 flow [2022-12-13 18:12:34,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:12:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 18:12:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1145 transitions. [2022-12-13 18:12:34,323 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4408933384674625 [2022-12-13 18:12:34,323 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1145 transitions. [2022-12-13 18:12:34,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1145 transitions. [2022-12-13 18:12:34,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:12:34,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1145 transitions. [2022-12-13 18:12:34,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 163.57142857142858) internal successors, (1145), 7 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:34,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 371.0) internal successors, (2968), 8 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:34,328 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 371.0) internal successors, (2968), 8 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:34,328 INFO L175 Difference]: Start difference. First operand has 69 places, 57 transitions, 307 flow. Second operand 7 states and 1145 transitions. [2022-12-13 18:12:34,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 132 transitions, 867 flow [2022-12-13 18:12:34,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 132 transitions, 864 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:12:34,385 INFO L231 Difference]: Finished difference. Result has 73 places, 75 transitions, 492 flow [2022-12-13 18:12:34,385 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=492, PETRI_PLACES=73, PETRI_TRANSITIONS=75} [2022-12-13 18:12:34,385 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -12 predicate places. [2022-12-13 18:12:34,385 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 75 transitions, 492 flow [2022-12-13 18:12:34,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:34,386 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:12:34,386 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:12:34,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 18:12:34,386 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:12:34,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:12:34,386 INFO L85 PathProgramCache]: Analyzing trace with hash 332259027, now seen corresponding path program 1 times [2022-12-13 18:12:34,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:12:34,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648374807] [2022-12-13 18:12:34,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:12:34,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:12:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:12:34,561 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 18:12:34,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:12:34,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648374807] [2022-12-13 18:12:34,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648374807] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:12:34,562 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:12:34,562 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:12:34,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404494116] [2022-12-13 18:12:34,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:12:34,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 18:12:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:12:34,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 18:12:34,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 18:12:34,651 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 371 [2022-12-13 18:12:34,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 75 transitions, 492 flow. Second operand has 7 states, 7 states have (on average 142.85714285714286) internal successors, (1000), 7 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:34,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:12:34,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 371 [2022-12-13 18:12:34,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:12:39,664 INFO L130 PetriNetUnfolder]: 32625/46332 cut-off events. [2022-12-13 18:12:39,665 INFO L131 PetriNetUnfolder]: For 52200/52287 co-relation queries the response was YES. [2022-12-13 18:12:39,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147721 conditions, 46332 events. 32625/46332 cut-off events. For 52200/52287 co-relation queries the response was YES. Maximal size of possible extension queue 2931. Compared 325498 event pairs, 5383 based on Foata normal form. 570/43715 useless extension candidates. Maximal degree in co-relation 147706. Up to 21058 conditions per place. [2022-12-13 18:12:39,979 INFO L137 encePairwiseOnDemand]: 358/371 looper letters, 88 selfloop transitions, 34 changer transitions 0/126 dead transitions. [2022-12-13 18:12:39,979 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 126 transitions, 1026 flow [2022-12-13 18:12:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:12:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 18:12:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 785 transitions. [2022-12-13 18:12:39,982 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42318059299191374 [2022-12-13 18:12:39,982 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 785 transitions. [2022-12-13 18:12:39,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 785 transitions. [2022-12-13 18:12:39,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:12:39,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 785 transitions. [2022-12-13 18:12:39,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 157.0) internal successors, (785), 5 states have internal predecessors, (785), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:39,985 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 371.0) internal successors, (2226), 6 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:39,985 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 371.0) internal successors, (2226), 6 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:39,985 INFO L175 Difference]: Start difference. First operand has 73 places, 75 transitions, 492 flow. Second operand 5 states and 785 transitions. [2022-12-13 18:12:39,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 126 transitions, 1026 flow [2022-12-13 18:12:40,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 126 transitions, 961 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 18:12:40,062 INFO L231 Difference]: Finished difference. Result has 78 places, 86 transitions, 684 flow [2022-12-13 18:12:40,062 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=684, PETRI_PLACES=78, PETRI_TRANSITIONS=86} [2022-12-13 18:12:40,063 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -7 predicate places. [2022-12-13 18:12:40,063 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 86 transitions, 684 flow [2022-12-13 18:12:40,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 142.85714285714286) internal successors, (1000), 7 states have internal predecessors, (1000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:40,063 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:12:40,063 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:12:40,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 18:12:40,063 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:12:40,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:12:40,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1131903306, now seen corresponding path program 1 times [2022-12-13 18:12:40,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:12:40,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157065611] [2022-12-13 18:12:40,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:12:40,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:12:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:12:40,143 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 18:12:40,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:12:40,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157065611] [2022-12-13 18:12:40,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157065611] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:12:40,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:12:40,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:12:40,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880134200] [2022-12-13 18:12:40,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:12:40,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:12:40,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:12:40,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:12:40,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:12:40,147 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 371 [2022-12-13 18:12:40,147 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 86 transitions, 684 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:40,148 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:12:40,148 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 371 [2022-12-13 18:12:40,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:12:45,277 INFO L130 PetriNetUnfolder]: 32452/46050 cut-off events. [2022-12-13 18:12:45,277 INFO L131 PetriNetUnfolder]: For 81026/81113 co-relation queries the response was YES. [2022-12-13 18:12:45,465 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158716 conditions, 46050 events. 32452/46050 cut-off events. For 81026/81113 co-relation queries the response was YES. Maximal size of possible extension queue 2923. Compared 322966 event pairs, 17319 based on Foata normal form. 145/42993 useless extension candidates. Maximal degree in co-relation 158700. Up to 33175 conditions per place. [2022-12-13 18:12:45,755 INFO L137 encePairwiseOnDemand]: 368/371 looper letters, 157 selfloop transitions, 2 changer transitions 0/163 dead transitions. [2022-12-13 18:12:45,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 163 transitions, 1644 flow [2022-12-13 18:12:45,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:12:45,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:12:45,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2022-12-13 18:12:45,757 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46720575022461813 [2022-12-13 18:12:45,757 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2022-12-13 18:12:45,757 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2022-12-13 18:12:45,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:12:45,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2022-12-13 18:12:45,758 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:45,759 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:45,760 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:45,760 INFO L175 Difference]: Start difference. First operand has 78 places, 86 transitions, 684 flow. Second operand 3 states and 520 transitions. [2022-12-13 18:12:45,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 163 transitions, 1644 flow [2022-12-13 18:12:45,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 163 transitions, 1644 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 18:12:45,947 INFO L231 Difference]: Finished difference. Result has 81 places, 86 transitions, 692 flow [2022-12-13 18:12:45,948 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=684, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=692, PETRI_PLACES=81, PETRI_TRANSITIONS=86} [2022-12-13 18:12:45,948 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -4 predicate places. [2022-12-13 18:12:45,948 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 86 transitions, 692 flow [2022-12-13 18:12:45,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:45,948 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:12:45,948 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:12:45,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 18:12:45,948 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:12:45,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:12:45,949 INFO L85 PathProgramCache]: Analyzing trace with hash -758594670, now seen corresponding path program 1 times [2022-12-13 18:12:45,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:12:45,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203293169] [2022-12-13 18:12:45,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:12:45,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:12:45,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:12:46,363 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 18:12:46,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:12:46,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203293169] [2022-12-13 18:12:46,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203293169] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:12:46,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:12:46,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:12:46,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796821229] [2022-12-13 18:12:46,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:12:46,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:12:46,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:12:46,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:12:46,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:12:46,448 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 371 [2022-12-13 18:12:46,448 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 86 transitions, 692 flow. Second operand has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:46,448 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:12:46,448 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 371 [2022-12-13 18:12:46,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:12:51,940 INFO L130 PetriNetUnfolder]: 33843/48077 cut-off events. [2022-12-13 18:12:51,940 INFO L131 PetriNetUnfolder]: For 87660/87722 co-relation queries the response was YES. [2022-12-13 18:12:52,116 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174661 conditions, 48077 events. 33843/48077 cut-off events. For 87660/87722 co-relation queries the response was YES. Maximal size of possible extension queue 3103. Compared 341608 event pairs, 8039 based on Foata normal form. 197/44937 useless extension candidates. Maximal degree in co-relation 174643. Up to 34145 conditions per place. [2022-12-13 18:12:52,263 INFO L137 encePairwiseOnDemand]: 365/371 looper letters, 124 selfloop transitions, 28 changer transitions 0/156 dead transitions. [2022-12-13 18:12:52,263 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 156 transitions, 1436 flow [2022-12-13 18:12:52,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:12:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:12:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 968 transitions. [2022-12-13 18:12:52,267 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4348607367475292 [2022-12-13 18:12:52,267 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 968 transitions. [2022-12-13 18:12:52,267 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 968 transitions. [2022-12-13 18:12:52,267 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:12:52,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 968 transitions. [2022-12-13 18:12:52,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.33333333333334) internal successors, (968), 6 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:52,273 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 371.0) internal successors, (2597), 7 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:52,274 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 371.0) internal successors, (2597), 7 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:52,274 INFO L175 Difference]: Start difference. First operand has 81 places, 86 transitions, 692 flow. Second operand 6 states and 968 transitions. [2022-12-13 18:12:52,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 156 transitions, 1436 flow [2022-12-13 18:12:52,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 156 transitions, 1406 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-13 18:12:52,549 INFO L231 Difference]: Finished difference. Result has 81 places, 93 transitions, 801 flow [2022-12-13 18:12:52,549 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=660, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=801, PETRI_PLACES=81, PETRI_TRANSITIONS=93} [2022-12-13 18:12:52,550 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -4 predicate places. [2022-12-13 18:12:52,550 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 93 transitions, 801 flow [2022-12-13 18:12:52,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 148.33333333333334) internal successors, (890), 6 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:52,550 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:12:52,550 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:12:52,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 18:12:52,551 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:12:52,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:12:52,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1710096788, now seen corresponding path program 1 times [2022-12-13 18:12:52,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:12:52,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396377714] [2022-12-13 18:12:52,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:12:52,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:12:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:12:52,870 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 18:12:52,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:12:52,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396377714] [2022-12-13 18:12:52,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396377714] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:12:52,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:12:52,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:12:52,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617454245] [2022-12-13 18:12:52,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:12:52,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 18:12:52,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:12:52,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 18:12:52,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:12:53,078 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 371 [2022-12-13 18:12:53,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 93 transitions, 801 flow. Second operand has 9 states, 9 states have (on average 141.55555555555554) internal successors, (1274), 9 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:53,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:12:53,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 371 [2022-12-13 18:12:53,080 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:12:58,294 INFO L130 PetriNetUnfolder]: 30476/43421 cut-off events. [2022-12-13 18:12:58,294 INFO L131 PetriNetUnfolder]: For 90271/90333 co-relation queries the response was YES. [2022-12-13 18:12:58,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 158257 conditions, 43421 events. 30476/43421 cut-off events. For 90271/90333 co-relation queries the response was YES. Maximal size of possible extension queue 2718. Compared 303087 event pairs, 4269 based on Foata normal form. 605/40895 useless extension candidates. Maximal degree in co-relation 158241. Up to 16519 conditions per place. [2022-12-13 18:12:58,590 INFO L137 encePairwiseOnDemand]: 357/371 looper letters, 119 selfloop transitions, 38 changer transitions 0/161 dead transitions. [2022-12-13 18:12:58,590 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 161 transitions, 1557 flow [2022-12-13 18:12:58,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:12:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 18:12:58,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1069 transitions. [2022-12-13 18:12:58,593 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.411628802464382 [2022-12-13 18:12:58,593 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1069 transitions. [2022-12-13 18:12:58,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1069 transitions. [2022-12-13 18:12:58,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:12:58,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1069 transitions. [2022-12-13 18:12:58,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 152.71428571428572) internal successors, (1069), 7 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:58,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 371.0) internal successors, (2968), 8 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:58,598 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 371.0) internal successors, (2968), 8 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:58,598 INFO L175 Difference]: Start difference. First operand has 81 places, 93 transitions, 801 flow. Second operand 7 states and 1069 transitions. [2022-12-13 18:12:58,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 161 transitions, 1557 flow [2022-12-13 18:12:58,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 161 transitions, 1519 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:12:58,818 INFO L231 Difference]: Finished difference. Result has 87 places, 103 transitions, 1050 flow [2022-12-13 18:12:58,818 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1050, PETRI_PLACES=87, PETRI_TRANSITIONS=103} [2022-12-13 18:12:58,818 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, 2 predicate places. [2022-12-13 18:12:58,818 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 103 transitions, 1050 flow [2022-12-13 18:12:58,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 141.55555555555554) internal successors, (1274), 9 states have internal predecessors, (1274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:58,819 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:12:58,819 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:12:58,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 18:12:58,819 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:12:58,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:12:58,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1083334182, now seen corresponding path program 1 times [2022-12-13 18:12:58,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:12:58,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65233529] [2022-12-13 18:12:58,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:12:58,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:12:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:12:58,907 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 18:12:58,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:12:58,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65233529] [2022-12-13 18:12:58,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65233529] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:12:58,907 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:12:58,907 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:12:58,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813129367] [2022-12-13 18:12:58,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:12:58,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:12:58,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:12:58,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:12:58,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:12:58,913 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 371 [2022-12-13 18:12:58,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 103 transitions, 1050 flow. Second operand has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:12:58,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:12:58,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 371 [2022-12-13 18:12:58,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:13:07,416 INFO L130 PetriNetUnfolder]: 52912/77850 cut-off events. [2022-12-13 18:13:07,416 INFO L131 PetriNetUnfolder]: For 275427/275557 co-relation queries the response was YES. [2022-12-13 18:13:07,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288678 conditions, 77850 events. 52912/77850 cut-off events. For 275427/275557 co-relation queries the response was YES. Maximal size of possible extension queue 4503. Compared 623726 event pairs, 8643 based on Foata normal form. 286/72727 useless extension candidates. Maximal degree in co-relation 288661. Up to 34917 conditions per place. [2022-12-13 18:13:07,990 INFO L137 encePairwiseOnDemand]: 367/371 looper letters, 202 selfloop transitions, 3 changer transitions 0/208 dead transitions. [2022-12-13 18:13:07,991 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 208 transitions, 2513 flow [2022-12-13 18:13:07,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:13:07,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:13:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 675 transitions. [2022-12-13 18:13:07,992 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45485175202156336 [2022-12-13 18:13:07,993 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 675 transitions. [2022-12-13 18:13:07,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 675 transitions. [2022-12-13 18:13:07,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:13:07,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 675 transitions. [2022-12-13 18:13:07,994 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.75) internal successors, (675), 4 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:13:07,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:13:07,996 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:13:07,996 INFO L175 Difference]: Start difference. First operand has 87 places, 103 transitions, 1050 flow. Second operand 4 states and 675 transitions. [2022-12-13 18:13:07,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 208 transitions, 2513 flow [2022-12-13 18:13:08,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 208 transitions, 2452 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 18:13:08,883 INFO L231 Difference]: Finished difference. Result has 88 places, 104 transitions, 1035 flow [2022-12-13 18:13:08,883 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=1016, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1035, PETRI_PLACES=88, PETRI_TRANSITIONS=104} [2022-12-13 18:13:08,883 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, 3 predicate places. [2022-12-13 18:13:08,883 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 104 transitions, 1035 flow [2022-12-13 18:13:08,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:13:08,884 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:13:08,884 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:13:08,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 18:13:08,884 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:13:08,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:13:08,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1473394316, now seen corresponding path program 1 times [2022-12-13 18:13:08,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:13:08,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074398011] [2022-12-13 18:13:08,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:13:08,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:13:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:13:09,289 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 18:13:09,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:13:09,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074398011] [2022-12-13 18:13:09,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074398011] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:13:09,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:13:09,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:13:09,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765334909] [2022-12-13 18:13:09,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:13:09,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 18:13:09,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:13:09,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 18:13:09,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:13:09,736 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 371 [2022-12-13 18:13:09,737 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 104 transitions, 1035 flow. Second operand has 10 states, 10 states have (on average 137.5) internal successors, (1375), 10 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:13:09,738 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:13:09,738 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 371 [2022-12-13 18:13:09,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:13:22,343 INFO L130 PetriNetUnfolder]: 74250/105036 cut-off events. [2022-12-13 18:13:22,343 INFO L131 PetriNetUnfolder]: For 314292/314454 co-relation queries the response was YES. [2022-12-13 18:13:22,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415394 conditions, 105036 events. 74250/105036 cut-off events. For 314292/314454 co-relation queries the response was YES. Maximal size of possible extension queue 6349. Compared 815968 event pairs, 19829 based on Foata normal form. 162/100056 useless extension candidates. Maximal degree in co-relation 415374. Up to 66594 conditions per place. [2022-12-13 18:13:23,164 INFO L137 encePairwiseOnDemand]: 361/371 looper letters, 238 selfloop transitions, 37 changer transitions 6/285 dead transitions. [2022-12-13 18:13:23,164 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 285 transitions, 3030 flow [2022-12-13 18:13:23,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:13:23,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 18:13:23,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1620 transitions. [2022-12-13 18:13:23,168 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3969615290370007 [2022-12-13 18:13:23,168 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1620 transitions. [2022-12-13 18:13:23,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1620 transitions. [2022-12-13 18:13:23,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:13:23,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1620 transitions. [2022-12-13 18:13:23,171 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 147.27272727272728) internal successors, (1620), 11 states have internal predecessors, (1620), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:13:23,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 371.0) internal successors, (4452), 12 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:13:23,175 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 371.0) internal successors, (4452), 12 states have internal predecessors, (4452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:13:23,175 INFO L175 Difference]: Start difference. First operand has 88 places, 104 transitions, 1035 flow. Second operand 11 states and 1620 transitions. [2022-12-13 18:13:23,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 285 transitions, 3030 flow [2022-12-13 18:13:27,454 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 285 transitions, 3020 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:13:27,456 INFO L231 Difference]: Finished difference. Result has 103 places, 138 transitions, 1536 flow [2022-12-13 18:13:27,456 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=1031, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1536, PETRI_PLACES=103, PETRI_TRANSITIONS=138} [2022-12-13 18:13:27,456 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, 18 predicate places. [2022-12-13 18:13:27,456 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 138 transitions, 1536 flow [2022-12-13 18:13:27,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 137.5) internal successors, (1375), 10 states have internal predecessors, (1375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:13:27,457 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:13:27,457 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:13:27,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 18:13:27,457 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:13:27,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:13:27,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1473394264, now seen corresponding path program 1 times [2022-12-13 18:13:27,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:13:27,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261285602] [2022-12-13 18:13:27,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:13:27,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:13:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:13:27,701 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 18:13:27,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:13:27,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261285602] [2022-12-13 18:13:27,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261285602] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:13:27,701 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:13:27,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:13:27,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988874133] [2022-12-13 18:13:27,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:13:27,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 18:13:27,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:13:27,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 18:13:27,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:13:27,929 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 371 [2022-12-13 18:13:27,930 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 138 transitions, 1536 flow. Second operand has 10 states, 10 states have (on average 138.5) internal successors, (1385), 10 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:13:27,930 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:13:27,931 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 371 [2022-12-13 18:13:27,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:13:39,810 INFO L130 PetriNetUnfolder]: 62225/88936 cut-off events. [2022-12-13 18:13:39,811 INFO L131 PetriNetUnfolder]: For 349284/349457 co-relation queries the response was YES. [2022-12-13 18:13:40,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 367203 conditions, 88936 events. 62225/88936 cut-off events. For 349284/349457 co-relation queries the response was YES. Maximal size of possible extension queue 5171. Compared 688230 event pairs, 14125 based on Foata normal form. 1787/88126 useless extension candidates. Maximal degree in co-relation 367176. Up to 31879 conditions per place. [2022-12-13 18:13:40,634 INFO L137 encePairwiseOnDemand]: 355/371 looper letters, 163 selfloop transitions, 62 changer transitions 2/231 dead transitions. [2022-12-13 18:13:40,634 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 231 transitions, 2634 flow [2022-12-13 18:13:40,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:13:40,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 18:13:40,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1335 transitions. [2022-12-13 18:13:40,637 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3998203054806828 [2022-12-13 18:13:40,637 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1335 transitions. [2022-12-13 18:13:40,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1335 transitions. [2022-12-13 18:13:40,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:13:40,638 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1335 transitions. [2022-12-13 18:13:40,639 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 148.33333333333334) internal successors, (1335), 9 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 18:13:40,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 371.0) internal successors, (3710), 10 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:13:40,642 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 371.0) internal successors, (3710), 10 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:13:40,642 INFO L175 Difference]: Start difference. First operand has 103 places, 138 transitions, 1536 flow. Second operand 9 states and 1335 transitions. [2022-12-13 18:13:40,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 231 transitions, 2634 flow [2022-12-13 18:13:48,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 231 transitions, 2630 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:13:48,804 INFO L231 Difference]: Finished difference. Result has 111 places, 148 transitions, 1896 flow [2022-12-13 18:13:48,805 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=1532, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=52, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1896, PETRI_PLACES=111, PETRI_TRANSITIONS=148} [2022-12-13 18:13:48,805 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, 26 predicate places. [2022-12-13 18:13:48,805 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 148 transitions, 1896 flow [2022-12-13 18:13:48,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 138.5) internal successors, (1385), 10 states have internal predecessors, (1385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:13:48,806 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:13:48,806 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:13:48,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 18:13:48,806 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:13:48,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:13:48,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1569414266, now seen corresponding path program 1 times [2022-12-13 18:13:48,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:13:48,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28933931] [2022-12-13 18:13:48,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:13:48,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:13:48,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:13:48,857 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 18:13:48,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:13:48,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28933931] [2022-12-13 18:13:48,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28933931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:13:48,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:13:48,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:13:48,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598170249] [2022-12-13 18:13:48,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:13:48,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:13:48,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:13:48,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:13:48,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:13:48,893 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 371 [2022-12-13 18:13:48,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 148 transitions, 1896 flow. Second operand has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:13:48,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:13:48,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 371 [2022-12-13 18:13:48,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:00,758 INFO L130 PetriNetUnfolder]: 59061/83841 cut-off events. [2022-12-13 18:14:00,758 INFO L131 PetriNetUnfolder]: For 443193/443369 co-relation queries the response was YES. [2022-12-13 18:14:01,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370536 conditions, 83841 events. 59061/83841 cut-off events. For 443193/443369 co-relation queries the response was YES. Maximal size of possible extension queue 4809. Compared 635359 event pairs, 30339 based on Foata normal form. 995/82575 useless extension candidates. Maximal degree in co-relation 370507. Up to 57696 conditions per place. [2022-12-13 18:14:01,466 INFO L137 encePairwiseOnDemand]: 357/371 looper letters, 56 selfloop transitions, 58 changer transitions 53/171 dead transitions. [2022-12-13 18:14:01,466 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 171 transitions, 2502 flow [2022-12-13 18:14:01,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:14:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:14:01,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 637 transitions. [2022-12-13 18:14:01,468 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42924528301886794 [2022-12-13 18:14:01,468 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 637 transitions. [2022-12-13 18:14:01,468 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 637 transitions. [2022-12-13 18:14:01,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:01,468 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 637 transitions. [2022-12-13 18:14:01,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.25) internal successors, (637), 4 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 18:14:01,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:01,471 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:01,471 INFO L175 Difference]: Start difference. First operand has 111 places, 148 transitions, 1896 flow. Second operand 4 states and 637 transitions. [2022-12-13 18:14:01,471 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 171 transitions, 2502 flow [2022-12-13 18:14:13,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 171 transitions, 2432 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-13 18:14:13,554 INFO L231 Difference]: Finished difference. Result has 110 places, 111 transitions, 1478 flow [2022-12-13 18:14:13,554 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=1828, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=58, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1478, PETRI_PLACES=110, PETRI_TRANSITIONS=111} [2022-12-13 18:14:13,554 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, 25 predicate places. [2022-12-13 18:14:13,554 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 111 transitions, 1478 flow [2022-12-13 18:14:13,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 150.0) internal successors, (600), 4 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:13,555 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:13,555 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:14:13,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 18:14:13,555 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:14:13,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:13,555 INFO L85 PathProgramCache]: Analyzing trace with hash 2036978580, now seen corresponding path program 1 times [2022-12-13 18:14:13,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:13,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223334876] [2022-12-13 18:14:13,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:13,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:13,969 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 18:14:13,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:13,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223334876] [2022-12-13 18:14:13,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223334876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:13,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:13,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:14:13,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899932251] [2022-12-13 18:14:13,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:13,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 18:14:13,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:13,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 18:14:13,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:14:14,265 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 371 [2022-12-13 18:14:14,265 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 111 transitions, 1478 flow. Second operand has 9 states, 9 states have (on average 136.88888888888889) internal successors, (1232), 9 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:14,266 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:14,266 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 371 [2022-12-13 18:14:14,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:19,332 INFO L130 PetriNetUnfolder]: 24389/35083 cut-off events. [2022-12-13 18:14:19,332 INFO L131 PetriNetUnfolder]: For 203088/203200 co-relation queries the response was YES. [2022-12-13 18:14:19,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140919 conditions, 35083 events. 24389/35083 cut-off events. For 203088/203200 co-relation queries the response was YES. Maximal size of possible extension queue 2105. Compared 246446 event pairs, 6097 based on Foata normal form. 1992/37035 useless extension candidates. Maximal degree in co-relation 140888. Up to 14800 conditions per place. [2022-12-13 18:14:19,529 INFO L137 encePairwiseOnDemand]: 363/371 looper letters, 36 selfloop transitions, 5 changer transitions 106/151 dead transitions. [2022-12-13 18:14:19,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 151 transitions, 1712 flow [2022-12-13 18:14:19,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:14:19,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 18:14:19,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1286 transitions. [2022-12-13 18:14:19,532 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38514525306978137 [2022-12-13 18:14:19,532 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1286 transitions. [2022-12-13 18:14:19,532 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1286 transitions. [2022-12-13 18:14:19,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:19,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1286 transitions. [2022-12-13 18:14:19,534 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 142.88888888888889) internal successors, (1286), 9 states have internal predecessors, (1286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:19,536 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 371.0) internal successors, (3710), 10 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:19,537 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 371.0) internal successors, (3710), 10 states have internal predecessors, (3710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:19,537 INFO L175 Difference]: Start difference. First operand has 110 places, 111 transitions, 1478 flow. Second operand 9 states and 1286 transitions. [2022-12-13 18:14:19,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 151 transitions, 1712 flow [2022-12-13 18:14:22,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 151 transitions, 1531 flow, removed 22 selfloop flow, removed 13 redundant places. [2022-12-13 18:14:22,814 INFO L231 Difference]: Finished difference. Result has 93 places, 38 transitions, 244 flow [2022-12-13 18:14:22,814 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=244, PETRI_PLACES=93, PETRI_TRANSITIONS=38} [2022-12-13 18:14:22,814 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, 8 predicate places. [2022-12-13 18:14:22,814 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 38 transitions, 244 flow [2022-12-13 18:14:22,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 136.88888888888889) internal successors, (1232), 9 states have internal predecessors, (1232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:22,815 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:22,815 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:14:22,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 18:14:22,815 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:14:22,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:22,815 INFO L85 PathProgramCache]: Analyzing trace with hash 534146573, now seen corresponding path program 1 times [2022-12-13 18:14:22,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:22,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661569392] [2022-12-13 18:14:22,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:22,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:22,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:14:22,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:22,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661569392] [2022-12-13 18:14:22,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661569392] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:22,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:22,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:14:22,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690137091] [2022-12-13 18:14:22,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:22,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:14:22,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:22,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:14:22,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:14:22,922 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 371 [2022-12-13 18:14:22,923 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 38 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 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 18:14:22,923 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:22,923 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 371 [2022-12-13 18:14:22,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:23,613 INFO L130 PetriNetUnfolder]: 3684/5393 cut-off events. [2022-12-13 18:14:23,613 INFO L131 PetriNetUnfolder]: For 15269/15269 co-relation queries the response was YES. [2022-12-13 18:14:23,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17069 conditions, 5393 events. 3684/5393 cut-off events. For 15269/15269 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 28000 event pairs, 1452 based on Foata normal form. 312/5690 useless extension candidates. Maximal degree in co-relation 17047. Up to 2220 conditions per place. [2022-12-13 18:14:23,629 INFO L137 encePairwiseOnDemand]: 367/371 looper letters, 34 selfloop transitions, 3 changer transitions 28/68 dead transitions. [2022-12-13 18:14:23,629 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 68 transitions, 538 flow [2022-12-13 18:14:23,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:14:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:14:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 645 transitions. [2022-12-13 18:14:23,631 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43463611859838275 [2022-12-13 18:14:23,631 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 645 transitions. [2022-12-13 18:14:23,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 645 transitions. [2022-12-13 18:14:23,631 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:23,631 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 645 transitions. [2022-12-13 18:14:23,632 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.25) internal successors, (645), 4 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:23,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:23,633 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:23,633 INFO L175 Difference]: Start difference. First operand has 93 places, 38 transitions, 244 flow. Second operand 4 states and 645 transitions. [2022-12-13 18:14:23,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 68 transitions, 538 flow [2022-12-13 18:14:23,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 68 transitions, 470 flow, removed 12 selfloop flow, removed 18 redundant places. [2022-12-13 18:14:23,644 INFO L231 Difference]: Finished difference. Result has 68 places, 31 transitions, 155 flow [2022-12-13 18:14:23,644 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=68, PETRI_TRANSITIONS=31} [2022-12-13 18:14:23,644 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -17 predicate places. [2022-12-13 18:14:23,644 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 31 transitions, 155 flow [2022-12-13 18:14:23,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 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 18:14:23,644 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:23,644 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 18:14:23,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 18:14:23,645 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:14:23,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:23,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1759192253, now seen corresponding path program 1 times [2022-12-13 18:14:23,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:23,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348181000] [2022-12-13 18:14:23,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:23,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:24,350 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 18:14:24,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:24,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348181000] [2022-12-13 18:14:24,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [348181000] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:24,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:24,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:14:24,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281254467] [2022-12-13 18:14:24,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:24,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:14:24,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:24,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:14:24,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:14:24,492 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 371 [2022-12-13 18:14:24,493 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 31 transitions, 155 flow. Second operand has 8 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:24,493 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:24,493 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 371 [2022-12-13 18:14:24,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:24,834 INFO L130 PetriNetUnfolder]: 608/928 cut-off events. [2022-12-13 18:14:24,834 INFO L131 PetriNetUnfolder]: For 1401/1401 co-relation queries the response was YES. [2022-12-13 18:14:24,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2890 conditions, 928 events. 608/928 cut-off events. For 1401/1401 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3357 event pairs, 106 based on Foata normal form. 24/950 useless extension candidates. Maximal degree in co-relation 2876. Up to 521 conditions per place. [2022-12-13 18:14:24,838 INFO L137 encePairwiseOnDemand]: 363/371 looper letters, 38 selfloop transitions, 12 changer transitions 0/53 dead transitions. [2022-12-13 18:14:24,838 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 53 transitions, 340 flow [2022-12-13 18:14:24,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 18:14:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 18:14:24,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1146 transitions. [2022-12-13 18:14:24,840 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3861185983827493 [2022-12-13 18:14:24,840 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1146 transitions. [2022-12-13 18:14:24,840 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1146 transitions. [2022-12-13 18:14:24,841 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:24,841 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1146 transitions. [2022-12-13 18:14:24,842 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 143.25) internal successors, (1146), 8 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:24,843 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 371.0) internal successors, (3339), 9 states have internal predecessors, (3339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:24,844 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 371.0) internal successors, (3339), 9 states have internal predecessors, (3339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:24,844 INFO L175 Difference]: Start difference. First operand has 68 places, 31 transitions, 155 flow. Second operand 8 states and 1146 transitions. [2022-12-13 18:14:24,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 53 transitions, 340 flow [2022-12-13 18:14:24,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 53 transitions, 296 flow, removed 4 selfloop flow, removed 13 redundant places. [2022-12-13 18:14:24,847 INFO L231 Difference]: Finished difference. Result has 64 places, 36 transitions, 202 flow [2022-12-13 18:14:24,847 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=202, PETRI_PLACES=64, PETRI_TRANSITIONS=36} [2022-12-13 18:14:24,847 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -21 predicate places. [2022-12-13 18:14:24,847 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 36 transitions, 202 flow [2022-12-13 18:14:24,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 139.0) internal successors, (1112), 8 states have internal predecessors, (1112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:24,847 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:24,847 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 18:14:24,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 18:14:24,848 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:14:24,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:24,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1516842508, now seen corresponding path program 1 times [2022-12-13 18:14:24,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:24,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931924562] [2022-12-13 18:14:24,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:24,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:24,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:25,493 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 18:14:25,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:25,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931924562] [2022-12-13 18:14:25,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931924562] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:25,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:25,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:14:25,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757296071] [2022-12-13 18:14:25,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:25,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 18:14:25,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:25,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 18:14:25,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:14:25,631 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 371 [2022-12-13 18:14:25,632 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 36 transitions, 202 flow. Second operand has 9 states, 9 states have (on average 139.88888888888889) internal successors, (1259), 9 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:25,632 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:25,632 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 371 [2022-12-13 18:14:25,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:25,878 INFO L130 PetriNetUnfolder]: 596/903 cut-off events. [2022-12-13 18:14:25,878 INFO L131 PetriNetUnfolder]: For 1517/1517 co-relation queries the response was YES. [2022-12-13 18:14:25,880 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3080 conditions, 903 events. 596/903 cut-off events. For 1517/1517 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 3296 event pairs, 322 based on Foata normal form. 4/887 useless extension candidates. Maximal degree in co-relation 3066. Up to 808 conditions per place. [2022-12-13 18:14:25,881 INFO L137 encePairwiseOnDemand]: 363/371 looper letters, 37 selfloop transitions, 11 changer transitions 0/51 dead transitions. [2022-12-13 18:14:25,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 51 transitions, 361 flow [2022-12-13 18:14:25,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:14:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:14:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 870 transitions. [2022-12-13 18:14:25,883 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3908355795148248 [2022-12-13 18:14:25,883 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 870 transitions. [2022-12-13 18:14:25,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 870 transitions. [2022-12-13 18:14:25,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:25,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 870 transitions. [2022-12-13 18:14:25,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 145.0) internal successors, (870), 6 states have internal predecessors, (870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:25,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 371.0) internal successors, (2597), 7 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:25,886 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 371.0) internal successors, (2597), 7 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:25,886 INFO L175 Difference]: Start difference. First operand has 64 places, 36 transitions, 202 flow. Second operand 6 states and 870 transitions. [2022-12-13 18:14:25,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 51 transitions, 361 flow [2022-12-13 18:14:25,887 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 51 transitions, 328 flow, removed 8 selfloop flow, removed 3 redundant places. [2022-12-13 18:14:25,888 INFO L231 Difference]: Finished difference. Result has 67 places, 40 transitions, 240 flow [2022-12-13 18:14:25,888 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=240, PETRI_PLACES=67, PETRI_TRANSITIONS=40} [2022-12-13 18:14:25,888 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -18 predicate places. [2022-12-13 18:14:25,888 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 40 transitions, 240 flow [2022-12-13 18:14:25,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 139.88888888888889) internal successors, (1259), 9 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:25,888 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:25,889 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:14:25,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 18:14:25,889 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:14:25,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:25,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1691237926, now seen corresponding path program 1 times [2022-12-13 18:14:25,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:25,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998716070] [2022-12-13 18:14:25,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:25,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:26,019 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 18:14:26,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:26,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998716070] [2022-12-13 18:14:26,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998716070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:26,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:26,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:14:26,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974961535] [2022-12-13 18:14:26,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:26,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:14:26,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:26,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:14:26,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:14:26,026 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 371 [2022-12-13 18:14:26,026 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 40 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:26,026 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:26,026 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 371 [2022-12-13 18:14:26,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:26,146 INFO L130 PetriNetUnfolder]: 475/736 cut-off events. [2022-12-13 18:14:26,146 INFO L131 PetriNetUnfolder]: For 1685/1685 co-relation queries the response was YES. [2022-12-13 18:14:26,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2609 conditions, 736 events. 475/736 cut-off events. For 1685/1685 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2817 event pairs, 141 based on Foata normal form. 14/746 useless extension candidates. Maximal degree in co-relation 2594. Up to 707 conditions per place. [2022-12-13 18:14:26,149 INFO L137 encePairwiseOnDemand]: 365/371 looper letters, 44 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2022-12-13 18:14:26,149 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 53 transitions, 417 flow [2022-12-13 18:14:26,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:14:26,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:14:26,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 480 transitions. [2022-12-13 18:14:26,151 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.431266846361186 [2022-12-13 18:14:26,151 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 480 transitions. [2022-12-13 18:14:26,151 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 480 transitions. [2022-12-13 18:14:26,151 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:26,151 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 480 transitions. [2022-12-13 18:14:26,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:26,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:26,152 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 371.0) internal successors, (1484), 4 states have internal predecessors, (1484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:26,152 INFO L175 Difference]: Start difference. First operand has 67 places, 40 transitions, 240 flow. Second operand 3 states and 480 transitions. [2022-12-13 18:14:26,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 53 transitions, 417 flow [2022-12-13 18:14:26,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 53 transitions, 385 flow, removed 4 selfloop flow, removed 6 redundant places. [2022-12-13 18:14:26,154 INFO L231 Difference]: Finished difference. Result has 63 places, 42 transitions, 233 flow [2022-12-13 18:14:26,154 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=233, PETRI_PLACES=63, PETRI_TRANSITIONS=42} [2022-12-13 18:14:26,155 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -22 predicate places. [2022-12-13 18:14:26,155 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 42 transitions, 233 flow [2022-12-13 18:14:26,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.66666666666666) internal successors, (464), 3 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:26,155 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:26,155 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 18:14:26,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 18:14:26,155 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:14:26,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:26,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1609273760, now seen corresponding path program 1 times [2022-12-13 18:14:26,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:26,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411753706] [2022-12-13 18:14:26,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:26,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:26,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:27,125 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 18:14:27,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:27,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411753706] [2022-12-13 18:14:27,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411753706] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:27,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:27,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 18:14:27,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024743613] [2022-12-13 18:14:27,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:27,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 18:14:27,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:27,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 18:14:27,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-12-13 18:14:27,228 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 371 [2022-12-13 18:14:27,229 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 42 transitions, 233 flow. Second operand has 9 states, 9 states have (on average 138.11111111111111) internal successors, (1243), 9 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:27,230 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:27,230 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 371 [2022-12-13 18:14:27,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:27,509 INFO L130 PetriNetUnfolder]: 484/757 cut-off events. [2022-12-13 18:14:27,509 INFO L131 PetriNetUnfolder]: For 1402/1412 co-relation queries the response was YES. [2022-12-13 18:14:27,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3018 conditions, 757 events. 484/757 cut-off events. For 1402/1412 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 2794 event pairs, 84 based on Foata normal form. 7/756 useless extension candidates. Maximal degree in co-relation 3003. Up to 427 conditions per place. [2022-12-13 18:14:27,512 INFO L137 encePairwiseOnDemand]: 363/371 looper letters, 50 selfloop transitions, 14 changer transitions 0/67 dead transitions. [2022-12-13 18:14:27,512 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 481 flow [2022-12-13 18:14:27,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:14:27,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 18:14:27,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 998 transitions. [2022-12-13 18:14:27,513 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3842895648825568 [2022-12-13 18:14:27,513 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 998 transitions. [2022-12-13 18:14:27,514 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 998 transitions. [2022-12-13 18:14:27,514 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:27,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 998 transitions. [2022-12-13 18:14:27,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 142.57142857142858) internal successors, (998), 7 states have internal predecessors, (998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:27,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 371.0) internal successors, (2968), 8 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:27,516 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 371.0) internal successors, (2968), 8 states have internal predecessors, (2968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:27,516 INFO L175 Difference]: Start difference. First operand has 63 places, 42 transitions, 233 flow. Second operand 7 states and 998 transitions. [2022-12-13 18:14:27,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 481 flow [2022-12-13 18:14:27,518 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 459 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 18:14:27,519 INFO L231 Difference]: Finished difference. Result has 68 places, 43 transitions, 272 flow [2022-12-13 18:14:27,519 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=223, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=272, PETRI_PLACES=68, PETRI_TRANSITIONS=43} [2022-12-13 18:14:27,519 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -17 predicate places. [2022-12-13 18:14:27,519 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 43 transitions, 272 flow [2022-12-13 18:14:27,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 138.11111111111111) internal successors, (1243), 9 states have internal predecessors, (1243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:27,519 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:27,520 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 18:14:27,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 18:14:27,520 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:14:27,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:27,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1655886212, now seen corresponding path program 1 times [2022-12-13 18:14:27,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:27,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309756159] [2022-12-13 18:14:27,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:27,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:27,667 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 18:14:27,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:27,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309756159] [2022-12-13 18:14:27,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309756159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:27,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:27,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:14:27,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507689527] [2022-12-13 18:14:27,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:27,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:14:27,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:27,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:14:27,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:14:27,674 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 371 [2022-12-13 18:14:27,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 43 transitions, 272 flow. Second operand has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:27,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:27,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 371 [2022-12-13 18:14:27,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:27,791 INFO L130 PetriNetUnfolder]: 264/451 cut-off events. [2022-12-13 18:14:27,791 INFO L131 PetriNetUnfolder]: For 1218/1221 co-relation queries the response was YES. [2022-12-13 18:14:27,792 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1913 conditions, 451 events. 264/451 cut-off events. For 1218/1221 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1635 event pairs, 36 based on Foata normal form. 31/478 useless extension candidates. Maximal degree in co-relation 1897. Up to 361 conditions per place. [2022-12-13 18:14:27,793 INFO L137 encePairwiseOnDemand]: 365/371 looper letters, 55 selfloop transitions, 9 changer transitions 0/68 dead transitions. [2022-12-13 18:14:27,793 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 68 transitions, 602 flow [2022-12-13 18:14:27,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:14:27,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:14:27,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 638 transitions. [2022-12-13 18:14:27,795 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4299191374663073 [2022-12-13 18:14:27,795 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 638 transitions. [2022-12-13 18:14:27,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 638 transitions. [2022-12-13 18:14:27,795 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:27,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 638 transitions. [2022-12-13 18:14:27,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:27,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:27,797 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 371.0) internal successors, (1855), 5 states have internal predecessors, (1855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:27,797 INFO L175 Difference]: Start difference. First operand has 68 places, 43 transitions, 272 flow. Second operand 4 states and 638 transitions. [2022-12-13 18:14:27,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 68 transitions, 602 flow [2022-12-13 18:14:27,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 550 flow, removed 1 selfloop flow, removed 6 redundant places. [2022-12-13 18:14:27,798 INFO L231 Difference]: Finished difference. Result has 66 places, 47 transitions, 296 flow [2022-12-13 18:14:27,799 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=296, PETRI_PLACES=66, PETRI_TRANSITIONS=47} [2022-12-13 18:14:27,799 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -19 predicate places. [2022-12-13 18:14:27,799 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 47 transitions, 296 flow [2022-12-13 18:14:27,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.5) internal successors, (614), 4 states have internal predecessors, (614), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:27,799 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:27,799 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:14:27,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 18:14:27,799 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:14:27,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:27,800 INFO L85 PathProgramCache]: Analyzing trace with hash -63335828, now seen corresponding path program 1 times [2022-12-13 18:14:27,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:27,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579377834] [2022-12-13 18:14:27,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:27,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:27,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:28,847 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 18:14:28,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:28,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579377834] [2022-12-13 18:14:28,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579377834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:28,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:28,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:14:28,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690435596] [2022-12-13 18:14:28,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:28,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 18:14:28,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:28,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 18:14:28,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:14:29,070 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 371 [2022-12-13 18:14:29,071 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 47 transitions, 296 flow. Second operand has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:29,071 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:29,071 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 371 [2022-12-13 18:14:29,071 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:29,327 INFO L130 PetriNetUnfolder]: 257/440 cut-off events. [2022-12-13 18:14:29,327 INFO L131 PetriNetUnfolder]: For 1073/1079 co-relation queries the response was YES. [2022-12-13 18:14:29,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 440 events. 257/440 cut-off events. For 1073/1079 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1574 event pairs, 56 based on Foata normal form. 7/446 useless extension candidates. Maximal degree in co-relation 2017. Up to 366 conditions per place. [2022-12-13 18:14:29,328 INFO L137 encePairwiseOnDemand]: 363/371 looper letters, 54 selfloop transitions, 10 changer transitions 0/67 dead transitions. [2022-12-13 18:14:29,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 67 transitions, 544 flow [2022-12-13 18:14:29,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:14:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:14:29,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 862 transitions. [2022-12-13 18:14:29,330 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38724168912848156 [2022-12-13 18:14:29,330 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 862 transitions. [2022-12-13 18:14:29,330 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 862 transitions. [2022-12-13 18:14:29,331 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:29,331 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 862 transitions. [2022-12-13 18:14:29,331 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 143.66666666666666) internal successors, (862), 6 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:29,333 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 371.0) internal successors, (2597), 7 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:29,333 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 371.0) internal successors, (2597), 7 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:29,333 INFO L175 Difference]: Start difference. First operand has 66 places, 47 transitions, 296 flow. Second operand 6 states and 862 transitions. [2022-12-13 18:14:29,333 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 67 transitions, 544 flow [2022-12-13 18:14:29,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 506 flow, removed 9 selfloop flow, removed 2 redundant places. [2022-12-13 18:14:29,335 INFO L231 Difference]: Finished difference. Result has 70 places, 48 transitions, 313 flow [2022-12-13 18:14:29,335 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=313, PETRI_PLACES=70, PETRI_TRANSITIONS=48} [2022-12-13 18:14:29,335 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -15 predicate places. [2022-12-13 18:14:29,335 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 48 transitions, 313 flow [2022-12-13 18:14:29,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 139.0) internal successors, (1390), 10 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:29,336 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:29,336 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:14:29,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 18:14:29,336 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:14:29,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:29,336 INFO L85 PathProgramCache]: Analyzing trace with hash -925061343, now seen corresponding path program 1 times [2022-12-13 18:14:29,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:29,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340754315] [2022-12-13 18:14:29,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:29,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:29,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:29,475 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 18:14:29,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:29,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340754315] [2022-12-13 18:14:29,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340754315] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:29,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:29,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:14:29,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810570519] [2022-12-13 18:14:29,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:29,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:14:29,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:29,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:14:29,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:14:29,483 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 371 [2022-12-13 18:14:29,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 48 transitions, 313 flow. Second operand has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:29,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:29,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 371 [2022-12-13 18:14:29,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:29,595 INFO L130 PetriNetUnfolder]: 133/249 cut-off events. [2022-12-13 18:14:29,595 INFO L131 PetriNetUnfolder]: For 763/769 co-relation queries the response was YES. [2022-12-13 18:14:29,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1109 conditions, 249 events. 133/249 cut-off events. For 763/769 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 801 event pairs, 6 based on Foata normal form. 29/274 useless extension candidates. Maximal degree in co-relation 1092. Up to 104 conditions per place. [2022-12-13 18:14:29,596 INFO L137 encePairwiseOnDemand]: 365/371 looper letters, 56 selfloop transitions, 13 changer transitions 0/73 dead transitions. [2022-12-13 18:14:29,596 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 73 transitions, 657 flow [2022-12-13 18:14:29,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:14:29,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 18:14:29,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 795 transitions. [2022-12-13 18:14:29,598 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42857142857142855 [2022-12-13 18:14:29,598 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 795 transitions. [2022-12-13 18:14:29,598 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 795 transitions. [2022-12-13 18:14:29,598 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:29,598 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 795 transitions. [2022-12-13 18:14:29,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 159.0) internal successors, (795), 5 states have internal predecessors, (795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:29,600 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 371.0) internal successors, (2226), 6 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:29,600 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 371.0) internal successors, (2226), 6 states have internal predecessors, (2226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:29,600 INFO L175 Difference]: Start difference. First operand has 70 places, 48 transitions, 313 flow. Second operand 5 states and 795 transitions. [2022-12-13 18:14:29,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 73 transitions, 657 flow [2022-12-13 18:14:29,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 73 transitions, 614 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-13 18:14:29,602 INFO L231 Difference]: Finished difference. Result has 70 places, 47 transitions, 317 flow [2022-12-13 18:14:29,602 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=317, PETRI_PLACES=70, PETRI_TRANSITIONS=47} [2022-12-13 18:14:29,603 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -15 predicate places. [2022-12-13 18:14:29,603 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 47 transitions, 317 flow [2022-12-13 18:14:29,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 152.8) internal successors, (764), 5 states have internal predecessors, (764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:29,603 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:29,603 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] [2022-12-13 18:14:29,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 18:14:29,603 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:14:29,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:29,603 INFO L85 PathProgramCache]: Analyzing trace with hash 498307368, now seen corresponding path program 1 times [2022-12-13 18:14:29,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:29,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571103145] [2022-12-13 18:14:29,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:29,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:29,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:14:29,747 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 18:14:29,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:14:29,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571103145] [2022-12-13 18:14:29,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571103145] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:14:29,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:14:29,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:14:29,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315521418] [2022-12-13 18:14:29,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:14:29,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:14:29,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:14:29,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:14:29,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:14:29,756 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 371 [2022-12-13 18:14:29,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 47 transitions, 317 flow. Second operand has 6 states, 6 states have (on average 152.33333333333334) internal successors, (914), 6 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:29,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:14:29,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 371 [2022-12-13 18:14:29,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:14:29,862 INFO L130 PetriNetUnfolder]: 110/202 cut-off events. [2022-12-13 18:14:29,862 INFO L131 PetriNetUnfolder]: For 648/654 co-relation queries the response was YES. [2022-12-13 18:14:29,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 202 events. 110/202 cut-off events. For 648/654 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 594 event pairs, 3 based on Foata normal form. 13/211 useless extension candidates. Maximal degree in co-relation 960. Up to 83 conditions per place. [2022-12-13 18:14:29,864 INFO L137 encePairwiseOnDemand]: 365/371 looper letters, 48 selfloop transitions, 17 changer transitions 0/69 dead transitions. [2022-12-13 18:14:29,864 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 69 transitions, 618 flow [2022-12-13 18:14:29,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:14:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:14:29,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 944 transitions. [2022-12-13 18:14:29,865 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42407906558849956 [2022-12-13 18:14:29,866 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 944 transitions. [2022-12-13 18:14:29,866 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 944 transitions. [2022-12-13 18:14:29,866 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:14:29,866 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 944 transitions. [2022-12-13 18:14:29,867 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 157.33333333333334) internal successors, (944), 6 states have internal predecessors, (944), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:29,868 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 371.0) internal successors, (2597), 7 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:29,868 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 371.0) internal successors, (2597), 7 states have internal predecessors, (2597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:29,868 INFO L175 Difference]: Start difference. First operand has 70 places, 47 transitions, 317 flow. Second operand 6 states and 944 transitions. [2022-12-13 18:14:29,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 69 transitions, 618 flow [2022-12-13 18:14:29,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 69 transitions, 476 flow, removed 16 selfloop flow, removed 10 redundant places. [2022-12-13 18:14:29,870 INFO L231 Difference]: Finished difference. Result has 66 places, 43 transitions, 252 flow [2022-12-13 18:14:29,870 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=371, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=66, PETRI_TRANSITIONS=43} [2022-12-13 18:14:29,870 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -19 predicate places. [2022-12-13 18:14:29,870 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 43 transitions, 252 flow [2022-12-13 18:14:29,870 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 152.33333333333334) internal successors, (914), 6 states have internal predecessors, (914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:14:29,870 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:14:29,870 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:14:29,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 18:14:29,871 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:14:29,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:14:29,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1184383916, now seen corresponding path program 1 times [2022-12-13 18:14:29,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:14:29,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606508909] [2022-12-13 18:14:29,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:14:29,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:14:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:14:29,921 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:14:29,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:14:29,992 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:14:29,992 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 18:14:29,993 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (69 of 70 remaining) [2022-12-13 18:14:29,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (68 of 70 remaining) [2022-12-13 18:14:29,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 70 remaining) [2022-12-13 18:14:29,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 70 remaining) [2022-12-13 18:14:29,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 70 remaining) [2022-12-13 18:14:29,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 70 remaining) [2022-12-13 18:14:29,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 70 remaining) [2022-12-13 18:14:29,994 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 70 remaining) [2022-12-13 18:14:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 70 remaining) [2022-12-13 18:14:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 70 remaining) [2022-12-13 18:14:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 70 remaining) [2022-12-13 18:14:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 70 remaining) [2022-12-13 18:14:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 70 remaining) [2022-12-13 18:14:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 70 remaining) [2022-12-13 18:14:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 70 remaining) [2022-12-13 18:14:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 70 remaining) [2022-12-13 18:14:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 70 remaining) [2022-12-13 18:14:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 70 remaining) [2022-12-13 18:14:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 70 remaining) [2022-12-13 18:14:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 70 remaining) [2022-12-13 18:14:29,995 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 70 remaining) [2022-12-13 18:14:29,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 70 remaining) [2022-12-13 18:14:29,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 70 remaining) [2022-12-13 18:14:29,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 70 remaining) [2022-12-13 18:14:29,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 70 remaining) [2022-12-13 18:14:29,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 70 remaining) [2022-12-13 18:14:29,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 70 remaining) [2022-12-13 18:14:29,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 70 remaining) [2022-12-13 18:14:29,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 70 remaining) [2022-12-13 18:14:29,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 70 remaining) [2022-12-13 18:14:29,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 70 remaining) [2022-12-13 18:14:29,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 70 remaining) [2022-12-13 18:14:29,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 70 remaining) [2022-12-13 18:14:29,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 70 remaining) [2022-12-13 18:14:29,996 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 70 remaining) [2022-12-13 18:14:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 70 remaining) [2022-12-13 18:14:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 70 remaining) [2022-12-13 18:14:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 70 remaining) [2022-12-13 18:14:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 70 remaining) [2022-12-13 18:14:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 70 remaining) [2022-12-13 18:14:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (29 of 70 remaining) [2022-12-13 18:14:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 70 remaining) [2022-12-13 18:14:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 70 remaining) [2022-12-13 18:14:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 70 remaining) [2022-12-13 18:14:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 70 remaining) [2022-12-13 18:14:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 70 remaining) [2022-12-13 18:14:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 70 remaining) [2022-12-13 18:14:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 70 remaining) [2022-12-13 18:14:29,997 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 70 remaining) [2022-12-13 18:14:29,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 70 remaining) [2022-12-13 18:14:29,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 70 remaining) [2022-12-13 18:14:29,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 70 remaining) [2022-12-13 18:14:29,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 70 remaining) [2022-12-13 18:14:29,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 70 remaining) [2022-12-13 18:14:29,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 70 remaining) [2022-12-13 18:14:29,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 70 remaining) [2022-12-13 18:14:29,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 70 remaining) [2022-12-13 18:14:29,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 70 remaining) [2022-12-13 18:14:29,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 70 remaining) [2022-12-13 18:14:29,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 70 remaining) [2022-12-13 18:14:29,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 70 remaining) [2022-12-13 18:14:29,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 70 remaining) [2022-12-13 18:14:29,998 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 70 remaining) [2022-12-13 18:14:29,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 70 remaining) [2022-12-13 18:14:29,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 70 remaining) [2022-12-13 18:14:29,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 70 remaining) [2022-12-13 18:14:29,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 70 remaining) [2022-12-13 18:14:29,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 70 remaining) [2022-12-13 18:14:29,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 70 remaining) [2022-12-13 18:14:29,999 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 70 remaining) [2022-12-13 18:14:29,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 18:14:29,999 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:14:30,004 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 18:14:30,004 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:14:30,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:14:30 BasicIcfg [2022-12-13 18:14:30,060 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:14:30,060 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:14:30,060 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:14:30,061 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:14:30,061 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:11:31" (3/4) ... [2022-12-13 18:14:30,063 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 18:14:30,063 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:14:30,063 INFO L158 Benchmark]: Toolchain (without parser) took 180212.11ms. Allocated memory was 151.0MB in the beginning and 7.1GB in the end (delta: 7.0GB). Free memory was 115.2MB in the beginning and 785.3MB in the end (delta: -670.1MB). Peak memory consumption was 6.3GB. Max. memory is 16.1GB. [2022-12-13 18:14:30,063 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:14:30,063 INFO L158 Benchmark]: CACSL2BoogieTranslator took 459.61ms. Allocated memory is still 151.0MB. Free memory was 115.2MB in the beginning and 86.9MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-12-13 18:14:30,064 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.17ms. Allocated memory is still 151.0MB. Free memory was 86.9MB in the beginning and 84.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:14:30,064 INFO L158 Benchmark]: Boogie Preprocessor took 29.59ms. Allocated memory is still 151.0MB. Free memory was 84.3MB in the beginning and 81.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:14:30,064 INFO L158 Benchmark]: RCFGBuilder took 1072.69ms. Allocated memory was 151.0MB in the beginning and 228.6MB in the end (delta: 77.6MB). Free memory was 81.8MB in the beginning and 122.8MB in the end (delta: -41.1MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. [2022-12-13 18:14:30,064 INFO L158 Benchmark]: TraceAbstraction took 178595.47ms. Allocated memory was 228.6MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 122.8MB in the beginning and 785.3MB in the end (delta: -662.5MB). Peak memory consumption was 6.3GB. Max. memory is 16.1GB. [2022-12-13 18:14:30,064 INFO L158 Benchmark]: Witness Printer took 2.41ms. Allocated memory is still 7.1GB. Free memory is still 785.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:14:30,065 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 151.0MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 459.61ms. Allocated memory is still 151.0MB. Free memory was 115.2MB in the beginning and 86.9MB in the end (delta: 28.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.17ms. Allocated memory is still 151.0MB. Free memory was 86.9MB in the beginning and 84.3MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.59ms. Allocated memory is still 151.0MB. Free memory was 84.3MB in the beginning and 81.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1072.69ms. Allocated memory was 151.0MB in the beginning and 228.6MB in the end (delta: 77.6MB). Free memory was 81.8MB in the beginning and 122.8MB in the end (delta: -41.1MB). Peak memory consumption was 65.6MB. Max. memory is 16.1GB. * TraceAbstraction took 178595.47ms. Allocated memory was 228.6MB in the beginning and 7.1GB in the end (delta: 6.9GB). Free memory was 122.8MB in the beginning and 785.3MB in the end (delta: -662.5MB). Peak memory consumption was 6.3GB. Max. memory is 16.1GB. * Witness Printer took 2.41ms. Allocated memory is still 7.1GB. Free memory is still 785.3MB. 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: 15.1s, 205 PlacesBefore, 85 PlacesAfterwards, 194 TransitionsBefore, 73 TransitionsAfterwards, 6900 CoEnabledTransitionPairs, 8 FixpointIterations, 80 TrivialSequentialCompositions, 87 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 173 TotalNumberOfCompositions, 31719 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12343, independent: 11771, independent conditional: 0, independent unconditional: 11771, dependent: 572, dependent conditional: 0, dependent unconditional: 572, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3302, independent: 3213, independent conditional: 0, independent unconditional: 3213, dependent: 89, dependent conditional: 0, dependent unconditional: 89, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12343, independent: 8558, independent conditional: 0, independent unconditional: 8558, dependent: 483, dependent conditional: 0, dependent unconditional: 483, unknown: 3302, unknown conditional: 0, unknown unconditional: 3302] , Statistics on independence cache: Total cache size (in pairs): 623, Positive cache size: 575, Positive conditional cache size: 0, Positive unconditional cache size: 575, Negative cache size: 48, Negative conditional cache size: 0, Negative unconditional cache size: 48, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L719] 0 _Bool __unbuffered_p3_EAX$flush_delayed; [L720] 0 int __unbuffered_p3_EAX$mem_tmp; [L721] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd0; [L722] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd1; [L723] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd2; [L724] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd3; [L725] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd4; [L726] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd0; [L727] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd1; [L728] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd2; [L729] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd3; [L730] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd4; [L731] 0 _Bool __unbuffered_p3_EAX$read_delayed; [L732] 0 int *__unbuffered_p3_EAX$read_delayed_var; [L733] 0 int __unbuffered_p3_EAX$w_buff0; [L734] 0 _Bool __unbuffered_p3_EAX$w_buff0_used; [L735] 0 int __unbuffered_p3_EAX$w_buff1; [L736] 0 _Bool __unbuffered_p3_EAX$w_buff1_used; [L738] 0 int a = 0; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice1; [L767] 0 _Bool weak$$choice2; [L875] 0 pthread_t t2709; [L876] FCALL, FORK 0 pthread_create(&t2709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2709, ((void *)0), P0, ((void *)0))=10, t2709={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t2710; [L878] FCALL, FORK 0 pthread_create(&t2710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2710, ((void *)0), P1, ((void *)0))=11, t2709={7:0}, t2710={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L879] 0 pthread_t t2711; [L880] FCALL, FORK 0 pthread_create(&t2711, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2711, ((void *)0), P2, ((void *)0))=12, t2709={7:0}, t2710={5:0}, t2711={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L881] 0 pthread_t t2712; [L882] FCALL, FORK 0 pthread_create(&t2712, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2712, ((void *)0), P3, ((void *)0))=13, t2709={7:0}, t2710={5:0}, t2711={6:0}, t2712={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 z$flush_delayed = weak$$choice2 [L834] EXPR 4 \read(z) [L834] 4 z$mem_tmp = z [L835] 4 weak$$choice1 = __VERIFIER_nondet_bool() [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] EXPR 4 \read(z) [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] 4 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L837] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)))) [L838] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)))) [L839] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : weak$$choice0)))) [L840] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L841] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L842] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$r_buff1_thd4 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L843] 4 __unbuffered_p3_EAX$read_delayed = (_Bool)1 [L844] 4 __unbuffered_p3_EAX$read_delayed_var = &z [L845] EXPR 4 \read(z) [L845] 4 __unbuffered_p3_EAX = z [L846] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L846] EXPR 4 \read(z) [L846] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L846] 4 z = z$flush_delayed ? z$mem_tmp : z [L847] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 1 __unbuffered_p0_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 \read(z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L854] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L855] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L856] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L857] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L862] 4 return 0; [L789] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1 = z$w_buff0 [L805] 3 z$w_buff0 = 1 [L806] 3 z$w_buff1_used = z$w_buff0_used [L807] 3 z$w_buff0_used = (_Bool)1 [L808] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L808] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 3 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L820] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L821] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L884] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L886] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L886] RET 0 assume_abort_if_not(main$tmp_guard0) [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 \read(z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L889] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L890] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L891] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L892] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2709={7:0}, t2710={5:0}, t2711={6:0}, t2712={8:0}, weak$$choice0=9, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L895] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 \read(*__unbuffered_p3_EAX$read_delayed_var) [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] 0 __unbuffered_p3_EAX = __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L897] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L899] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice1=1, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: -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: -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: -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: -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: -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: -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: 873]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 882]: 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: 876]: 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: 880]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 256 locations, 70 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: 178.4s, OverallIterations: 29, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 155.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3643 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2991 mSDsluCounter, 1075 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1012 mSDsCounter, 487 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7845 IncrementalHoareTripleChecker+Invalid, 8332 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 487 mSolverCounterUnsat, 63 mSDtfsCounter, 7845 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1896occurred in iteration=17, InterpolantAutomatonStates: 144, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 7.0s InterpolantComputationTime, 459 NumberOfCodeBlocks, 459 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 405 ConstructedInterpolants, 0 QuantifiedInterpolants, 4900 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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 18:14:30,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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_d89d090d-70db-4e01-8ec9-7288391cb552/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 e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 --- 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 18:14:32,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:14:32,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:14:32,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:14:32,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:14:32,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:14:32,152 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:14:32,153 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:14:32,154 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:14:32,155 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:14:32,156 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:14:32,156 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:14:32,157 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:14:32,157 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:14:32,158 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:14:32,159 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:14:32,159 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:14:32,160 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:14:32,161 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:14:32,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:14:32,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:14:32,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:14:32,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:14:32,165 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:14:32,167 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:14:32,168 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:14:32,168 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:14:32,169 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:14:32,169 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:14:32,169 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:14:32,170 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:14:32,170 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:14:32,171 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:14:32,172 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:14:32,177 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:14:32,178 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:14:32,178 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:14:32,179 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:14:32,179 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:14:32,180 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:14:32,180 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:14:32,181 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 18:14:32,201 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:14:32,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:14:32,202 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:14:32,202 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:14:32,203 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:14:32,203 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:14:32,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:14:32,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:14:32,204 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:14:32,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:14:32,204 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:14:32,204 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 18:14:32,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:14:32,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:14:32,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:14:32,205 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 18:14:32,205 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 18:14:32,205 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 18:14:32,205 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:14:32,205 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 18:14:32,205 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 18:14:32,205 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 18:14:32,205 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:14:32,205 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:14:32,206 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:14:32,206 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:14:32,206 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:14:32,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:14:32,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:14:32,206 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:14:32,206 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 18:14:32,206 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 18:14:32,207 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:14:32,207 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:14:32,207 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:14:32,207 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 18:14:32,207 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:14:32,207 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_d89d090d-70db-4e01-8ec9-7288391cb552/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_d89d090d-70db-4e01-8ec9-7288391cb552/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 -> e1655ef15816414a510c3a8c6c5388872fb389e863c7015deef825935bc10ec6 [2022-12-13 18:14:32,404 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:14:32,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:14:32,422 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:14:32,423 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:14:32,423 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:14:32,424 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/thin002_power.opt.i [2022-12-13 18:14:34,971 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:14:35,141 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:14:35,141 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/sv-benchmarks/c/pthread-wmm/thin002_power.opt.i [2022-12-13 18:14:35,153 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/data/466e1c064/8c680d4b2d614f588abd266ed62767a6/FLAGae03051bd [2022-12-13 18:14:35,167 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/data/466e1c064/8c680d4b2d614f588abd266ed62767a6 [2022-12-13 18:14:35,170 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:14:35,171 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:14:35,172 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:14:35,173 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:14:35,176 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:14:35,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:14:35" (1/1) ... [2022-12-13 18:14:35,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea05411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:35, skipping insertion in model container [2022-12-13 18:14:35,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:14:35" (1/1) ... [2022-12-13 18:14:35,190 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:14:35,226 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:14:35,348 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_d89d090d-70db-4e01-8ec9-7288391cb552/sv-benchmarks/c/pthread-wmm/thin002_power.opt.i[951,964] [2022-12-13 18:14:35,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,465 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,475 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,478 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,486 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,488 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,489 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:14:35,503 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:14:35,513 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_d89d090d-70db-4e01-8ec9-7288391cb552/sv-benchmarks/c/pthread-wmm/thin002_power.opt.i[951,964] [2022-12-13 18:14:35,530 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,531 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,532 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,533 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,534 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,537 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,538 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,546 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,547 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:14:35,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:14:35,559 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:14:35,584 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:14:35,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:35 WrapperNode [2022-12-13 18:14:35,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:14:35,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:14:35,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:14:35,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:14:35,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:35" (1/1) ... [2022-12-13 18:14:35,604 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:35" (1/1) ... [2022-12-13 18:14:35,620 INFO L138 Inliner]: procedures = 181, calls = 84, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 200 [2022-12-13 18:14:35,621 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:14:35,621 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:14:35,621 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:14:35,621 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:14:35,628 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:35" (1/1) ... [2022-12-13 18:14:35,628 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:35" (1/1) ... [2022-12-13 18:14:35,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:35" (1/1) ... [2022-12-13 18:14:35,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:35" (1/1) ... [2022-12-13 18:14:35,637 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:35" (1/1) ... [2022-12-13 18:14:35,639 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:35" (1/1) ... [2022-12-13 18:14:35,641 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:35" (1/1) ... [2022-12-13 18:14:35,642 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:35" (1/1) ... [2022-12-13 18:14:35,645 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:14:35,645 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:14:35,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:14:35,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:14:35,646 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:35" (1/1) ... [2022-12-13 18:14:35,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:14:35,660 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:14:35,671 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:14:35,673 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:14:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 18:14:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 18:14:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:14:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 18:14:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:14:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 18:14:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 18:14:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-13 18:14:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 18:14:35,700 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 18:14:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 18:14:35,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 18:14:35,701 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 18:14:35,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 18:14:35,701 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 18:14:35,701 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 18:14:35,701 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 18:14:35,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:14:35,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:14:35,702 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 18:14:35,838 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:14:35,839 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:14:36,350 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:14:36,974 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:14:36,975 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 18:14:36,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:14:36 BoogieIcfgContainer [2022-12-13 18:14:36,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:14:36,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:14:36,980 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:14:36,982 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:14:36,982 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:14:35" (1/3) ... [2022-12-13 18:14:36,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f47a0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:14:36, skipping insertion in model container [2022-12-13 18:14:36,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:14:35" (2/3) ... [2022-12-13 18:14:36,983 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f47a0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:14:36, skipping insertion in model container [2022-12-13 18:14:36,983 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:14:36" (3/3) ... [2022-12-13 18:14:36,984 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_power.opt.i [2022-12-13 18:14:37,002 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:14:37,002 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2022-12-13 18:14:37,002 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 18:14:37,112 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 18:14:37,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 210 places, 199 transitions, 418 flow [2022-12-13 18:14:37,200 INFO L130 PetriNetUnfolder]: 2/195 cut-off events. [2022-12-13 18:14:37,200 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:14:37,205 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 195 events. 2/195 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 243 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-12-13 18:14:37,205 INFO L82 GeneralOperation]: Start removeDead. Operand has 210 places, 199 transitions, 418 flow [2022-12-13 18:14:37,209 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 206 places, 195 transitions, 402 flow [2022-12-13 18:14:37,212 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 18:14:37,219 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 195 transitions, 402 flow [2022-12-13 18:14:37,221 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 206 places, 195 transitions, 402 flow [2022-12-13 18:14:37,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 206 places, 195 transitions, 402 flow [2022-12-13 18:14:37,254 INFO L130 PetriNetUnfolder]: 2/195 cut-off events. [2022-12-13 18:14:37,254 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:14:37,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208 conditions, 195 events. 2/195 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 247 event pairs, 0 based on Foata normal form. 0/152 useless extension candidates. Maximal degree in co-relation 128. Up to 2 conditions per place. [2022-12-13 18:14:37,257 INFO L119 LiptonReduction]: Number of co-enabled transitions 6900 [2022-12-13 18:14:54,847 WARN L233 SmtUtils]: Spent 7.92s on a formula simplification. DAG size of input: 254 DAG size of output: 252 (called from [L 278] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-12-13 18:15:07,978 INFO L134 LiptonReduction]: Checked pairs total: 31877 [2022-12-13 18:15:07,978 INFO L136 LiptonReduction]: Total number of compositions: 178 [2022-12-13 18:15:07,988 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:15:07,992 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;@efb9711, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:15:07,992 INFO L358 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-12-13 18:15:07,993 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 18:15:07,993 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:15:07,994 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:15:07,994 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 18:15:07,994 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:15:07,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:15:07,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1233, now seen corresponding path program 1 times [2022-12-13 18:15:08,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:15:08,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049103580] [2022-12-13 18:15:08,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:15:08,007 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 18:15:08,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:15:08,008 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:08,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:15:08,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 18:15:08,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:15:08,098 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 18:15:08,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:15:08,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:15:08,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049103580] [2022-12-13 18:15:08,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049103580] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:15:08,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:15:08,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 18:15:08,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043100417] [2022-12-13 18:15:08,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:15:08,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 18:15:08,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:15:08,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 18:15:08,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 18:15:08,133 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 377 [2022-12-13 18:15:08,136 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 85 places, 73 transitions, 158 flow. Second operand has 2 states, 2 states have (on average 155.5) internal successors, (311), 2 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:08,136 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:15:08,136 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 377 [2022-12-13 18:15:08,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:15:15,067 INFO L130 PetriNetUnfolder]: 47471/63155 cut-off events. [2022-12-13 18:15:15,067 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2022-12-13 18:15:15,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126343 conditions, 63155 events. 47471/63155 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 3772. Compared 409036 event pairs, 47471 based on Foata normal form. 900/38599 useless extension candidates. Maximal degree in co-relation 126331. Up to 62977 conditions per place. [2022-12-13 18:15:15,395 INFO L137 encePairwiseOnDemand]: 354/377 looper letters, 46 selfloop transitions, 0 changer transitions 0/50 dead transitions. [2022-12-13 18:15:15,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 50 transitions, 204 flow [2022-12-13 18:15:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 18:15:15,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 18:15:15,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 379 transitions. [2022-12-13 18:15:15,407 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5026525198938993 [2022-12-13 18:15:15,407 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 379 transitions. [2022-12-13 18:15:15,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 379 transitions. [2022-12-13 18:15:15,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:15:15,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 379 transitions. [2022-12-13 18:15:15,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 189.5) internal successors, (379), 2 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:15,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:15,417 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 377.0) internal successors, (1131), 3 states have internal predecessors, (1131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:15,419 INFO L175 Difference]: Start difference. First operand has 85 places, 73 transitions, 158 flow. Second operand 2 states and 379 transitions. [2022-12-13 18:15:15,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 50 transitions, 204 flow [2022-12-13 18:15:15,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 50 transitions, 200 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 18:15:15,424 INFO L231 Difference]: Finished difference. Result has 60 places, 50 transitions, 108 flow [2022-12-13 18:15:15,426 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=108, PETRI_PLACES=60, PETRI_TRANSITIONS=50} [2022-12-13 18:15:15,428 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -25 predicate places. [2022-12-13 18:15:15,428 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 50 transitions, 108 flow [2022-12-13 18:15:15,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 155.5) internal successors, (311), 2 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:15,429 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:15:15,429 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:15:15,441 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:15,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:15,630 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:15:15,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:15:15,631 INFO L85 PathProgramCache]: Analyzing trace with hash 880910296, now seen corresponding path program 1 times [2022-12-13 18:15:15,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:15:15,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1078341071] [2022-12-13 18:15:15,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:15:15,632 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 18:15:15,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:15:15,632 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:15,633 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:15,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:15:15,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 18:15:15,728 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:15:15,751 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 18:15:15,751 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:15:15,751 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:15:15,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1078341071] [2022-12-13 18:15:15,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1078341071] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:15:15,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:15:15,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:15:15,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863584865] [2022-12-13 18:15:15,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:15:15,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:15:15,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:15:15,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:15:15,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:15:15,757 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 377 [2022-12-13 18:15:15,757 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 50 transitions, 108 flow. Second operand has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:15,757 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:15:15,757 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 377 [2022-12-13 18:15:15,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:15:21,887 INFO L130 PetriNetUnfolder]: 42572/56582 cut-off events. [2022-12-13 18:15:21,887 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:15:21,981 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113302 conditions, 56582 events. 42572/56582 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3376. Compared 381940 event pairs, 8279 based on Foata normal form. 0/34735 useless extension candidates. Maximal degree in co-relation 113299. Up to 45130 conditions per place. [2022-12-13 18:15:22,141 INFO L137 encePairwiseOnDemand]: 374/377 looper letters, 74 selfloop transitions, 2 changer transitions 0/80 dead transitions. [2022-12-13 18:15:22,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 322 flow [2022-12-13 18:15:22,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:15:22,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:15:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 539 transitions. [2022-12-13 18:15:22,144 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4765694076038904 [2022-12-13 18:15:22,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 539 transitions. [2022-12-13 18:15:22,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 539 transitions. [2022-12-13 18:15:22,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:15:22,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 539 transitions. [2022-12-13 18:15:22,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:22,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:22,149 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:22,149 INFO L175 Difference]: Start difference. First operand has 60 places, 50 transitions, 108 flow. Second operand 3 states and 539 transitions. [2022-12-13 18:15:22,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 322 flow [2022-12-13 18:15:22,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 80 transitions, 322 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 18:15:22,150 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 110 flow [2022-12-13 18:15:22,150 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2022-12-13 18:15:22,151 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -24 predicate places. [2022-12-13 18:15:22,151 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 110 flow [2022-12-13 18:15:22,152 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:22,152 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:15:22,152 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:15:22,162 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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)] Ended with exit code 0 [2022-12-13 18:15:22,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:22,352 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:15:22,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:15:22,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1538416413, now seen corresponding path program 1 times [2022-12-13 18:15:22,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:15:22,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344780809] [2022-12-13 18:15:22,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:15:22,353 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 18:15:22,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:15:22,354 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:22,355 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:15:22,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:15:22,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:15:22,456 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 18:15:22,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:15:22,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:15:22,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344780809] [2022-12-13 18:15:22,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344780809] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:15:22,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:15:22,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:15:22,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358390485] [2022-12-13 18:15:22,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:15:22,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:15:22,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:15:22,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:15:22,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:15:22,463 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 377 [2022-12-13 18:15:22,463 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:22,463 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:15:22,463 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 377 [2022-12-13 18:15:22,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:15:30,297 INFO L130 PetriNetUnfolder]: 54359/72185 cut-off events. [2022-12-13 18:15:30,298 INFO L131 PetriNetUnfolder]: For 1521/1521 co-relation queries the response was YES. [2022-12-13 18:15:30,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145950 conditions, 72185 events. 54359/72185 cut-off events. For 1521/1521 co-relation queries the response was YES. Maximal size of possible extension queue 4377. Compared 484016 event pairs, 35405 based on Foata normal form. 0/43768 useless extension candidates. Maximal degree in co-relation 145946. Up to 53908 conditions per place. [2022-12-13 18:15:30,650 INFO L137 encePairwiseOnDemand]: 370/377 looper letters, 74 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2022-12-13 18:15:30,650 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 83 transitions, 338 flow [2022-12-13 18:15:30,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:15:30,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:15:30,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2022-12-13 18:15:30,652 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47745358090185674 [2022-12-13 18:15:30,652 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 540 transitions. [2022-12-13 18:15:30,653 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 540 transitions. [2022-12-13 18:15:30,653 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:15:30,653 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 540 transitions. [2022-12-13 18:15:30,654 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 180.0) internal successors, (540), 3 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:30,656 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:30,656 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:30,656 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 3 states and 540 transitions. [2022-12-13 18:15:30,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 83 transitions, 338 flow [2022-12-13 18:15:30,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 83 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:15:30,673 INFO L231 Difference]: Finished difference. Result has 62 places, 53 transitions, 141 flow [2022-12-13 18:15:30,673 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=141, PETRI_PLACES=62, PETRI_TRANSITIONS=53} [2022-12-13 18:15:30,674 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -23 predicate places. [2022-12-13 18:15:30,674 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 53 transitions, 141 flow [2022-12-13 18:15:30,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:30,674 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:15:30,674 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:15:30,684 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:30,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:30,876 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:15:30,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:15:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1538416415, now seen corresponding path program 1 times [2022-12-13 18:15:30,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:15:30,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [526262262] [2022-12-13 18:15:30,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:15:30,879 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 18:15:30,879 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:15:30,882 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:30,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:31,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:15:31,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 9 conjunts are in the unsatisfiable core [2022-12-13 18:15:31,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:15:31,117 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 18:15:31,118 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 18:15:31,166 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 18:15:31,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 18:15:31,196 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-12-13 18:15:31,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-12-13 18:15:31,223 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 18:15:31,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:15:31,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:15:31,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [526262262] [2022-12-13 18:15:31,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [526262262] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:15:31,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:15:31,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:15:31,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970253363] [2022-12-13 18:15:31,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:15:31,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:15:31,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:15:31,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:15:31,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:15:31,280 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 377 [2022-12-13 18:15:31,280 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 53 transitions, 141 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:31,280 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:15:31,280 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 377 [2022-12-13 18:15:31,280 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:15:36,263 INFO L130 PetriNetUnfolder]: 32933/44081 cut-off events. [2022-12-13 18:15:36,263 INFO L131 PetriNetUnfolder]: For 7497/7686 co-relation queries the response was YES. [2022-12-13 18:15:36,346 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97761 conditions, 44081 events. 32933/44081 cut-off events. For 7497/7686 co-relation queries the response was YES. Maximal size of possible extension queue 2325. Compared 274826 event pairs, 17840 based on Foata normal form. 0/34663 useless extension candidates. Maximal degree in co-relation 97756. Up to 22023 conditions per place. [2022-12-13 18:15:36,480 INFO L137 encePairwiseOnDemand]: 368/377 looper letters, 64 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2022-12-13 18:15:36,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 70 transitions, 327 flow [2022-12-13 18:15:36,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:15:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:15:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2022-12-13 18:15:36,482 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4588859416445623 [2022-12-13 18:15:36,483 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 519 transitions. [2022-12-13 18:15:36,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 519 transitions. [2022-12-13 18:15:36,483 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:15:36,483 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 519 transitions. [2022-12-13 18:15:36,484 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.0) internal successors, (519), 3 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:36,486 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:36,486 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:36,486 INFO L175 Difference]: Start difference. First operand has 62 places, 53 transitions, 141 flow. Second operand 3 states and 519 transitions. [2022-12-13 18:15:36,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 70 transitions, 327 flow [2022-12-13 18:15:36,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 70 transitions, 318 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:15:36,495 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 148 flow [2022-12-13 18:15:36,495 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2022-12-13 18:15:36,495 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -23 predicate places. [2022-12-13 18:15:36,496 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 148 flow [2022-12-13 18:15:36,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:36,496 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:15:36,496 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:15:36,505 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:36,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:36,698 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:15:36,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:15:36,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1538416416, now seen corresponding path program 1 times [2022-12-13 18:15:36,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:15:36,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429404012] [2022-12-13 18:15:36,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:15:36,701 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 18:15:36,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:15:36,704 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:36,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:15:36,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 18:15:36,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:15:36,896 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 18:15:36,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 18:15:36,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:15:36,939 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:15:36,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:15:36,967 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-13 18:15:36,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:15:36,991 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 18:15:36,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:15:36,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:15:36,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429404012] [2022-12-13 18:15:36,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429404012] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:15:36,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:15:36,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:15:36,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75339983] [2022-12-13 18:15:36,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:15:36,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:15:36,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:15:36,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:15:36,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:15:37,093 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 377 [2022-12-13 18:15:37,094 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 152.25) internal successors, (609), 4 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 18:15:37,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:15:37,095 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 377 [2022-12-13 18:15:37,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:15:39,708 INFO L130 PetriNetUnfolder]: 16661/23174 cut-off events. [2022-12-13 18:15:39,708 INFO L131 PetriNetUnfolder]: For 6408/6615 co-relation queries the response was YES. [2022-12-13 18:15:39,743 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53510 conditions, 23174 events. 16661/23174 cut-off events. For 6408/6615 co-relation queries the response was YES. Maximal size of possible extension queue 1309. Compared 142581 event pairs, 8741 based on Foata normal form. 4491/25483 useless extension candidates. Maximal degree in co-relation 53504. Up to 11835 conditions per place. [2022-12-13 18:15:39,801 INFO L137 encePairwiseOnDemand]: 356/377 looper letters, 45 selfloop transitions, 12 changer transitions 1/62 dead transitions. [2022-12-13 18:15:39,801 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 62 transitions, 298 flow [2022-12-13 18:15:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:15:39,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:15:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 668 transitions. [2022-12-13 18:15:39,803 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44297082228116713 [2022-12-13 18:15:39,803 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 668 transitions. [2022-12-13 18:15:39,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 668 transitions. [2022-12-13 18:15:39,804 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:15:39,804 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 668 transitions. [2022-12-13 18:15:39,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:39,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:39,807 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:39,807 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 148 flow. Second operand 4 states and 668 transitions. [2022-12-13 18:15:39,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 62 transitions, 298 flow [2022-12-13 18:15:39,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 294 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:15:39,816 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 235 flow [2022-12-13 18:15:39,817 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=235, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2022-12-13 18:15:39,817 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -27 predicate places. [2022-12-13 18:15:39,817 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 235 flow [2022-12-13 18:15:39,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 152.25) internal successors, (609), 4 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 18:15:39,818 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:15:39,818 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:15:39,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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)] Forceful destruction successful, exit code 0 [2022-12-13 18:15:40,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:40,019 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:15:40,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:15:40,020 INFO L85 PathProgramCache]: Analyzing trace with hash 894501951, now seen corresponding path program 1 times [2022-12-13 18:15:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:15:40,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63380287] [2022-12-13 18:15:40,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:15:40,022 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 18:15:40,023 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:15:40,025 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:40,028 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:40,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:15:40,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 18:15:40,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:15:40,191 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 18:15:40,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:15:40,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:15:40,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63380287] [2022-12-13 18:15:40,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63380287] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:15:40,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:15:40,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:15:40,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076968013] [2022-12-13 18:15:40,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:15:40,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:15:40,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:15:40,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:15:40,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:15:40,201 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 377 [2022-12-13 18:15:40,202 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 235 flow. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:40,202 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:15:40,202 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 377 [2022-12-13 18:15:40,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:15:41,789 INFO L130 PetriNetUnfolder]: 9215/13444 cut-off events. [2022-12-13 18:15:41,789 INFO L131 PetriNetUnfolder]: For 7897/7955 co-relation queries the response was YES. [2022-12-13 18:15:41,815 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38834 conditions, 13444 events. 9215/13444 cut-off events. For 7897/7955 co-relation queries the response was YES. Maximal size of possible extension queue 821. Compared 83009 event pairs, 3005 based on Foata normal form. 56/12229 useless extension candidates. Maximal degree in co-relation 38826. Up to 12976 conditions per place. [2022-12-13 18:15:41,853 INFO L137 encePairwiseOnDemand]: 371/377 looper letters, 64 selfloop transitions, 5 changer transitions 0/73 dead transitions. [2022-12-13 18:15:41,853 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 73 transitions, 445 flow [2022-12-13 18:15:41,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:15:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:15:41,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 503 transitions. [2022-12-13 18:15:41,855 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4447391688770999 [2022-12-13 18:15:41,855 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 503 transitions. [2022-12-13 18:15:41,855 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 503 transitions. [2022-12-13 18:15:41,856 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:15:41,856 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 503 transitions. [2022-12-13 18:15:41,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:41,858 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:41,858 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 377.0) internal successors, (1508), 4 states have internal predecessors, (1508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:41,858 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 235 flow. Second operand 3 states and 503 transitions. [2022-12-13 18:15:41,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 73 transitions, 445 flow [2022-12-13 18:15:41,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 432 flow, removed 5 selfloop flow, removed 2 redundant places. [2022-12-13 18:15:41,872 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 255 flow [2022-12-13 18:15:41,872 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2022-12-13 18:15:41,872 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -27 predicate places. [2022-12-13 18:15:41,872 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 255 flow [2022-12-13 18:15:41,873 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:41,873 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:15:41,873 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:15:41,884 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:42,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:42,075 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:15:42,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:15:42,076 INFO L85 PathProgramCache]: Analyzing trace with hash -453918063, now seen corresponding path program 1 times [2022-12-13 18:15:42,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:15:42,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009818955] [2022-12-13 18:15:42,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:15:42,078 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 18:15:42,078 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:15:42,081 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:42,084 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:15:42,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:15:42,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:15:42,236 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 18:15:42,237 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:15:42,237 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:15:42,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009818955] [2022-12-13 18:15:42,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009818955] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:15:42,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:15:42,237 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:15:42,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569723700] [2022-12-13 18:15:42,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:15:42,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:15:42,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:15:42,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:15:42,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:15:42,252 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 377 [2022-12-13 18:15:42,253 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 255 flow. Second operand has 4 states, 4 states have (on average 153.25) internal successors, (613), 4 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:42,253 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:15:42,253 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 377 [2022-12-13 18:15:42,253 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:15:42,948 INFO L130 PetriNetUnfolder]: 2679/4340 cut-off events. [2022-12-13 18:15:42,948 INFO L131 PetriNetUnfolder]: For 2925/2933 co-relation queries the response was YES. [2022-12-13 18:15:42,954 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13309 conditions, 4340 events. 2679/4340 cut-off events. For 2925/2933 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 25221 event pairs, 724 based on Foata normal form. 88/3989 useless extension candidates. Maximal degree in co-relation 13301. Up to 3608 conditions per place. [2022-12-13 18:15:42,963 INFO L137 encePairwiseOnDemand]: 371/377 looper letters, 78 selfloop transitions, 9 changer transitions 0/91 dead transitions. [2022-12-13 18:15:42,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 91 transitions, 567 flow [2022-12-13 18:15:42,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:15:42,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:15:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 668 transitions. [2022-12-13 18:15:42,965 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44297082228116713 [2022-12-13 18:15:42,965 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 668 transitions. [2022-12-13 18:15:42,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 668 transitions. [2022-12-13 18:15:42,965 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:15:42,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 668 transitions. [2022-12-13 18:15:42,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:42,968 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:42,968 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:42,968 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 255 flow. Second operand 4 states and 668 transitions. [2022-12-13 18:15:42,968 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 91 transitions, 567 flow [2022-12-13 18:15:42,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 562 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:15:42,972 INFO L231 Difference]: Finished difference. Result has 61 places, 61 transitions, 302 flow [2022-12-13 18:15:42,972 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=302, PETRI_PLACES=61, PETRI_TRANSITIONS=61} [2022-12-13 18:15:42,973 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -24 predicate places. [2022-12-13 18:15:42,973 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 61 transitions, 302 flow [2022-12-13 18:15:42,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 153.25) internal successors, (613), 4 states have internal predecessors, (613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:42,973 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:15:42,973 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:15:42,981 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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)] Forceful destruction successful, exit code 0 [2022-12-13 18:15:43,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:43,174 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:15:43,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:15:43,176 INFO L85 PathProgramCache]: Analyzing trace with hash -642191386, now seen corresponding path program 1 times [2022-12-13 18:15:43,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:15:43,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1008391429] [2022-12-13 18:15:43,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:15:43,178 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 18:15:43,178 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:15:43,181 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:43,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:43,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:15:43,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 18:15:43,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:15:43,318 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 18:15:43,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:15:43,318 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:15:43,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1008391429] [2022-12-13 18:15:43,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1008391429] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:15:43,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:15:43,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:15:43,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046246374] [2022-12-13 18:15:43,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:15:43,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:15:43,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:15:43,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:15:43,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:15:43,331 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 377 [2022-12-13 18:15:43,332 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 61 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:43,332 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:15:43,332 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 377 [2022-12-13 18:15:43,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:15:43,886 INFO L130 PetriNetUnfolder]: 781/1327 cut-off events. [2022-12-13 18:15:43,887 INFO L131 PetriNetUnfolder]: For 1506/1514 co-relation queries the response was YES. [2022-12-13 18:15:43,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4386 conditions, 1327 events. 781/1327 cut-off events. For 1506/1514 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 5984 event pairs, 179 based on Foata normal form. 50/1303 useless extension candidates. Maximal degree in co-relation 4377. Up to 417 conditions per place. [2022-12-13 18:15:43,891 INFO L137 encePairwiseOnDemand]: 371/377 looper letters, 86 selfloop transitions, 13 changer transitions 0/103 dead transitions. [2022-12-13 18:15:43,891 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 103 transitions, 670 flow [2022-12-13 18:15:43,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:15:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 18:15:43,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 831 transitions. [2022-12-13 18:15:43,893 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44084880636604773 [2022-12-13 18:15:43,893 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 831 transitions. [2022-12-13 18:15:43,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 831 transitions. [2022-12-13 18:15:43,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:15:43,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 831 transitions. [2022-12-13 18:15:43,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 166.2) internal successors, (831), 5 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:43,896 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:43,896 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 377.0) internal successors, (2262), 6 states have internal predecessors, (2262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:43,896 INFO L175 Difference]: Start difference. First operand has 61 places, 61 transitions, 302 flow. Second operand 5 states and 831 transitions. [2022-12-13 18:15:43,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 103 transitions, 670 flow [2022-12-13 18:15:43,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 103 transitions, 652 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 18:15:43,898 INFO L231 Difference]: Finished difference. Result has 64 places, 63 transitions, 336 flow [2022-12-13 18:15:43,899 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=336, PETRI_PLACES=64, PETRI_TRANSITIONS=63} [2022-12-13 18:15:43,899 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -21 predicate places. [2022-12-13 18:15:43,899 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 63 transitions, 336 flow [2022-12-13 18:15:43,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 153.0) internal successors, (765), 5 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:43,899 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:15:43,899 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 18:15:43,907 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:44,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:44,101 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:15:44,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:15:44,103 INFO L85 PathProgramCache]: Analyzing trace with hash -211048819, now seen corresponding path program 1 times [2022-12-13 18:15:44,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:15:44,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115774505] [2022-12-13 18:15:44,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:15:44,105 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 18:15:44,105 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:15:44,106 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:44,107 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:44,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:15:44,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 18:15:44,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:15:44,262 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 18:15:44,262 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:15:44,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:15:44,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115774505] [2022-12-13 18:15:44,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115774505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:15:44,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:15:44,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:15:44,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357200612] [2022-12-13 18:15:44,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:15:44,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:15:44,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:15:44,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:15:44,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:15:44,278 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 377 [2022-12-13 18:15:44,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 63 transitions, 336 flow. Second operand has 6 states, 6 states have (on average 153.16666666666666) internal successors, (919), 6 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:44,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:15:44,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 377 [2022-12-13 18:15:44,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:15:44,810 INFO L130 PetriNetUnfolder]: 614/973 cut-off events. [2022-12-13 18:15:44,810 INFO L131 PetriNetUnfolder]: For 1385/1393 co-relation queries the response was YES. [2022-12-13 18:15:44,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3339 conditions, 973 events. 614/973 cut-off events. For 1385/1393 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4126 event pairs, 135 based on Foata normal form. 12/974 useless extension candidates. Maximal degree in co-relation 3329. Up to 404 conditions per place. [2022-12-13 18:15:44,813 INFO L137 encePairwiseOnDemand]: 371/377 looper letters, 67 selfloop transitions, 17 changer transitions 1/89 dead transitions. [2022-12-13 18:15:44,814 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 89 transitions, 586 flow [2022-12-13 18:15:44,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:15:44,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:15:44,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 976 transitions. [2022-12-13 18:15:44,816 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43147656940760387 [2022-12-13 18:15:44,816 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 976 transitions. [2022-12-13 18:15:44,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 976 transitions. [2022-12-13 18:15:44,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:15:44,816 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 976 transitions. [2022-12-13 18:15:44,818 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 162.66666666666666) internal successors, (976), 6 states have internal predecessors, (976), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:44,821 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 377.0) internal successors, (2639), 7 states have internal predecessors, (2639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:44,822 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 377.0) internal successors, (2639), 7 states have internal predecessors, (2639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:44,822 INFO L175 Difference]: Start difference. First operand has 64 places, 63 transitions, 336 flow. Second operand 6 states and 976 transitions. [2022-12-13 18:15:44,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 89 transitions, 586 flow [2022-12-13 18:15:44,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 89 transitions, 518 flow, removed 23 selfloop flow, removed 5 redundant places. [2022-12-13 18:15:44,828 INFO L231 Difference]: Finished difference. Result has 60 places, 48 transitions, 242 flow [2022-12-13 18:15:44,828 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=242, PETRI_PLACES=60, PETRI_TRANSITIONS=48} [2022-12-13 18:15:44,828 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -25 predicate places. [2022-12-13 18:15:44,828 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 48 transitions, 242 flow [2022-12-13 18:15:44,829 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 153.16666666666666) internal successors, (919), 6 states have internal predecessors, (919), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:44,829 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:15:44,829 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:15:44,837 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:45,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:45,031 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:15:45,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:15:45,032 INFO L85 PathProgramCache]: Analyzing trace with hash -158014418, now seen corresponding path program 1 times [2022-12-13 18:15:45,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:15:45,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [675445684] [2022-12-13 18:15:45,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:15:45,034 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 18:15:45,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:15:45,037 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:45,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:45,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:15:45,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:15:45,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:15:45,225 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 18:15:45,225 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:15:45,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:15:45,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [675445684] [2022-12-13 18:15:45,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [675445684] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:15:45,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:15:45,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:15:45,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877675502] [2022-12-13 18:15:45,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:15:45,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:15:45,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:15:45,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:15:45,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:15:45,230 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 377 [2022-12-13 18:15:45,230 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 48 transitions, 242 flow. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:45,231 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:15:45,231 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 377 [2022-12-13 18:15:45,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:15:45,532 INFO L130 PetriNetUnfolder]: 911/1485 cut-off events. [2022-12-13 18:15:45,532 INFO L131 PetriNetUnfolder]: For 2688/2688 co-relation queries the response was YES. [2022-12-13 18:15:45,534 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5021 conditions, 1485 events. 911/1485 cut-off events. For 2688/2688 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 7437 event pairs, 337 based on Foata normal form. 0/1467 useless extension candidates. Maximal degree in co-relation 5011. Up to 594 conditions per place. [2022-12-13 18:15:45,536 INFO L137 encePairwiseOnDemand]: 373/377 looper letters, 89 selfloop transitions, 3 changer transitions 0/95 dead transitions. [2022-12-13 18:15:45,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 95 transitions, 707 flow [2022-12-13 18:15:45,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:15:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:15:45,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 661 transitions. [2022-12-13 18:15:45,538 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4383289124668435 [2022-12-13 18:15:45,538 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 661 transitions. [2022-12-13 18:15:45,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 661 transitions. [2022-12-13 18:15:45,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:15:45,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 661 transitions. [2022-12-13 18:15:45,539 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 165.25) internal successors, (661), 4 states have internal predecessors, (661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:45,540 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:45,541 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:45,541 INFO L175 Difference]: Start difference. First operand has 60 places, 48 transitions, 242 flow. Second operand 4 states and 661 transitions. [2022-12-13 18:15:45,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 95 transitions, 707 flow [2022-12-13 18:15:45,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 95 transitions, 592 flow, removed 25 selfloop flow, removed 4 redundant places. [2022-12-13 18:15:45,547 INFO L231 Difference]: Finished difference. Result has 59 places, 49 transitions, 204 flow [2022-12-13 18:15:45,547 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=55, 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=4, PETRI_FLOW=204, PETRI_PLACES=59, PETRI_TRANSITIONS=49} [2022-12-13 18:15:45,548 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -26 predicate places. [2022-12-13 18:15:45,548 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 49 transitions, 204 flow [2022-12-13 18:15:45,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:15:45,548 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:15:45,549 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:15:45,559 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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)] Forceful destruction successful, exit code 0 [2022-12-13 18:15:45,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:45,750 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:15:45,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:15:45,751 INFO L85 PathProgramCache]: Analyzing trace with hash 315974976, now seen corresponding path program 1 times [2022-12-13 18:15:45,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:15:45,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240001908] [2022-12-13 18:15:45,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:15:45,754 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 18:15:45,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:15:45,758 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:15:45,761 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 (12)] Waiting until timeout for monitored process [2022-12-13 18:15:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:15:45,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 18:15:45,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:21:35,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 18:21:35,703 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-12-13 18:21:35,723 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 18:21:35,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:21:35,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:21:35,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240001908] [2022-12-13 18:21:35,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240001908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:21:35,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:21:35,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:21:35,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022582432] [2022-12-13 18:21:35,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:21:35,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:21:35,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:21:35,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:21:35,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:21:35,837 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 377 [2022-12-13 18:21:35,838 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 49 transitions, 204 flow. Second operand has 6 states, 6 states have (on average 149.66666666666666) internal successors, (898), 6 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:35,838 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:21:35,838 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 377 [2022-12-13 18:21:35,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:21:36,243 INFO L130 PetriNetUnfolder]: 1002/1672 cut-off events. [2022-12-13 18:21:36,243 INFO L131 PetriNetUnfolder]: For 1950/1950 co-relation queries the response was YES. [2022-12-13 18:21:36,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5511 conditions, 1672 events. 1002/1672 cut-off events. For 1950/1950 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9138 event pairs, 303 based on Foata normal form. 0/1655 useless extension candidates. Maximal degree in co-relation 5500. Up to 570 conditions per place. [2022-12-13 18:21:36,249 INFO L137 encePairwiseOnDemand]: 371/377 looper letters, 95 selfloop transitions, 10 changer transitions 0/109 dead transitions. [2022-12-13 18:21:36,249 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 109 transitions, 718 flow [2022-12-13 18:21:36,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 18:21:36,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 18:21:36,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1233 transitions. [2022-12-13 18:21:36,252 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4088196286472148 [2022-12-13 18:21:36,252 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1233 transitions. [2022-12-13 18:21:36,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1233 transitions. [2022-12-13 18:21:36,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:21:36,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1233 transitions. [2022-12-13 18:21:36,255 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 154.125) internal successors, (1233), 8 states have internal predecessors, (1233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:36,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 377.0) internal successors, (3393), 9 states have internal predecessors, (3393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:36,260 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 377.0) internal successors, (3393), 9 states have internal predecessors, (3393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:36,260 INFO L175 Difference]: Start difference. First operand has 59 places, 49 transitions, 204 flow. Second operand 8 states and 1233 transitions. [2022-12-13 18:21:36,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 109 transitions, 718 flow [2022-12-13 18:21:36,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 109 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:21:36,276 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 241 flow [2022-12-13 18:21:36,277 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=241, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2022-12-13 18:21:36,277 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -21 predicate places. [2022-12-13 18:21:36,277 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 241 flow [2022-12-13 18:21:36,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 149.66666666666666) internal successors, (898), 6 states have internal predecessors, (898), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:36,278 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:21:36,278 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:21:36,291 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 (12)] Ended with exit code 0 [2022-12-13 18:21:36,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:21:36,479 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:21:36,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:21:36,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1419463045, now seen corresponding path program 1 times [2022-12-13 18:21:36,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:21:36,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397186694] [2022-12-13 18:21:36,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:21:36,480 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 18:21:36,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:21:36,482 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:21:36,484 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 (13)] Waiting until timeout for monitored process [2022-12-13 18:21:36,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:21:36,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 18:21:36,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:21:44,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-12-13 18:21:44,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 18:21:44,420 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 18:21:44,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:21:44,420 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:21:44,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397186694] [2022-12-13 18:21:44,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [397186694] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:21:44,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:21:44,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:21:44,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842058028] [2022-12-13 18:21:44,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:21:44,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:21:44,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:21:44,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:21:44,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:21:44,586 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 377 [2022-12-13 18:21:44,587 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 241 flow. Second operand has 6 states, 6 states have (on average 154.66666666666666) internal successors, (928), 6 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:44,587 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:21:44,587 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 377 [2022-12-13 18:21:44,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:21:45,088 INFO L130 PetriNetUnfolder]: 1000/1674 cut-off events. [2022-12-13 18:21:45,088 INFO L131 PetriNetUnfolder]: For 2335/2335 co-relation queries the response was YES. [2022-12-13 18:21:45,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5781 conditions, 1674 events. 1000/1674 cut-off events. For 2335/2335 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 9105 event pairs, 303 based on Foata normal form. 0/1661 useless extension candidates. Maximal degree in co-relation 5769. Up to 576 conditions per place. [2022-12-13 18:21:45,095 INFO L137 encePairwiseOnDemand]: 372/377 looper letters, 98 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2022-12-13 18:21:45,095 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 110 transitions, 741 flow [2022-12-13 18:21:45,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 18:21:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 18:21:45,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1123 transitions. [2022-12-13 18:21:45,097 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4255399772641152 [2022-12-13 18:21:45,097 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1123 transitions. [2022-12-13 18:21:45,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1123 transitions. [2022-12-13 18:21:45,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:21:45,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1123 transitions. [2022-12-13 18:21:45,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 160.42857142857142) internal successors, (1123), 7 states have internal predecessors, (1123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:45,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 377.0) internal successors, (3016), 8 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:45,101 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 377.0) internal successors, (3016), 8 states have internal predecessors, (3016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:45,101 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 241 flow. Second operand 7 states and 1123 transitions. [2022-12-13 18:21:45,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 110 transitions, 741 flow [2022-12-13 18:21:45,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 110 transitions, 736 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 18:21:45,112 INFO L231 Difference]: Finished difference. Result has 68 places, 51 transitions, 250 flow [2022-12-13 18:21:45,112 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=250, PETRI_PLACES=68, PETRI_TRANSITIONS=51} [2022-12-13 18:21:45,112 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -17 predicate places. [2022-12-13 18:21:45,112 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 51 transitions, 250 flow [2022-12-13 18:21:45,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 154.66666666666666) internal successors, (928), 6 states have internal predecessors, (928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:45,113 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:21:45,113 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:21:45,121 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 (13)] Ended with exit code 0 [2022-12-13 18:21:45,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:21:45,314 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:21:45,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:21:45,315 INFO L85 PathProgramCache]: Analyzing trace with hash -874987940, now seen corresponding path program 2 times [2022-12-13 18:21:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:21:45,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144611374] [2022-12-13 18:21:45,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:21:45,317 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 18:21:45,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:21:45,320 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:21:45,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 (14)] Waiting until timeout for monitored process [2022-12-13 18:21:45,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 18:21:45,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:21:45,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:21:45,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:21:45,540 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 18:21:45,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:21:45,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:21:45,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144611374] [2022-12-13 18:21:45,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144611374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:21:45,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:21:45,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:21:45,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152499863] [2022-12-13 18:21:45,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:21:45,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:21:45,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:21:45,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:21:45,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:21:45,546 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 377 [2022-12-13 18:21:45,546 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 51 transitions, 250 flow. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:45,546 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:21:45,546 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 377 [2022-12-13 18:21:45,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:21:45,999 INFO L130 PetriNetUnfolder]: 1861/3126 cut-off events. [2022-12-13 18:21:45,999 INFO L131 PetriNetUnfolder]: For 5755/5755 co-relation queries the response was YES. [2022-12-13 18:21:46,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10931 conditions, 3126 events. 1861/3126 cut-off events. For 5755/5755 co-relation queries the response was YES. Maximal size of possible extension queue 214. Compared 19210 event pairs, 443 based on Foata normal form. 2/3114 useless extension candidates. Maximal degree in co-relation 10919. Up to 1206 conditions per place. [2022-12-13 18:21:46,011 INFO L137 encePairwiseOnDemand]: 373/377 looper letters, 111 selfloop transitions, 3 changer transitions 0/117 dead transitions. [2022-12-13 18:21:46,011 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 117 transitions, 838 flow [2022-12-13 18:21:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:21:46,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:21:46,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 668 transitions. [2022-12-13 18:21:46,013 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44297082228116713 [2022-12-13 18:21:46,013 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 668 transitions. [2022-12-13 18:21:46,013 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 668 transitions. [2022-12-13 18:21:46,013 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:21:46,013 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 668 transitions. [2022-12-13 18:21:46,014 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.0) internal successors, (668), 4 states have internal predecessors, (668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:46,015 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:46,015 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:46,015 INFO L175 Difference]: Start difference. First operand has 68 places, 51 transitions, 250 flow. Second operand 4 states and 668 transitions. [2022-12-13 18:21:46,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 117 transitions, 838 flow [2022-12-13 18:21:46,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 117 transitions, 797 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-13 18:21:46,052 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 249 flow [2022-12-13 18:21:46,052 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=249, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2022-12-13 18:21:46,052 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -18 predicate places. [2022-12-13 18:21:46,052 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 249 flow [2022-12-13 18:21:46,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:46,052 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:21:46,052 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:21:46,061 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 (14)] Ended with exit code 0 [2022-12-13 18:21:46,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:21:46,254 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:21:46,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:21:46,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1689866984, now seen corresponding path program 3 times [2022-12-13 18:21:46,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:21:46,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [817236950] [2022-12-13 18:21:46,257 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 18:21:46,257 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 18:21:46,258 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:21:46,260 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:21:46,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 (15)] Waiting until timeout for monitored process [2022-12-13 18:21:46,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 18:21:46,427 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:21:46,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:21:46,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:21:46,459 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 18:21:46,459 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:21:46,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:21:46,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [817236950] [2022-12-13 18:21:46,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [817236950] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:21:46,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:21:46,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:21:46,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658250388] [2022-12-13 18:21:46,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:21:46,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:21:46,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:21:46,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:21:46,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:21:46,464 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 377 [2022-12-13 18:21:46,465 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 249 flow. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:46,465 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:21:46,465 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 377 [2022-12-13 18:21:46,465 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:21:47,128 INFO L130 PetriNetUnfolder]: 2935/4786 cut-off events. [2022-12-13 18:21:47,128 INFO L131 PetriNetUnfolder]: For 7492/7492 co-relation queries the response was YES. [2022-12-13 18:21:47,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17388 conditions, 4786 events. 2935/4786 cut-off events. For 7492/7492 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 30348 event pairs, 725 based on Foata normal form. 2/4772 useless extension candidates. Maximal degree in co-relation 17375. Up to 1944 conditions per place. [2022-12-13 18:21:47,148 INFO L137 encePairwiseOnDemand]: 373/377 looper letters, 110 selfloop transitions, 3 changer transitions 0/116 dead transitions. [2022-12-13 18:21:47,148 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 116 transitions, 809 flow [2022-12-13 18:21:47,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:21:47,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:21:47,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 664 transitions. [2022-12-13 18:21:47,150 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4403183023872679 [2022-12-13 18:21:47,150 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 664 transitions. [2022-12-13 18:21:47,150 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 664 transitions. [2022-12-13 18:21:47,150 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:21:47,150 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 664 transitions. [2022-12-13 18:21:47,151 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:47,152 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:47,152 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 377.0) internal successors, (1885), 5 states have internal predecessors, (1885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:47,152 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 249 flow. Second operand 4 states and 664 transitions. [2022-12-13 18:21:47,152 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 116 transitions, 809 flow [2022-12-13 18:21:47,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 116 transitions, 805 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:21:47,241 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 259 flow [2022-12-13 18:21:47,241 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=377, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=259, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2022-12-13 18:21:47,241 INFO L288 CegarLoopForPetriNet]: 85 programPoint places, -16 predicate places. [2022-12-13 18:21:47,241 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 259 flow [2022-12-13 18:21:47,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:21:47,241 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:21:47,241 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:21:47,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 (15)] Forceful destruction successful, exit code 0 [2022-12-13 18:21:47,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:21:47,443 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 67 more)] === [2022-12-13 18:21:47,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:21:47,444 INFO L85 PathProgramCache]: Analyzing trace with hash -107720922, now seen corresponding path program 4 times [2022-12-13 18:21:47,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:21:47,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [549816314] [2022-12-13 18:21:47,445 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 18:21:47,446 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 18:21:47,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:21:47,448 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:21:47,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 (16)] Waiting until timeout for monitored process [2022-12-13 18:21:47,693 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 18:21:47,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 18:21:47,693 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:21:47,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:21:47,951 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 18:21:47,952 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 18:21:47,952 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (69 of 70 remaining) [2022-12-13 18:21:47,953 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (68 of 70 remaining) [2022-12-13 18:21:47,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 70 remaining) [2022-12-13 18:21:47,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 70 remaining) [2022-12-13 18:21:47,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 70 remaining) [2022-12-13 18:21:47,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 70 remaining) [2022-12-13 18:21:47,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 70 remaining) [2022-12-13 18:21:47,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 70 remaining) [2022-12-13 18:21:47,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 70 remaining) [2022-12-13 18:21:47,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 70 remaining) [2022-12-13 18:21:47,954 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 70 remaining) [2022-12-13 18:21:47,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 70 remaining) [2022-12-13 18:21:47,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 70 remaining) [2022-12-13 18:21:47,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 70 remaining) [2022-12-13 18:21:47,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 70 remaining) [2022-12-13 18:21:47,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 70 remaining) [2022-12-13 18:21:47,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 70 remaining) [2022-12-13 18:21:47,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 70 remaining) [2022-12-13 18:21:47,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 70 remaining) [2022-12-13 18:21:47,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 70 remaining) [2022-12-13 18:21:47,955 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 70 remaining) [2022-12-13 18:21:47,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 70 remaining) [2022-12-13 18:21:47,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 70 remaining) [2022-12-13 18:21:47,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 70 remaining) [2022-12-13 18:21:47,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 70 remaining) [2022-12-13 18:21:47,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 70 remaining) [2022-12-13 18:21:47,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 70 remaining) [2022-12-13 18:21:47,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 70 remaining) [2022-12-13 18:21:47,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 70 remaining) [2022-12-13 18:21:47,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 70 remaining) [2022-12-13 18:21:47,956 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 70 remaining) [2022-12-13 18:21:47,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 70 remaining) [2022-12-13 18:21:47,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 70 remaining) [2022-12-13 18:21:47,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 70 remaining) [2022-12-13 18:21:47,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 70 remaining) [2022-12-13 18:21:47,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 70 remaining) [2022-12-13 18:21:47,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 70 remaining) [2022-12-13 18:21:47,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 70 remaining) [2022-12-13 18:21:47,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 70 remaining) [2022-12-13 18:21:47,957 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 70 remaining) [2022-12-13 18:21:47,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (29 of 70 remaining) [2022-12-13 18:21:47,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 70 remaining) [2022-12-13 18:21:47,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (27 of 70 remaining) [2022-12-13 18:21:47,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (26 of 70 remaining) [2022-12-13 18:21:47,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 70 remaining) [2022-12-13 18:21:47,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 70 remaining) [2022-12-13 18:21:47,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 70 remaining) [2022-12-13 18:21:47,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 70 remaining) [2022-12-13 18:21:47,958 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 70 remaining) [2022-12-13 18:21:47,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 70 remaining) [2022-12-13 18:21:47,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 70 remaining) [2022-12-13 18:21:47,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 70 remaining) [2022-12-13 18:21:47,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 70 remaining) [2022-12-13 18:21:47,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 70 remaining) [2022-12-13 18:21:47,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 70 remaining) [2022-12-13 18:21:47,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 70 remaining) [2022-12-13 18:21:47,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 70 remaining) [2022-12-13 18:21:47,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 70 remaining) [2022-12-13 18:21:47,959 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 70 remaining) [2022-12-13 18:21:47,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 70 remaining) [2022-12-13 18:21:47,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 70 remaining) [2022-12-13 18:21:47,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 70 remaining) [2022-12-13 18:21:47,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 70 remaining) [2022-12-13 18:21:47,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 70 remaining) [2022-12-13 18:21:47,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 70 remaining) [2022-12-13 18:21:47,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 70 remaining) [2022-12-13 18:21:47,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 70 remaining) [2022-12-13 18:21:47,960 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 70 remaining) [2022-12-13 18:21:47,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 70 remaining) [2022-12-13 18:21:47,961 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 70 remaining) [2022-12-13 18:21:47,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 (16)] Ended with exit code 0 [2022-12-13 18:21:48,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/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 18:21:48,162 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:21:48,179 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 18:21:48,179 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:21:48,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:21:48 BasicIcfg [2022-12-13 18:21:48,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:21:48,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:21:48,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:21:48,259 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:21:48,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:14:36" (3/4) ... [2022-12-13 18:21:48,262 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 18:21:48,262 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:21:48,262 INFO L158 Benchmark]: Toolchain (without parser) took 433091.08ms. Allocated memory was 58.7MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 25.9MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 2.7GB. Max. memory is 16.1GB. [2022-12-13 18:21:48,262 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 58.7MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:21:48,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.45ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 25.6MB in the beginning and 48.7MB in the end (delta: -23.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 18:21:48,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.38ms. Allocated memory is still 75.5MB. Free memory was 48.7MB in the beginning and 45.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 18:21:48,263 INFO L158 Benchmark]: Boogie Preprocessor took 23.80ms. Allocated memory is still 75.5MB. Free memory was 45.9MB in the beginning and 43.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:21:48,263 INFO L158 Benchmark]: RCFGBuilder took 1331.96ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 43.4MB in the beginning and 35.6MB in the end (delta: 7.8MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2022-12-13 18:21:48,264 INFO L158 Benchmark]: TraceAbstraction took 431279.31ms. Allocated memory was 92.3MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 34.9MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. [2022-12-13 18:21:48,264 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 5.1GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:21:48,266 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.12ms. Allocated memory is still 58.7MB. Free memory was 37.3MB in the beginning and 37.2MB in the end (delta: 81.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.45ms. Allocated memory was 58.7MB in the beginning and 75.5MB in the end (delta: 16.8MB). Free memory was 25.6MB in the beginning and 48.7MB in the end (delta: -23.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.38ms. Allocated memory is still 75.5MB. Free memory was 48.7MB in the beginning and 45.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.80ms. Allocated memory is still 75.5MB. Free memory was 45.9MB in the beginning and 43.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1331.96ms. Allocated memory was 75.5MB in the beginning and 92.3MB in the end (delta: 16.8MB). Free memory was 43.4MB in the beginning and 35.6MB in the end (delta: 7.8MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * TraceAbstraction took 431279.31ms. Allocated memory was 92.3MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 34.9MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 2.6GB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 5.1GB. Free memory was 2.4GB in the beginning and 2.4GB in the end (delta: 1.0MB). 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: 30.8s, 206 PlacesBefore, 85 PlacesAfterwards, 195 TransitionsBefore, 73 TransitionsAfterwards, 6900 CoEnabledTransitionPairs, 8 FixpointIterations, 83 TrivialSequentialCompositions, 89 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 178 TotalNumberOfCompositions, 31877 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 12176, independent: 11603, independent conditional: 0, independent unconditional: 11603, dependent: 573, dependent conditional: 0, dependent unconditional: 573, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3285, independent: 3197, independent conditional: 0, independent unconditional: 3197, dependent: 88, dependent conditional: 0, dependent unconditional: 88, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 12176, independent: 8406, independent conditional: 0, independent unconditional: 8406, dependent: 485, dependent conditional: 0, dependent unconditional: 485, unknown: 3285, unknown conditional: 0, unknown unconditional: 3285] , Statistics on independence cache: Total cache size (in pairs): 612, Positive cache size: 569, Positive conditional cache size: 0, Positive unconditional cache size: 569, Negative cache size: 43, Negative conditional cache size: 0, Negative unconditional cache size: 43, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L719] 0 _Bool __unbuffered_p3_EAX$flush_delayed; [L720] 0 int __unbuffered_p3_EAX$mem_tmp; [L721] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd0; [L722] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd1; [L723] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd2; [L724] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd3; [L725] 0 _Bool __unbuffered_p3_EAX$r_buff0_thd4; [L726] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd0; [L727] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd1; [L728] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd2; [L729] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd3; [L730] 0 _Bool __unbuffered_p3_EAX$r_buff1_thd4; [L731] 0 _Bool __unbuffered_p3_EAX$read_delayed; [L732] 0 int *__unbuffered_p3_EAX$read_delayed_var; [L733] 0 int __unbuffered_p3_EAX$w_buff0; [L734] 0 _Bool __unbuffered_p3_EAX$w_buff0_used; [L735] 0 int __unbuffered_p3_EAX$w_buff1; [L736] 0 _Bool __unbuffered_p3_EAX$w_buff1_used; [L738] 0 int a = 0; [L739] 0 _Bool main$tmp_guard0; [L740] 0 _Bool main$tmp_guard1; [L742] 0 int x = 0; [L744] 0 int y = 0; [L746] 0 int z = 0; [L747] 0 _Bool z$flush_delayed; [L748] 0 int z$mem_tmp; [L749] 0 _Bool z$r_buff0_thd0; [L750] 0 _Bool z$r_buff0_thd1; [L751] 0 _Bool z$r_buff0_thd2; [L752] 0 _Bool z$r_buff0_thd3; [L753] 0 _Bool z$r_buff0_thd4; [L754] 0 _Bool z$r_buff1_thd0; [L755] 0 _Bool z$r_buff1_thd1; [L756] 0 _Bool z$r_buff1_thd2; [L757] 0 _Bool z$r_buff1_thd3; [L758] 0 _Bool z$r_buff1_thd4; [L759] 0 _Bool z$read_delayed; [L760] 0 int *z$read_delayed_var; [L761] 0 int z$w_buff0; [L762] 0 _Bool z$w_buff0_used; [L763] 0 int z$w_buff1; [L764] 0 _Bool z$w_buff1_used; [L765] 0 _Bool weak$$choice0; [L766] 0 _Bool weak$$choice1; [L767] 0 _Bool weak$$choice2; [L875] 0 pthread_t t2709; [L876] FCALL, FORK 0 pthread_create(&t2709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2709, ((void *)0), P0, ((void *)0))=-1, t2709={-2147483642:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t2710; [L878] FCALL, FORK 0 pthread_create(&t2710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2710, ((void *)0), P1, ((void *)0))=0, t2709={-2147483642:0}, t2710={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L879] 0 pthread_t t2711; [L880] FCALL, FORK 0 pthread_create(&t2711, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2711, ((void *)0), P2, ((void *)0))=1, t2709={-2147483642:0}, t2710={6:0}, t2711={-2147483646:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L881] 0 pthread_t t2712; [L882] FCALL, FORK 0 pthread_create(&t2712, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=0, __unbuffered_p3_EAX$read_delayed_var={0:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2712, ((void *)0), P3, ((void *)0))=2, t2709={-2147483642:0}, t2710={6:0}, t2711={-2147483646:0}, t2712={-2147483641:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 4 z$flush_delayed = weak$$choice2 [L834] EXPR 4 \read(z) [L834] 4 z$mem_tmp = z [L835] 4 weak$$choice1 = __VERIFIER_nondet_bool() [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] EXPR 4 \read(z) [L836] EXPR 4 !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L836] 4 z = !z$w_buff0_used ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z : (weak$$choice1 ? z$w_buff0 : z$w_buff1)) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$w_buff1 : z$w_buff0) : (weak$$choice0 ? z$w_buff0 : z)))) [L837] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)))) [L838] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)))) [L839] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 || !weak$$choice1 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : weak$$choice0)))) [L840] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? weak$$choice0 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L841] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L842] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (z$w_buff0_used && !z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (weak$$choice0 ? z$r_buff1_thd4 : (_Bool)0) : (z$w_buff0_used && z$r_buff1_thd4 && z$w_buff1_used && !z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)))) [L843] 4 __unbuffered_p3_EAX$read_delayed = (_Bool)1 [L844] 4 __unbuffered_p3_EAX$read_delayed_var = &z [L845] EXPR 4 \read(z) [L845] 4 __unbuffered_p3_EAX = z [L846] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L846] EXPR 4 \read(z) [L846] EXPR 4 z$flush_delayed ? z$mem_tmp : z [L846] 4 z = z$flush_delayed ? z$mem_tmp : z [L847] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 \read(z) [L853] EXPR 4 z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z [L853] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L853] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L854] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L855] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L856] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L857] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L771] 1 __unbuffered_p0_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L774] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 1 return 0; [L786] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L796] 2 return 0; [L801] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] 3 z$w_buff1 = z$w_buff0 [L805] 3 z$w_buff0 = 1 [L806] 3 z$w_buff1_used = z$w_buff0_used [L807] 3 z$w_buff0_used = (_Bool)1 [L808] CALL 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L808] RET 3 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L809] 3 z$r_buff1_thd0 = z$r_buff0_thd0 [L810] 3 z$r_buff1_thd1 = z$r_buff0_thd1 [L811] 3 z$r_buff1_thd2 = z$r_buff0_thd2 [L812] 3 z$r_buff1_thd3 = z$r_buff0_thd3 [L813] 3 z$r_buff1_thd4 = z$r_buff0_thd4 [L814] 3 z$r_buff0_thd3 = (_Bool)1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L817] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L818] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L819] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L820] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L821] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L826] 3 return 0; [L860] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L862] 4 return 0; [L884] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L886] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L886] RET 0 assume_abort_if_not(main$tmp_guard0) [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 \read(z) [L888] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L888] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L888] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L889] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L890] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L891] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L892] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2709={-2147483642:0}, t2710={6:0}, t2711={-2147483646:0}, t2712={-2147483641:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L895] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 \read(*__unbuffered_p3_EAX$read_delayed_var) [L896] EXPR 0 weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX [L896] EXPR 0 __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L896] 0 __unbuffered_p3_EAX = __unbuffered_p3_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p3_EAX$read_delayed_var : __unbuffered_p3_EAX) : __unbuffered_p3_EAX [L897] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L899] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, __unbuffered_p3_EAX$flush_delayed=0, __unbuffered_p3_EAX$mem_tmp=0, __unbuffered_p3_EAX$r_buff0_thd0=0, __unbuffered_p3_EAX$r_buff0_thd1=0, __unbuffered_p3_EAX$r_buff0_thd2=0, __unbuffered_p3_EAX$r_buff0_thd3=0, __unbuffered_p3_EAX$r_buff0_thd4=0, __unbuffered_p3_EAX$r_buff1_thd0=0, __unbuffered_p3_EAX$r_buff1_thd1=0, __unbuffered_p3_EAX$r_buff1_thd2=0, __unbuffered_p3_EAX$r_buff1_thd3=0, __unbuffered_p3_EAX$r_buff1_thd4=0, __unbuffered_p3_EAX$read_delayed=1, __unbuffered_p3_EAX$read_delayed_var={3:0}, __unbuffered_p3_EAX$w_buff0=0, __unbuffered_p3_EAX$w_buff0_used=0, __unbuffered_p3_EAX$w_buff1=0, __unbuffered_p3_EAX$w_buff1_used=0, a=1, arg={0:0}, arg={0: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=0, weak$$choice1=2, weak$$choice2=0, x=1, y=1, z={3:0}, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: -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: -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: -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: -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: -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: -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: 873]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 878]: 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: 882]: 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: 876]: 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: 880]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 257 locations, 70 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: 431.0s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 36.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 30.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 865 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 639 mSDsluCounter, 93 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 68 mSDsCounter, 133 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2128 IncrementalHoareTripleChecker+Invalid, 2261 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 133 mSolverCounterUnsat, 25 mSDtfsCounter, 2128 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 188 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=336occurred in iteration=8, InterpolantAutomatonStates: 60, 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.8s SatisfiabilityAnalysisTime, 358.1s InterpolantComputationTime, 259 NumberOfCodeBlocks, 259 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 219 ConstructedInterpolants, 0 QuantifiedInterpolants, 965 SizeOfPredicates, 56 NumberOfNonLiveVariables, 2409 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 18:21:48,284 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d89d090d-70db-4e01-8ec9-7288391cb552/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample