./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R --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 a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:23:43,340 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:23:43,342 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:23:43,387 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:23:43,388 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:23:43,392 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:23:43,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:23:43,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:23:43,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:23:43,405 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:23:43,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:23:43,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:23:43,409 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:23:43,411 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:23:43,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:23:43,420 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:23:43,422 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:23:43,423 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:23:43,424 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:23:43,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:23:43,433 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:23:43,434 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:23:43,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:23:43,436 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:23:43,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:23:43,439 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:23:43,439 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:23:43,440 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:23:43,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:23:43,441 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:23:43,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:23:43,442 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:23:43,443 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:23:43,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:23:43,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:23:43,445 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:23:43,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:23:43,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:23:43,446 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:23:43,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:23:43,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:23:43,448 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 17:23:43,468 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:23:43,469 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:23:43,469 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:23:43,469 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:23:43,470 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:23:43,470 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:23:43,471 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:23:43,471 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:23:43,471 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:23:43,471 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:23:43,471 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:23:43,472 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:23:43,472 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:23:43,472 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:23:43,472 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:23:43,472 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:23:43,472 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:23:43,473 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:23:43,473 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:23:43,473 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:23:43,473 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:23:43,473 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:23:43,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:23:43,474 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:23:43,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:23:43,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:23:43,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:23:43,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:23:43,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:23:43,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:23:43,475 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:23:43,475 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:23:43,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:23:43,475 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_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f [2022-11-25 17:23:43,732 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:23:43,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:23:43,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:23:43,769 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:23:43,770 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:23:43,771 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-25 17:23:46,795 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:23:47,036 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:23:47,037 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-25 17:23:47,052 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/data/18b4ab74a/7ff24cddbfd744b5a5c062dfe2ac252b/FLAGf96033819 [2022-11-25 17:23:47,068 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/data/18b4ab74a/7ff24cddbfd744b5a5c062dfe2ac252b [2022-11-25 17:23:47,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:23:47,072 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:23:47,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:23:47,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:23:47,077 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:23:47,078 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:23:47" (1/1) ... [2022-11-25 17:23:47,080 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f45bf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:47, skipping insertion in model container [2022-11-25 17:23:47,080 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:23:47" (1/1) ... [2022-11-25 17:23:47,088 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:23:47,127 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:23:47,377 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_f3d06774-a329-4c1a-b284-b6ee1a44e502/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2022-11-25 17:23:47,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,535 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,536 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,540 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,541 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,542 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,544 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,545 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,549 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,550 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,551 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,552 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,556 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,557 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,567 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,569 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,572 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,575 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,579 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,596 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:23:47,615 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:23:47,633 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_f3d06774-a329-4c1a-b284-b6ee1a44e502/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2022-11-25 17:23:47,677 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,683 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,684 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,690 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,694 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,695 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,696 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,698 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,699 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,700 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,702 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,706 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,707 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,709 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,710 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,712 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,715 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,716 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,720 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,721 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,723 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:23:47,729 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:23:47,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:23:47,763 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:23:47,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:47 WrapperNode [2022-11-25 17:23:47,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:23:47,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:23:47,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:23:47,765 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:23:47,773 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:47" (1/1) ... [2022-11-25 17:23:47,788 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:47" (1/1) ... [2022-11-25 17:23:47,815 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-25 17:23:47,816 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:23:47,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:23:47,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:23:47,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:23:47,827 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:47" (1/1) ... [2022-11-25 17:23:47,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:47" (1/1) ... [2022-11-25 17:23:47,835 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:47" (1/1) ... [2022-11-25 17:23:47,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:47" (1/1) ... [2022-11-25 17:23:47,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:47" (1/1) ... [2022-11-25 17:23:47,865 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:47" (1/1) ... [2022-11-25 17:23:47,867 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:47" (1/1) ... [2022-11-25 17:23:47,868 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:47" (1/1) ... [2022-11-25 17:23:47,871 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:23:47,884 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:23:47,884 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:23:47,884 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:23:47,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:47" (1/1) ... [2022-11-25 17:23:47,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:23:47,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:23:47,925 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:23:47,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:23:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 17:23:47,977 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:23:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:23:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:23:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:23:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:23:47,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:23:47,978 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:23:47,978 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:23:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:23:47,979 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:23:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:23:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:23:47,979 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:23:47,979 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:23:47,981 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:23:48,200 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:23:48,202 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:23:48,565 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:23:48,778 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:23:48,784 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:23:48,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:23:48 BoogieIcfgContainer [2022-11-25 17:23:48,788 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:23:48,791 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:23:48,791 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:23:48,794 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:23:48,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:23:47" (1/3) ... [2022-11-25 17:23:48,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9869b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:23:48, skipping insertion in model container [2022-11-25 17:23:48,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:23:47" (2/3) ... [2022-11-25 17:23:48,796 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9869b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:23:48, skipping insertion in model container [2022-11-25 17:23:48,796 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:23:48" (3/3) ... [2022-11-25 17:23:48,797 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-25 17:23:48,817 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:23:48,817 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-25 17:23:48,817 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:23:48,867 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:23:48,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 124 transitions, 263 flow [2022-11-25 17:23:48,963 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-11-25 17:23:48,963 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:23:48,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-25 17:23:48,968 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 124 transitions, 263 flow [2022-11-25 17:23:48,973 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 129 places, 121 transitions, 251 flow [2022-11-25 17:23:48,977 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:23:48,992 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 129 places, 121 transitions, 251 flow [2022-11-25 17:23:48,994 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 129 places, 121 transitions, 251 flow [2022-11-25 17:23:48,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 129 places, 121 transitions, 251 flow [2022-11-25 17:23:49,024 INFO L130 PetriNetUnfolder]: 2/121 cut-off events. [2022-11-25 17:23:49,024 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:23:49,025 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 121 events. 2/121 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 76 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-25 17:23:49,027 INFO L119 LiptonReduction]: Number of co-enabled transitions 2302 [2022-11-25 17:23:54,670 INFO L134 LiptonReduction]: Checked pairs total: 5648 [2022-11-25 17:23:54,670 INFO L136 LiptonReduction]: Total number of compositions: 125 [2022-11-25 17:23:54,701 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:23:54,719 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;@562141c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:23:54,720 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-25 17:23:54,721 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 17:23:54,722 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:23:54,722 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:54,722 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:23:54,723 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:23:54,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:54,728 INFO L85 PathProgramCache]: Analyzing trace with hash 541, now seen corresponding path program 1 times [2022-11-25 17:23:54,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:54,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614699614] [2022-11-25 17:23:54,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:54,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:54,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:54,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:54,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614699614] [2022-11-25 17:23:54,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614699614] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:54,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:54,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:23:54,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150972856] [2022-11-25 17:23:54,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:54,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:23:54,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:54,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:23:54,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:23:54,900 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 249 [2022-11-25 17:23:54,903 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:54,903 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:54,903 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 249 [2022-11-25 17:23:54,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:55,388 INFO L130 PetriNetUnfolder]: 1277/1923 cut-off events. [2022-11-25 17:23:55,388 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-25 17:23:55,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3864 conditions, 1923 events. 1277/1923 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 9225 event pairs, 1277 based on Foata normal form. 0/1615 useless extension candidates. Maximal degree in co-relation 3853. Up to 1887 conditions per place. [2022-11-25 17:23:55,409 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2022-11-25 17:23:55,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow [2022-11-25 17:23:55,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:23:55,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:23:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 251 transitions. [2022-11-25 17:23:55,450 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5040160642570282 [2022-11-25 17:23:55,451 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 251 transitions. [2022-11-25 17:23:55,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 251 transitions. [2022-11-25 17:23:55,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:55,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 251 transitions. [2022-11-25 17:23:55,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:55,470 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 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-11-25 17:23:55,471 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 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-11-25 17:23:55,473 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 251 transitions. [2022-11-25 17:23:55,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow [2022-11-25 17:23:55,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:23:55,485 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2022-11-25 17:23:55,488 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-11-25 17:23:55,494 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2022-11-25 17:23:55,494 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2022-11-25 17:23:55,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:55,495 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:55,495 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:23:55,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:23:55,496 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:23:55,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:55,498 INFO L85 PathProgramCache]: Analyzing trace with hash 510558046, now seen corresponding path program 1 times [2022-11-25 17:23:55,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:55,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636464811] [2022-11-25 17:23:55,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:55,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:55,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:55,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:55,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636464811] [2022-11-25 17:23:55,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636464811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:55,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:55,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:23:55,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088704155] [2022-11-25 17:23:55,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:55,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:23:55,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:55,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:23:55,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:23:55,821 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 249 [2022-11-25 17:23:55,825 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:55,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:55,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 249 [2022-11-25 17:23:55,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:56,168 INFO L130 PetriNetUnfolder]: 999/1618 cut-off events. [2022-11-25 17:23:56,169 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:23:56,172 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3151 conditions, 1618 events. 999/1618 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8703 event pairs, 165 based on Foata normal form. 0/1485 useless extension candidates. Maximal degree in co-relation 3148. Up to 1195 conditions per place. [2022-11-25 17:23:56,178 INFO L137 encePairwiseOnDemand]: 246/249 looper letters, 31 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2022-11-25 17:23:56,179 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 154 flow [2022-11-25 17:23:56,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:23:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:23:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 366 transitions. [2022-11-25 17:23:56,182 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4899598393574297 [2022-11-25 17:23:56,182 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 366 transitions. [2022-11-25 17:23:56,182 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 366 transitions. [2022-11-25 17:23:56,182 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:56,183 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 366 transitions. [2022-11-25 17:23:56,184 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:56,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:56,187 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 249.0) internal successors, (996), 4 states have internal predecessors, (996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:56,187 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 366 transitions. [2022-11-25 17:23:56,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 154 flow [2022-11-25 17:23:56,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:23:56,189 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2022-11-25 17:23:56,189 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-11-25 17:23:56,190 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-11-25 17:23:56,190 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2022-11-25 17:23:56,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:56,190 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:56,191 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:56,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:23:56,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:23:56,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:56,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1826657433, now seen corresponding path program 1 times [2022-11-25 17:23:56,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:56,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194866339] [2022-11-25 17:23:56,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:56,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:56,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:56,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:56,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:56,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194866339] [2022-11-25 17:23:56,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194866339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:56,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:56,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:23:56,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9565193] [2022-11-25 17:23:56,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:56,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:23:56,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:56,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:23:56,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:56,850 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 249 [2022-11-25 17:23:56,851 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:56,851 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:56,852 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 249 [2022-11-25 17:23:56,852 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:57,667 INFO L130 PetriNetUnfolder]: 2088/3111 cut-off events. [2022-11-25 17:23:57,668 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-11-25 17:23:57,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6415 conditions, 3111 events. 2088/3111 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 177. Compared 15174 event pairs, 359 based on Foata normal form. 0/3002 useless extension candidates. Maximal degree in co-relation 6411. Up to 1807 conditions per place. [2022-11-25 17:23:57,689 INFO L137 encePairwiseOnDemand]: 238/249 looper letters, 58 selfloop transitions, 22 changer transitions 0/81 dead transitions. [2022-11-25 17:23:57,690 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 81 transitions, 342 flow [2022-11-25 17:23:57,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:23:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:23:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 776 transitions. [2022-11-25 17:23:57,694 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44520940906483075 [2022-11-25 17:23:57,695 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 776 transitions. [2022-11-25 17:23:57,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 776 transitions. [2022-11-25 17:23:57,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:57,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 776 transitions. [2022-11-25 17:23:57,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.85714285714286) internal successors, (776), 7 states have internal predecessors, (776), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:57,704 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:57,705 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:57,705 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 7 states and 776 transitions. [2022-11-25 17:23:57,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 81 transitions, 342 flow [2022-11-25 17:23:57,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 81 transitions, 332 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:23:57,709 INFO L231 Difference]: Finished difference. Result has 42 places, 44 transitions, 212 flow [2022-11-25 17:23:57,709 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=212, PETRI_PLACES=42, PETRI_TRANSITIONS=44} [2022-11-25 17:23:57,711 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2022-11-25 17:23:57,711 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 44 transitions, 212 flow [2022-11-25 17:23:57,712 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:57,712 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:57,712 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:57,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:23:57,712 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:23:57,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:57,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1826657413, now seen corresponding path program 1 times [2022-11-25 17:23:57,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:57,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316977686] [2022-11-25 17:23:57,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:57,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:57,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:58,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:58,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316977686] [2022-11-25 17:23:58,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316977686] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:58,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:58,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:23:58,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824419917] [2022-11-25 17:23:58,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:58,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:23:58,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:58,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:23:58,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:23:58,512 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 249 [2022-11-25 17:23:58,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 44 transitions, 212 flow. Second operand has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:58,513 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:58,513 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 249 [2022-11-25 17:23:58,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:23:59,008 INFO L130 PetriNetUnfolder]: 1322/2068 cut-off events. [2022-11-25 17:23:59,008 INFO L131 PetriNetUnfolder]: For 2226/2272 co-relation queries the response was YES. [2022-11-25 17:23:59,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6646 conditions, 2068 events. 1322/2068 cut-off events. For 2226/2272 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 10451 event pairs, 96 based on Foata normal form. 240/2308 useless extension candidates. Maximal degree in co-relation 6638. Up to 1494 conditions per place. [2022-11-25 17:23:59,023 INFO L137 encePairwiseOnDemand]: 244/249 looper letters, 46 selfloop transitions, 5 changer transitions 17/74 dead transitions. [2022-11-25 17:23:59,024 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 74 transitions, 487 flow [2022-11-25 17:23:59,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:23:59,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:23:59,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 616 transitions. [2022-11-25 17:23:59,027 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41231593038821956 [2022-11-25 17:23:59,027 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 616 transitions. [2022-11-25 17:23:59,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 616 transitions. [2022-11-25 17:23:59,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:23:59,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 616 transitions. [2022-11-25 17:23:59,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 102.66666666666667) internal successors, (616), 6 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:59,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:59,033 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:59,033 INFO L175 Difference]: Start difference. First operand has 42 places, 44 transitions, 212 flow. Second operand 6 states and 616 transitions. [2022-11-25 17:23:59,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 74 transitions, 487 flow [2022-11-25 17:23:59,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 74 transitions, 487 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:23:59,040 INFO L231 Difference]: Finished difference. Result has 46 places, 31 transitions, 151 flow [2022-11-25 17:23:59,040 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=151, PETRI_PLACES=46, PETRI_TRANSITIONS=31} [2022-11-25 17:23:59,041 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2022-11-25 17:23:59,041 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 31 transitions, 151 flow [2022-11-25 17:23:59,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 97.66666666666667) internal successors, (586), 6 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:59,042 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:23:59,042 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:23:59,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:23:59,043 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:23:59,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:23:59,043 INFO L85 PathProgramCache]: Analyzing trace with hash -2053675854, now seen corresponding path program 1 times [2022-11-25 17:23:59,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:23:59,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879164792] [2022-11-25 17:23:59,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:23:59,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:23:59,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:23:59,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:23:59,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:23:59,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879164792] [2022-11-25 17:23:59,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879164792] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:23:59,423 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:23:59,423 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:23:59,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914897675] [2022-11-25 17:23:59,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:23:59,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:23:59,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:23:59,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:23:59,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:23:59,496 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 249 [2022-11-25 17:23:59,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 31 transitions, 151 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:23:59,497 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:23:59,497 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 249 [2022-11-25 17:23:59,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:00,155 INFO L130 PetriNetUnfolder]: 1397/2228 cut-off events. [2022-11-25 17:24:00,156 INFO L131 PetriNetUnfolder]: For 2693/2693 co-relation queries the response was YES. [2022-11-25 17:24:00,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7001 conditions, 2228 events. 1397/2228 cut-off events. For 2693/2693 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 11472 event pairs, 173 based on Foata normal form. 108/2336 useless extension candidates. Maximal degree in co-relation 6992. Up to 1349 conditions per place. [2022-11-25 17:24:00,171 INFO L137 encePairwiseOnDemand]: 237/249 looper letters, 48 selfloop transitions, 16 changer transitions 31/96 dead transitions. [2022-11-25 17:24:00,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 96 transitions, 639 flow [2022-11-25 17:24:00,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:24:00,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:24:00,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 773 transitions. [2022-11-25 17:24:00,175 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4434882386689616 [2022-11-25 17:24:00,175 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 773 transitions. [2022-11-25 17:24:00,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 773 transitions. [2022-11-25 17:24:00,176 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:00,176 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 773 transitions. [2022-11-25 17:24:00,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:00,182 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:00,183 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:00,183 INFO L175 Difference]: Start difference. First operand has 46 places, 31 transitions, 151 flow. Second operand 7 states and 773 transitions. [2022-11-25 17:24:00,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 96 transitions, 639 flow [2022-11-25 17:24:00,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 96 transitions, 612 flow, removed 4 selfloop flow, removed 5 redundant places. [2022-11-25 17:24:00,196 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 311 flow [2022-11-25 17:24:00,197 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2022-11-25 17:24:00,200 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 9 predicate places. [2022-11-25 17:24:00,200 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 311 flow [2022-11-25 17:24:00,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:00,202 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:00,202 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:00,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:24:00,202 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:00,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:00,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1843038236, now seen corresponding path program 1 times [2022-11-25 17:24:00,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:00,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112852120] [2022-11-25 17:24:00,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:00,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:00,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:00,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:00,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112852120] [2022-11-25 17:24:00,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112852120] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:00,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:00,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:24:00,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160789100] [2022-11-25 17:24:00,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:00,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:24:00,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:00,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:24:00,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:00,652 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 249 [2022-11-25 17:24:00,653 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 311 flow. Second operand has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:00,653 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:00,653 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 249 [2022-11-25 17:24:00,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:01,298 INFO L130 PetriNetUnfolder]: 1522/2344 cut-off events. [2022-11-25 17:24:01,298 INFO L131 PetriNetUnfolder]: For 5115/5115 co-relation queries the response was YES. [2022-11-25 17:24:01,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9065 conditions, 2344 events. 1522/2344 cut-off events. For 5115/5115 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 11590 event pairs, 307 based on Foata normal form. 81/2425 useless extension candidates. Maximal degree in co-relation 9052. Up to 1039 conditions per place. [2022-11-25 17:24:01,318 INFO L137 encePairwiseOnDemand]: 239/249 looper letters, 47 selfloop transitions, 18 changer transitions 20/86 dead transitions. [2022-11-25 17:24:01,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 86 transitions, 712 flow [2022-11-25 17:24:01,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:24:01,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:24:01,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 659 transitions. [2022-11-25 17:24:01,321 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44109772423025434 [2022-11-25 17:24:01,321 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 659 transitions. [2022-11-25 17:24:01,321 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 659 transitions. [2022-11-25 17:24:01,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:01,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 659 transitions. [2022-11-25 17:24:01,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 109.83333333333333) internal successors, (659), 6 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:01,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:01,327 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:01,327 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 311 flow. Second operand 6 states and 659 transitions. [2022-11-25 17:24:01,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 86 transitions, 712 flow [2022-11-25 17:24:01,347 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 86 transitions, 685 flow, removed 11 selfloop flow, removed 3 redundant places. [2022-11-25 17:24:01,348 INFO L231 Difference]: Finished difference. Result has 54 places, 47 transitions, 404 flow [2022-11-25 17:24:01,348 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=296, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=404, PETRI_PLACES=54, PETRI_TRANSITIONS=47} [2022-11-25 17:24:01,349 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 13 predicate places. [2022-11-25 17:24:01,349 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 47 transitions, 404 flow [2022-11-25 17:24:01,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.6) internal successors, (508), 5 states have internal predecessors, (508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:01,350 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:01,350 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:01,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:24:01,351 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:01,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:01,351 INFO L85 PathProgramCache]: Analyzing trace with hash 773024577, now seen corresponding path program 1 times [2022-11-25 17:24:01,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:01,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172014556] [2022-11-25 17:24:01,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:01,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:01,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:01,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:01,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172014556] [2022-11-25 17:24:01,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172014556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:01,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:01,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:24:01,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261518448] [2022-11-25 17:24:01,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:01,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:01,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:01,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:01,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:01,785 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 249 [2022-11-25 17:24:01,786 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 47 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:01,786 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:01,786 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 249 [2022-11-25 17:24:01,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:02,494 INFO L130 PetriNetUnfolder]: 2032/3164 cut-off events. [2022-11-25 17:24:02,495 INFO L131 PetriNetUnfolder]: For 7508/7508 co-relation queries the response was YES. [2022-11-25 17:24:02,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12915 conditions, 3164 events. 2032/3164 cut-off events. For 7508/7508 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 16945 event pairs, 564 based on Foata normal form. 80/3243 useless extension candidates. Maximal degree in co-relation 12899. Up to 1344 conditions per place. [2022-11-25 17:24:02,525 INFO L137 encePairwiseOnDemand]: 238/249 looper letters, 46 selfloop transitions, 14 changer transitions 31/92 dead transitions. [2022-11-25 17:24:02,525 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 92 transitions, 873 flow [2022-11-25 17:24:02,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:24:02,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:24:02,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 660 transitions. [2022-11-25 17:24:02,528 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44176706827309237 [2022-11-25 17:24:02,528 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 660 transitions. [2022-11-25 17:24:02,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 660 transitions. [2022-11-25 17:24:02,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:02,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 660 transitions. [2022-11-25 17:24:02,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.0) internal successors, (660), 6 states have internal predecessors, (660), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:02,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:02,535 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:02,535 INFO L175 Difference]: Start difference. First operand has 54 places, 47 transitions, 404 flow. Second operand 6 states and 660 transitions. [2022-11-25 17:24:02,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 92 transitions, 873 flow [2022-11-25 17:24:02,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 92 transitions, 849 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-11-25 17:24:02,578 INFO L231 Difference]: Finished difference. Result has 56 places, 40 transitions, 344 flow [2022-11-25 17:24:02,579 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=344, PETRI_PLACES=56, PETRI_TRANSITIONS=40} [2022-11-25 17:24:02,579 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 15 predicate places. [2022-11-25 17:24:02,579 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 40 transitions, 344 flow [2022-11-25 17:24:02,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:02,580 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:02,580 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:02,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:24:02,580 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:02,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash -986873507, now seen corresponding path program 2 times [2022-11-25 17:24:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:02,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485342664] [2022-11-25 17:24:02,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:02,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:02,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:02,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:02,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485342664] [2022-11-25 17:24:02,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485342664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:02,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:02,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:24:02,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178584705] [2022-11-25 17:24:02,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:02,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:02,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:02,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:02,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:02,985 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 249 [2022-11-25 17:24:02,986 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 40 transitions, 344 flow. Second operand has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:02,986 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:02,986 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 249 [2022-11-25 17:24:02,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:03,536 INFO L130 PetriNetUnfolder]: 1306/2040 cut-off events. [2022-11-25 17:24:03,537 INFO L131 PetriNetUnfolder]: For 5668/5668 co-relation queries the response was YES. [2022-11-25 17:24:03,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8574 conditions, 2040 events. 1306/2040 cut-off events. For 5668/5668 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 10099 event pairs, 318 based on Foata normal form. 80/2120 useless extension candidates. Maximal degree in co-relation 8558. Up to 1069 conditions per place. [2022-11-25 17:24:03,554 INFO L137 encePairwiseOnDemand]: 239/249 looper letters, 37 selfloop transitions, 13 changer transitions 27/78 dead transitions. [2022-11-25 17:24:03,555 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 78 transitions, 763 flow [2022-11-25 17:24:03,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:24:03,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:24:03,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 651 transitions. [2022-11-25 17:24:03,558 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4357429718875502 [2022-11-25 17:24:03,558 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 651 transitions. [2022-11-25 17:24:03,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 651 transitions. [2022-11-25 17:24:03,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:03,559 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 651 transitions. [2022-11-25 17:24:03,560 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 108.5) internal successors, (651), 6 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:03,563 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:03,564 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:03,564 INFO L175 Difference]: Start difference. First operand has 56 places, 40 transitions, 344 flow. Second operand 6 states and 651 transitions. [2022-11-25 17:24:03,564 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 78 transitions, 763 flow [2022-11-25 17:24:03,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 78 transitions, 700 flow, removed 6 selfloop flow, removed 6 redundant places. [2022-11-25 17:24:03,574 INFO L231 Difference]: Finished difference. Result has 57 places, 37 transitions, 312 flow [2022-11-25 17:24:03,575 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=57, PETRI_TRANSITIONS=37} [2022-11-25 17:24:03,577 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2022-11-25 17:24:03,578 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 37 transitions, 312 flow [2022-11-25 17:24:03,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.16666666666667) internal successors, (607), 6 states have internal predecessors, (607), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:03,578 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:03,578 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:03,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:24:03,579 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:03,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:03,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1384832048, now seen corresponding path program 1 times [2022-11-25 17:24:03,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:03,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579889635] [2022-11-25 17:24:03,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:03,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:03,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:03,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:03,950 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579889635] [2022-11-25 17:24:03,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579889635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:03,950 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:03,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:03,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207011079] [2022-11-25 17:24:03,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:03,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:03,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:03,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:03,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:04,015 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 249 [2022-11-25 17:24:04,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 37 transitions, 312 flow. Second operand has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 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-11-25 17:24:04,016 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:04,016 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 249 [2022-11-25 17:24:04,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:04,413 INFO L130 PetriNetUnfolder]: 750/1205 cut-off events. [2022-11-25 17:24:04,414 INFO L131 PetriNetUnfolder]: For 2990/2990 co-relation queries the response was YES. [2022-11-25 17:24:04,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4870 conditions, 1205 events. 750/1205 cut-off events. For 2990/2990 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 5388 event pairs, 175 based on Foata normal form. 27/1232 useless extension candidates. Maximal degree in co-relation 4853. Up to 532 conditions per place. [2022-11-25 17:24:04,422 INFO L137 encePairwiseOnDemand]: 241/249 looper letters, 32 selfloop transitions, 6 changer transitions 32/71 dead transitions. [2022-11-25 17:24:04,423 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 71 transitions, 609 flow [2022-11-25 17:24:04,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:24:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:24:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 752 transitions. [2022-11-25 17:24:04,426 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4314400458978772 [2022-11-25 17:24:04,426 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 752 transitions. [2022-11-25 17:24:04,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 752 transitions. [2022-11-25 17:24:04,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:04,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 752 transitions. [2022-11-25 17:24:04,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.42857142857143) internal successors, (752), 7 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:04,433 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:04,434 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:04,435 INFO L175 Difference]: Start difference. First operand has 57 places, 37 transitions, 312 flow. Second operand 7 states and 752 transitions. [2022-11-25 17:24:04,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 71 transitions, 609 flow [2022-11-25 17:24:04,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 71 transitions, 559 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-11-25 17:24:04,444 INFO L231 Difference]: Finished difference. Result has 57 places, 30 transitions, 203 flow [2022-11-25 17:24:04,444 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=267, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=57, PETRI_TRANSITIONS=30} [2022-11-25 17:24:04,446 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 16 predicate places. [2022-11-25 17:24:04,446 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 30 transitions, 203 flow [2022-11-25 17:24:04,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 101.5) internal successors, (609), 6 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-11-25 17:24:04,449 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:04,449 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:04,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:24:04,451 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:04,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:04,451 INFO L85 PathProgramCache]: Analyzing trace with hash 1756676370, now seen corresponding path program 2 times [2022-11-25 17:24:04,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:04,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276643654] [2022-11-25 17:24:04,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:04,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:05,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:05,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:05,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276643654] [2022-11-25 17:24:05,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276643654] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:05,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:05,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:24:05,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698569509] [2022-11-25 17:24:05,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:05,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:05,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:05,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:05,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:05,077 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 249 [2022-11-25 17:24:05,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 30 transitions, 203 flow. Second operand has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:05,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:05,079 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 249 [2022-11-25 17:24:05,079 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:05,358 INFO L130 PetriNetUnfolder]: 462/748 cut-off events. [2022-11-25 17:24:05,358 INFO L131 PetriNetUnfolder]: For 1600/1600 co-relation queries the response was YES. [2022-11-25 17:24:05,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2726 conditions, 748 events. 462/748 cut-off events. For 1600/1600 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2766 event pairs, 251 based on Foata normal form. 36/784 useless extension candidates. Maximal degree in co-relation 2709. Up to 624 conditions per place. [2022-11-25 17:24:05,364 INFO L137 encePairwiseOnDemand]: 242/249 looper letters, 32 selfloop transitions, 8 changer transitions 11/54 dead transitions. [2022-11-25 17:24:05,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 54 transitions, 430 flow [2022-11-25 17:24:05,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:24:05,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:24:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 688 transitions. [2022-11-25 17:24:05,367 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4605087014725569 [2022-11-25 17:24:05,368 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 688 transitions. [2022-11-25 17:24:05,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 688 transitions. [2022-11-25 17:24:05,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:05,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 688 transitions. [2022-11-25 17:24:05,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.66666666666667) internal successors, (688), 6 states have internal predecessors, (688), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:05,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:05,374 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 249.0) internal successors, (1743), 7 states have internal predecessors, (1743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:05,374 INFO L175 Difference]: Start difference. First operand has 57 places, 30 transitions, 203 flow. Second operand 6 states and 688 transitions. [2022-11-25 17:24:05,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 54 transitions, 430 flow [2022-11-25 17:24:05,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 54 transitions, 372 flow, removed 20 selfloop flow, removed 8 redundant places. [2022-11-25 17:24:05,379 INFO L231 Difference]: Finished difference. Result has 53 places, 33 transitions, 215 flow [2022-11-25 17:24:05,379 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=215, PETRI_PLACES=53, PETRI_TRANSITIONS=33} [2022-11-25 17:24:05,380 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2022-11-25 17:24:05,380 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 33 transitions, 215 flow [2022-11-25 17:24:05,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.16666666666667) internal successors, (655), 6 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:05,381 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:05,381 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:05,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:24:05,382 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:05,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:05,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1026393618, now seen corresponding path program 1 times [2022-11-25 17:24:05,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:05,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704973888] [2022-11-25 17:24:05,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:05,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:05,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:05,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:05,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704973888] [2022-11-25 17:24:05,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704973888] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:05,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:05,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:05,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378194598] [2022-11-25 17:24:05,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:05,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:05,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:05,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:05,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:05,587 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 249 [2022-11-25 17:24:05,588 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 33 transitions, 215 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:05,588 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:05,588 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 249 [2022-11-25 17:24:05,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:05,795 INFO L130 PetriNetUnfolder]: 308/531 cut-off events. [2022-11-25 17:24:05,796 INFO L131 PetriNetUnfolder]: For 1827/1847 co-relation queries the response was YES. [2022-11-25 17:24:05,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2108 conditions, 531 events. 308/531 cut-off events. For 1827/1847 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2177 event pairs, 61 based on Foata normal form. 63/581 useless extension candidates. Maximal degree in co-relation 2093. Up to 340 conditions per place. [2022-11-25 17:24:05,799 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 34 selfloop transitions, 6 changer transitions 18/63 dead transitions. [2022-11-25 17:24:05,800 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 63 transitions, 537 flow [2022-11-25 17:24:05,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:24:05,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:24:05,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2022-11-25 17:24:05,802 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4650602409638554 [2022-11-25 17:24:05,802 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 579 transitions. [2022-11-25 17:24:05,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 579 transitions. [2022-11-25 17:24:05,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:05,803 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 579 transitions. [2022-11-25 17:24:05,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:05,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:05,808 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:05,808 INFO L175 Difference]: Start difference. First operand has 53 places, 33 transitions, 215 flow. Second operand 5 states and 579 transitions. [2022-11-25 17:24:05,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 63 transitions, 537 flow [2022-11-25 17:24:05,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 514 flow, removed 1 selfloop flow, removed 5 redundant places. [2022-11-25 17:24:05,811 INFO L231 Difference]: Finished difference. Result has 53 places, 35 transitions, 232 flow [2022-11-25 17:24:05,811 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=182, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=232, PETRI_PLACES=53, PETRI_TRANSITIONS=35} [2022-11-25 17:24:05,812 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 12 predicate places. [2022-11-25 17:24:05,812 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 35 transitions, 232 flow [2022-11-25 17:24:05,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:05,813 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:05,813 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:05,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:24:05,813 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:05,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:05,814 INFO L85 PathProgramCache]: Analyzing trace with hash 25268003, now seen corresponding path program 1 times [2022-11-25 17:24:05,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:05,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636479458] [2022-11-25 17:24:05,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:05,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:05,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:06,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:06,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:06,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636479458] [2022-11-25 17:24:06,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636479458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:06,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:06,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:24:06,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675400286] [2022-11-25 17:24:06,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:06,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:24:06,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:06,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:24:06,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:06,034 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 249 [2022-11-25 17:24:06,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 35 transitions, 232 flow. Second operand has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:06,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:06,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 249 [2022-11-25 17:24:06,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:06,238 INFO L130 PetriNetUnfolder]: 170/335 cut-off events. [2022-11-25 17:24:06,239 INFO L131 PetriNetUnfolder]: For 1314/1326 co-relation queries the response was YES. [2022-11-25 17:24:06,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1547 conditions, 335 events. 170/335 cut-off events. For 1314/1326 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1318 event pairs, 19 based on Foata normal form. 37/368 useless extension candidates. Maximal degree in co-relation 1530. Up to 152 conditions per place. [2022-11-25 17:24:06,241 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 37 selfloop transitions, 10 changer transitions 23/75 dead transitions. [2022-11-25 17:24:06,242 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 75 transitions, 682 flow [2022-11-25 17:24:06,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:24:06,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:24:06,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 804 transitions. [2022-11-25 17:24:06,245 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4612736660929432 [2022-11-25 17:24:06,245 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 804 transitions. [2022-11-25 17:24:06,245 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 804 transitions. [2022-11-25 17:24:06,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:06,246 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 804 transitions. [2022-11-25 17:24:06,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:06,251 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:06,252 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 249.0) internal successors, (1992), 8 states have internal predecessors, (1992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:06,252 INFO L175 Difference]: Start difference. First operand has 53 places, 35 transitions, 232 flow. Second operand 7 states and 804 transitions. [2022-11-25 17:24:06,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 75 transitions, 682 flow [2022-11-25 17:24:06,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 75 transitions, 682 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:24:06,256 INFO L231 Difference]: Finished difference. Result has 62 places, 38 transitions, 287 flow [2022-11-25 17:24:06,257 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=287, PETRI_PLACES=62, PETRI_TRANSITIONS=38} [2022-11-25 17:24:06,257 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 21 predicate places. [2022-11-25 17:24:06,257 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 38 transitions, 287 flow [2022-11-25 17:24:06,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.0) internal successors, (545), 5 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:06,258 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:06,258 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-11-25 17:24:06,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:24:06,259 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:06,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:06,259 INFO L85 PathProgramCache]: Analyzing trace with hash -121256498, now seen corresponding path program 1 times [2022-11-25 17:24:06,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:06,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022272298] [2022-11-25 17:24:06,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:06,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:06,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:06,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:06,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022272298] [2022-11-25 17:24:06,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022272298] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:06,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:06,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:06,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071572471] [2022-11-25 17:24:06,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:06,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:06,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:06,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:06,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:06,521 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 249 [2022-11-25 17:24:06,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 38 transitions, 287 flow. Second operand has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:06,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:06,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 249 [2022-11-25 17:24:06,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:06,750 INFO L130 PetriNetUnfolder]: 133/261 cut-off events. [2022-11-25 17:24:06,750 INFO L131 PetriNetUnfolder]: For 1391/1405 co-relation queries the response was YES. [2022-11-25 17:24:06,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1378 conditions, 261 events. 133/261 cut-off events. For 1391/1405 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1029 event pairs, 8 based on Foata normal form. 16/272 useless extension candidates. Maximal degree in co-relation 1357. Up to 132 conditions per place. [2022-11-25 17:24:06,753 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 34 selfloop transitions, 13 changer transitions 21/73 dead transitions. [2022-11-25 17:24:06,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 73 transitions, 727 flow [2022-11-25 17:24:06,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 17:24:06,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 17:24:06,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1014 transitions. [2022-11-25 17:24:06,758 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4524765729585007 [2022-11-25 17:24:06,758 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1014 transitions. [2022-11-25 17:24:06,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1014 transitions. [2022-11-25 17:24:06,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:06,759 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1014 transitions. [2022-11-25 17:24:06,762 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 112.66666666666667) internal successors, (1014), 9 states have internal predecessors, (1014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:06,766 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:06,768 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 249.0) internal successors, (2490), 10 states have internal predecessors, (2490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:06,768 INFO L175 Difference]: Start difference. First operand has 62 places, 38 transitions, 287 flow. Second operand 9 states and 1014 transitions. [2022-11-25 17:24:06,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 73 transitions, 727 flow [2022-11-25 17:24:06,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 73 transitions, 672 flow, removed 18 selfloop flow, removed 6 redundant places. [2022-11-25 17:24:06,774 INFO L231 Difference]: Finished difference. Result has 66 places, 38 transitions, 285 flow [2022-11-25 17:24:06,774 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=247, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=285, PETRI_PLACES=66, PETRI_TRANSITIONS=38} [2022-11-25 17:24:06,775 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 25 predicate places. [2022-11-25 17:24:06,775 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 38 transitions, 285 flow [2022-11-25 17:24:06,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.83333333333333) internal successors, (653), 6 states have internal predecessors, (653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:06,775 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:06,776 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-11-25 17:24:06,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:24:06,776 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:06,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:06,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1389415792, now seen corresponding path program 1 times [2022-11-25 17:24:06,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:06,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384869204] [2022-11-25 17:24:06,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:06,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:07,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:07,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:07,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384869204] [2022-11-25 17:24:07,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384869204] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:07,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:07,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 17:24:07,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618656970] [2022-11-25 17:24:07,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:07,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:24:07,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:07,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:24:07,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:24:07,849 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 249 [2022-11-25 17:24:07,850 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 38 transitions, 285 flow. Second operand has 8 states, 8 states have (on average 108.5) internal successors, (868), 8 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:07,850 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:07,850 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 249 [2022-11-25 17:24:07,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:08,038 INFO L130 PetriNetUnfolder]: 174/347 cut-off events. [2022-11-25 17:24:08,038 INFO L131 PetriNetUnfolder]: For 1361/1364 co-relation queries the response was YES. [2022-11-25 17:24:08,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1790 conditions, 347 events. 174/347 cut-off events. For 1361/1364 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1409 event pairs, 53 based on Foata normal form. 3/349 useless extension candidates. Maximal degree in co-relation 1769. Up to 246 conditions per place. [2022-11-25 17:24:08,040 INFO L137 encePairwiseOnDemand]: 243/249 looper letters, 38 selfloop transitions, 5 changer transitions 10/56 dead transitions. [2022-11-25 17:24:08,041 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 56 transitions, 551 flow [2022-11-25 17:24:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:24:08,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:24:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 560 transitions. [2022-11-25 17:24:08,043 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4497991967871486 [2022-11-25 17:24:08,043 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 560 transitions. [2022-11-25 17:24:08,044 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 560 transitions. [2022-11-25 17:24:08,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:08,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 560 transitions. [2022-11-25 17:24:08,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 112.0) internal successors, (560), 5 states have internal predecessors, (560), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:08,048 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:08,048 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 249.0) internal successors, (1494), 6 states have internal predecessors, (1494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:08,049 INFO L175 Difference]: Start difference. First operand has 66 places, 38 transitions, 285 flow. Second operand 5 states and 560 transitions. [2022-11-25 17:24:08,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 56 transitions, 551 flow [2022-11-25 17:24:08,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 56 transitions, 430 flow, removed 40 selfloop flow, removed 9 redundant places. [2022-11-25 17:24:08,054 INFO L231 Difference]: Finished difference. Result has 61 places, 39 transitions, 245 flow [2022-11-25 17:24:08,055 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=219, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=245, PETRI_PLACES=61, PETRI_TRANSITIONS=39} [2022-11-25 17:24:08,055 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 20 predicate places. [2022-11-25 17:24:08,055 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 39 transitions, 245 flow [2022-11-25 17:24:08,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.5) internal successors, (868), 8 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:08,056 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:08,056 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-11-25 17:24:08,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:24:08,057 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:08,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:08,057 INFO L85 PathProgramCache]: Analyzing trace with hash 610899546, now seen corresponding path program 2 times [2022-11-25 17:24:08,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:08,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686793356] [2022-11-25 17:24:08,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:08,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:09,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:09,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:24:09,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686793356] [2022-11-25 17:24:09,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686793356] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:09,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:09,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:24:09,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842663095] [2022-11-25 17:24:09,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:09,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:24:09,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:24:09,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:24:09,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:09,308 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 249 [2022-11-25 17:24:09,310 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 39 transitions, 245 flow. Second operand has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:09,310 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:09,310 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 249 [2022-11-25 17:24:09,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:09,713 INFO L130 PetriNetUnfolder]: 213/460 cut-off events. [2022-11-25 17:24:09,713 INFO L131 PetriNetUnfolder]: For 986/986 co-relation queries the response was YES. [2022-11-25 17:24:09,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1982 conditions, 460 events. 213/460 cut-off events. For 986/986 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 2176 event pairs, 77 based on Foata normal form. 1/461 useless extension candidates. Maximal degree in co-relation 1964. Up to 200 conditions per place. [2022-11-25 17:24:09,716 INFO L137 encePairwiseOnDemand]: 240/249 looper letters, 45 selfloop transitions, 6 changer transitions 31/84 dead transitions. [2022-11-25 17:24:09,717 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 84 transitions, 667 flow [2022-11-25 17:24:09,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:09,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:24:09,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 884 transitions. [2022-11-25 17:24:09,720 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44377510040160645 [2022-11-25 17:24:09,720 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 884 transitions. [2022-11-25 17:24:09,720 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 884 transitions. [2022-11-25 17:24:09,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:09,721 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 884 transitions. [2022-11-25 17:24:09,724 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 110.5) internal successors, (884), 8 states have internal predecessors, (884), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:09,728 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 249.0) internal successors, (2241), 9 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:09,729 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 249.0) internal successors, (2241), 9 states have internal predecessors, (2241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:09,729 INFO L175 Difference]: Start difference. First operand has 61 places, 39 transitions, 245 flow. Second operand 8 states and 884 transitions. [2022-11-25 17:24:09,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 84 transitions, 667 flow [2022-11-25 17:24:09,733 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 84 transitions, 643 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-11-25 17:24:09,735 INFO L231 Difference]: Finished difference. Result has 68 places, 35 transitions, 227 flow [2022-11-25 17:24:09,735 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=227, PETRI_PLACES=68, PETRI_TRANSITIONS=35} [2022-11-25 17:24:09,736 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 27 predicate places. [2022-11-25 17:24:09,737 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 35 transitions, 227 flow [2022-11-25 17:24:09,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 106.0) internal successors, (1060), 10 states have internal predecessors, (1060), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:09,738 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:09,738 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-11-25 17:24:09,738 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:24:09,738 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:09,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:09,739 INFO L85 PathProgramCache]: Analyzing trace with hash 587723182, now seen corresponding path program 3 times [2022-11-25 17:24:09,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:24:09,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242794891] [2022-11-25 17:24:09,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:09,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:24:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:24:09,822 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:24:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:24:09,937 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:24:09,940 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:24:09,943 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-25 17:24:09,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-25 17:24:09,945 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-25 17:24:09,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-25 17:24:09,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-25 17:24:09,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-25 17:24:09,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-25 17:24:09,946 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-25 17:24:09,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-25 17:24:09,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-25 17:24:09,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-25 17:24:09,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-25 17:24:09,947 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-25 17:24:09,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:24:09,948 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:09,954 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:24:09,954 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:24:10,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:24:10 BasicIcfg [2022-11-25 17:24:10,051 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:24:10,052 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:24:10,052 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:24:10,053 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:24:10,053 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:23:48" (3/4) ... [2022-11-25 17:24:10,056 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:24:10,056 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:24:10,056 INFO L158 Benchmark]: Toolchain (without parser) took 22984.84ms. Allocated memory was 121.6MB in the beginning and 423.6MB in the end (delta: 302.0MB). Free memory was 55.0MB in the beginning and 298.8MB in the end (delta: -243.8MB). Peak memory consumption was 60.1MB. Max. memory is 16.1GB. [2022-11-25 17:24:10,057 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 121.6MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:24:10,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 690.78ms. Allocated memory was 121.6MB in the beginning and 157.3MB in the end (delta: 35.7MB). Free memory was 54.9MB in the beginning and 111.0MB in the end (delta: -56.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-25 17:24:10,058 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.13ms. Allocated memory is still 157.3MB. Free memory was 111.0MB in the beginning and 107.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:24:10,058 INFO L158 Benchmark]: Boogie Preprocessor took 66.15ms. Allocated memory is still 157.3MB. Free memory was 107.9MB in the beginning and 106.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:24:10,058 INFO L158 Benchmark]: RCFGBuilder took 904.26ms. Allocated memory is still 157.3MB. Free memory was 106.3MB in the beginning and 125.5MB in the end (delta: -19.2MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. [2022-11-25 17:24:10,059 INFO L158 Benchmark]: TraceAbstraction took 21260.80ms. Allocated memory was 157.3MB in the beginning and 423.6MB in the end (delta: 266.3MB). Free memory was 125.5MB in the beginning and 298.8MB in the end (delta: -173.3MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. [2022-11-25 17:24:10,059 INFO L158 Benchmark]: Witness Printer took 3.88ms. Allocated memory is still 423.6MB. Free memory is still 298.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:24:10,061 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 121.6MB. Free memory is still 96.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 690.78ms. Allocated memory was 121.6MB in the beginning and 157.3MB in the end (delta: 35.7MB). Free memory was 54.9MB in the beginning and 111.0MB in the end (delta: -56.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.13ms. Allocated memory is still 157.3MB. Free memory was 111.0MB in the beginning and 107.9MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.15ms. Allocated memory is still 157.3MB. Free memory was 107.9MB in the beginning and 106.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 904.26ms. Allocated memory is still 157.3MB. Free memory was 106.3MB in the beginning and 125.5MB in the end (delta: -19.2MB). Peak memory consumption was 43.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21260.80ms. Allocated memory was 157.3MB in the beginning and 423.6MB in the end (delta: 266.3MB). Free memory was 125.5MB in the beginning and 298.8MB in the end (delta: -173.3MB). Peak memory consumption was 92.8MB. Max. memory is 16.1GB. * Witness Printer took 3.88ms. Allocated memory is still 423.6MB. Free memory is still 298.8MB. 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: 5.7s, 129 PlacesBefore, 41 PlacesAfterwards, 121 TransitionsBefore, 32 TransitionsAfterwards, 2302 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 62 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 9 ConcurrentYvCompositions, 1 ChoiceCompositions, 125 TotalNumberOfCompositions, 5648 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2777, independent: 2633, independent conditional: 0, independent unconditional: 2633, dependent: 144, dependent conditional: 0, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1671, independent: 1623, independent conditional: 0, independent unconditional: 1623, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1671, independent: 1606, independent conditional: 0, independent unconditional: 1606, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 65, independent: 17, independent conditional: 0, independent unconditional: 17, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 448, independent: 22, independent conditional: 0, independent unconditional: 22, dependent: 426, dependent conditional: 0, dependent unconditional: 426, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2777, independent: 1010, independent conditional: 0, independent unconditional: 1010, dependent: 96, dependent conditional: 0, dependent unconditional: 96, unknown: 1671, unknown conditional: 0, unknown unconditional: 1671] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 131, Positive conditional cache size: 0, Positive unconditional cache size: 131, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1804; [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1804, ((void *)0), P0, ((void *)0))=-1, t1804={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1805; [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1805, ((void *)0), P1, ((void *)0))=0, t1804={5:0}, t1805={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1806; [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1806, ((void *)0), P2, ((void *)0))=1, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={5:0}, t1805={6:0}, t1806={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - 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: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 823]: 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: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 151 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 21.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 8.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1066 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 839 mSDsluCounter, 728 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 563 mSDsCounter, 193 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2047 IncrementalHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 193 mSolverCounterUnsat, 165 mSDtfsCounter, 2047 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=404occurred in iteration=6, InterpolantAutomatonStates: 90, 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.6s SatisfiabilityAnalysisTime, 6.0s InterpolantComputationTime, 225 NumberOfCodeBlocks, 225 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 188 ConstructedInterpolants, 0 QuantifiedInterpolants, 2093 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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-11-25 17:24:10,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R --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 a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:24:12,671 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:24:12,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:24:12,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:24:12,728 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:24:12,729 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:24:12,731 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:24:12,733 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:24:12,735 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:24:12,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:24:12,737 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:24:12,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:24:12,739 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:24:12,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:24:12,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:24:12,742 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:24:12,743 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:24:12,744 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:24:12,746 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:24:12,748 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:24:12,749 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:24:12,751 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:24:12,752 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:24:12,753 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:24:12,757 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:24:12,757 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:24:12,758 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:24:12,759 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:24:12,759 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:24:12,760 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:24:12,761 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:24:12,762 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:24:12,763 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:24:12,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:24:12,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:24:12,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:24:12,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:24:12,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:24:12,767 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:24:12,768 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:24:12,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:24:12,769 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 17:24:12,791 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:24:12,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:24:12,792 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:24:12,792 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:24:12,793 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:24:12,793 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:24:12,794 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:24:12,795 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:24:12,795 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:24:12,795 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:24:12,796 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:24:12,796 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:24:12,796 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:24:12,796 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:24:12,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:24:12,797 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 17:24:12,797 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 17:24:12,797 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 17:24:12,798 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:24:12,798 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 17:24:12,798 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 17:24:12,799 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 17:24:12,799 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:24:12,799 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:24:12,799 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:24:12,800 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:24:12,800 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:24:12,800 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:24:12,801 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:24:12,801 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:24:12,801 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 17:24:12,801 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 17:24:12,802 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:24:12,802 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:24:12,802 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:24:12,803 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 17:24:12,803 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_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> a843579fcb7bb5d5833d499f834986a668bfbdfa4c59a86e5d344f532fcebd9f [2022-11-25 17:24:13,202 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:24:13,228 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:24:13,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:24:13,232 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:24:13,235 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:24:13,237 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-25 17:24:16,660 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:24:16,918 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:24:16,919 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-25 17:24:16,932 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/data/4e350f82e/327ae664a9324e43bcfb9ed939f5d5a1/FLAG231e0712a [2022-11-25 17:24:16,953 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/data/4e350f82e/327ae664a9324e43bcfb9ed939f5d5a1 [2022-11-25 17:24:16,955 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:24:16,957 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:24:16,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:24:16,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:24:16,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:24:16,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:24:16" (1/1) ... [2022-11-25 17:24:16,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70cde8b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:24:16, skipping insertion in model container [2022-11-25 17:24:16,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:24:16" (1/1) ... [2022-11-25 17:24:16,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:24:17,012 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:24:17,195 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_f3d06774-a329-4c1a-b284-b6ee1a44e502/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2022-11-25 17:24:17,425 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,427 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,428 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,452 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,461 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,466 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,476 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,477 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,482 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,483 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,484 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,485 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,490 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,491 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,492 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,501 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,504 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,505 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,511 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,512 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:24:17,546 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:24:17,559 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_f3d06774-a329-4c1a-b284-b6ee1a44e502/sv-benchmarks/c/pthread-wmm/safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i[976,989] [2022-11-25 17:24:17,580 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,581 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,582 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,584 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,585 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,586 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,587 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,589 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,590 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,591 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,592 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,593 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,594 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,598 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,599 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,601 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 17:24:17,606 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 17:24:17,607 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:24:17,649 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:24:17,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:24:17 WrapperNode [2022-11-25 17:24:17,650 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:24:17,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:24:17,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:24:17,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:24:17,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:24:17" (1/1) ... [2022-11-25 17:24:17,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:24:17" (1/1) ... [2022-11-25 17:24:17,729 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-11-25 17:24:17,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:24:17,738 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:24:17,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:24:17,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:24:17,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:24:17" (1/1) ... [2022-11-25 17:24:17,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:24:17" (1/1) ... [2022-11-25 17:24:17,764 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:24:17" (1/1) ... [2022-11-25 17:24:17,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:24:17" (1/1) ... [2022-11-25 17:24:17,779 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:24:17" (1/1) ... [2022-11-25 17:24:17,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:24:17" (1/1) ... [2022-11-25 17:24:17,788 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:24:17" (1/1) ... [2022-11-25 17:24:17,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:24:17" (1/1) ... [2022-11-25 17:24:17,794 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:24:17,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:24:17,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:24:17,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:24:17,807 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:24:17" (1/1) ... [2022-11-25 17:24:17,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:24:17,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:24:17,841 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:24:17,853 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:24:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 17:24:17,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:24:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 17:24:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 17:24:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 17:24:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 17:24:17,888 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 17:24:17,888 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 17:24:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 17:24:17,889 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 17:24:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 17:24:17,889 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 17:24:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 17:24:17,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:24:17,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:24:17,891 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 17:24:18,124 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:24:18,125 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:24:18,487 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:24:18,753 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:24:18,753 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:24:18,756 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:24:18 BoogieIcfgContainer [2022-11-25 17:24:18,756 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:24:18,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:24:18,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:24:18,765 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:24:18,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:24:16" (1/3) ... [2022-11-25 17:24:18,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123c4c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:24:18, skipping insertion in model container [2022-11-25 17:24:18,768 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:24:17" (2/3) ... [2022-11-25 17:24:18,768 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@123c4c54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:24:18, skipping insertion in model container [2022-11-25 17:24:18,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:24:18" (3/3) ... [2022-11-25 17:24:18,774 INFO L112 eAbstractionObserver]: Analyzing ICFG safe001_power.opt_pso.oepc_pso.opt_rmo.opt.i [2022-11-25 17:24:18,795 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:24:18,795 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-25 17:24:18,796 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 17:24:18,872 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 17:24:18,928 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-11-25 17:24:19,016 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-11-25 17:24:19,016 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:24:19,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-25 17:24:19,024 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-11-25 17:24:19,033 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2022-11-25 17:24:19,039 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 17:24:19,064 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2022-11-25 17:24:19,080 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2022-11-25 17:24:19,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2022-11-25 17:24:19,125 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-11-25 17:24:19,126 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:24:19,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-11-25 17:24:19,130 INFO L119 LiptonReduction]: Number of co-enabled transitions 2302 [2022-11-25 17:24:28,559 INFO L134 LiptonReduction]: Checked pairs total: 6093 [2022-11-25 17:24:28,560 INFO L136 LiptonReduction]: Total number of compositions: 123 [2022-11-25 17:24:28,576 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:24:28,583 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;@705de067, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:24:28,583 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-25 17:24:28,584 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 17:24:28,585 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:24:28,585 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:28,586 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 17:24:28,586 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:28,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:28,592 INFO L85 PathProgramCache]: Analyzing trace with hash 540, now seen corresponding path program 1 times [2022-11-25 17:24:28,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:28,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [614921180] [2022-11-25 17:24:28,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:28,606 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-11-25 17:24:28,606 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:28,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:28,623 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:28,693 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:24:28,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:28,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-11-25 17:24:28,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:28,703 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:28,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [614921180] [2022-11-25 17:24:28,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [614921180] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:28,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:28,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 17:24:28,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733750717] [2022-11-25 17:24:28,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:28,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:24:28,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:28,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:24:28,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:24:28,738 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 248 [2022-11-25 17:24:28,740 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 32 transitions, 73 flow. Second operand has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:28,740 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:28,741 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 248 [2022-11-25 17:24:28,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:29,318 INFO L130 PetriNetUnfolder]: 1277/1907 cut-off events. [2022-11-25 17:24:29,318 INFO L131 PetriNetUnfolder]: For 11/11 co-relation queries the response was YES. [2022-11-25 17:24:29,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3848 conditions, 1907 events. 1277/1907 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 119. Compared 9027 event pairs, 1277 based on Foata normal form. 0/1603 useless extension candidates. Maximal degree in co-relation 3837. Up to 1887 conditions per place. [2022-11-25 17:24:29,338 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 22 selfloop transitions, 0 changer transitions 0/25 dead transitions. [2022-11-25 17:24:29,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 25 transitions, 103 flow [2022-11-25 17:24:29,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:24:29,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 17:24:29,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 253 transitions. [2022-11-25 17:24:29,352 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5100806451612904 [2022-11-25 17:24:29,353 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 253 transitions. [2022-11-25 17:24:29,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 253 transitions. [2022-11-25 17:24:29,354 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:29,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 253 transitions. [2022-11-25 17:24:29,359 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:29,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:29,366 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:29,368 INFO L175 Difference]: Start difference. First operand has 41 places, 32 transitions, 73 flow. Second operand 2 states and 253 transitions. [2022-11-25 17:24:29,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 25 transitions, 103 flow [2022-11-25 17:24:29,373 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 25 transitions, 100 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 17:24:29,374 INFO L231 Difference]: Finished difference. Result has 33 places, 25 transitions, 56 flow [2022-11-25 17:24:29,377 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=56, PETRI_PLACES=33, PETRI_TRANSITIONS=25} [2022-11-25 17:24:29,380 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -8 predicate places. [2022-11-25 17:24:29,381 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 25 transitions, 56 flow [2022-11-25 17:24:29,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:29,381 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:29,381 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 17:24:29,398 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:29,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:29,593 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:29,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:29,594 INFO L85 PathProgramCache]: Analyzing trace with hash 512522276, now seen corresponding path program 1 times [2022-11-25 17:24:29,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:29,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2014960192] [2022-11-25 17:24:29,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:29,595 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-11-25 17:24:29,595 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:29,598 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:29,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:29,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:24:29,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:29,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:29,732 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:29,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:29,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2014960192] [2022-11-25 17:24:29,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2014960192] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:29,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:29,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 17:24:29,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844462235] [2022-11-25 17:24:29,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:29,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:24:29,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:29,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:24:29,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:24:29,754 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 248 [2022-11-25 17:24:29,755 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 25 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:29,755 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:29,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 248 [2022-11-25 17:24:29,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:30,189 INFO L130 PetriNetUnfolder]: 999/1558 cut-off events. [2022-11-25 17:24:30,190 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 17:24:30,192 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3091 conditions, 1558 events. 999/1558 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 7557 event pairs, 277 based on Foata normal form. 0/1425 useless extension candidates. Maximal degree in co-relation 3088. Up to 1195 conditions per place. [2022-11-25 17:24:30,200 INFO L137 encePairwiseOnDemand]: 245/248 looper letters, 31 selfloop transitions, 2 changer transitions 2/38 dead transitions. [2022-11-25 17:24:30,200 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 38 transitions, 154 flow [2022-11-25 17:24:30,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:24:30,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 17:24:30,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 369 transitions. [2022-11-25 17:24:30,207 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4959677419354839 [2022-11-25 17:24:30,207 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 369 transitions. [2022-11-25 17:24:30,208 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 369 transitions. [2022-11-25 17:24:30,209 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:30,209 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 369 transitions. [2022-11-25 17:24:30,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:30,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:30,217 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:30,217 INFO L175 Difference]: Start difference. First operand has 33 places, 25 transitions, 56 flow. Second operand 3 states and 369 transitions. [2022-11-25 17:24:30,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 38 transitions, 154 flow [2022-11-25 17:24:30,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 38 transitions, 154 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 17:24:30,219 INFO L231 Difference]: Finished difference. Result has 34 places, 23 transitions, 56 flow [2022-11-25 17:24:30,219 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=56, PETRI_PLACES=34, PETRI_TRANSITIONS=23} [2022-11-25 17:24:30,221 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -7 predicate places. [2022-11-25 17:24:30,222 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 23 transitions, 56 flow [2022-11-25 17:24:30,222 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:30,222 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:30,222 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:30,238 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:30,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:30,432 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:30,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1964704074, now seen corresponding path program 1 times [2022-11-25 17:24:30,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:30,433 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144791294] [2022-11-25 17:24:30,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:30,434 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-11-25 17:24:30,434 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:30,435 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:30,443 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:30,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:24:30,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:30,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-11-25 17:24:30,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:30,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:30,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144791294] [2022-11-25 17:24:30,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144791294] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:30,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:30,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:30,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239564562] [2022-11-25 17:24:30,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:30,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:24:30,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:30,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:24:30,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:24:30,627 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 248 [2022-11-25 17:24:30,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 23 transitions, 56 flow. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:30,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:30,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 248 [2022-11-25 17:24:30,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:30,956 INFO L130 PetriNetUnfolder]: 557/928 cut-off events. [2022-11-25 17:24:30,957 INFO L131 PetriNetUnfolder]: For 72/72 co-relation queries the response was YES. [2022-11-25 17:24:30,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1961 conditions, 928 events. 557/928 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 4397 event pairs, 113 based on Foata normal form. 64/951 useless extension candidates. Maximal degree in co-relation 1957. Up to 633 conditions per place. [2022-11-25 17:24:30,962 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 29 selfloop transitions, 4 changer transitions 19/55 dead transitions. [2022-11-25 17:24:30,963 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 55 transitions, 234 flow [2022-11-25 17:24:30,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:24:30,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:24:30,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 589 transitions. [2022-11-25 17:24:30,966 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.475 [2022-11-25 17:24:30,967 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 589 transitions. [2022-11-25 17:24:30,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 589 transitions. [2022-11-25 17:24:30,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:30,968 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 589 transitions. [2022-11-25 17:24:30,969 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.8) internal successors, (589), 5 states have internal predecessors, (589), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:30,972 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:30,973 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:30,974 INFO L175 Difference]: Start difference. First operand has 34 places, 23 transitions, 56 flow. Second operand 5 states and 589 transitions. [2022-11-25 17:24:30,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 55 transitions, 234 flow [2022-11-25 17:24:30,975 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 55 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 17:24:30,977 INFO L231 Difference]: Finished difference. Result has 38 places, 26 transitions, 88 flow [2022-11-25 17:24:30,977 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=38, PETRI_TRANSITIONS=26} [2022-11-25 17:24:30,979 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, -3 predicate places. [2022-11-25 17:24:30,979 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 26 transitions, 88 flow [2022-11-25 17:24:30,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 4 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:30,980 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:30,980 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:30,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:31,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:31,193 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:31,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:31,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1089760419, now seen corresponding path program 1 times [2022-11-25 17:24:31,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:31,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [627521946] [2022-11-25 17:24:31,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:31,197 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-11-25 17:24:31,197 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:31,198 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:31,242 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:31,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:24:31,332 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:31,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:31,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:31,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:31,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [627521946] [2022-11-25 17:24:31,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [627521946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:31,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:31,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:24:31,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64919539] [2022-11-25 17:24:31,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:31,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:24:31,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:31,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:24:31,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:31,423 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 248 [2022-11-25 17:24:31,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 26 transitions, 88 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:31,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:31,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 248 [2022-11-25 17:24:31,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:31,752 INFO L130 PetriNetUnfolder]: 233/439 cut-off events. [2022-11-25 17:24:31,752 INFO L131 PetriNetUnfolder]: For 147/147 co-relation queries the response was YES. [2022-11-25 17:24:31,753 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1175 conditions, 439 events. 233/439 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1865 event pairs, 61 based on Foata normal form. 37/461 useless extension candidates. Maximal degree in co-relation 1168. Up to 140 conditions per place. [2022-11-25 17:24:31,755 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 37 selfloop transitions, 7 changer transitions 19/66 dead transitions. [2022-11-25 17:24:31,755 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 338 flow [2022-11-25 17:24:31,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:24:31,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 17:24:31,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 707 transitions. [2022-11-25 17:24:31,758 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47513440860215056 [2022-11-25 17:24:31,759 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 707 transitions. [2022-11-25 17:24:31,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 707 transitions. [2022-11-25 17:24:31,759 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:31,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 707 transitions. [2022-11-25 17:24:31,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 117.83333333333333) internal successors, (707), 6 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:31,765 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:31,766 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:31,766 INFO L175 Difference]: Start difference. First operand has 38 places, 26 transitions, 88 flow. Second operand 6 states and 707 transitions. [2022-11-25 17:24:31,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 338 flow [2022-11-25 17:24:31,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 66 transitions, 332 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 17:24:31,770 INFO L231 Difference]: Finished difference. Result has 42 places, 29 transitions, 138 flow [2022-11-25 17:24:31,771 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=138, PETRI_PLACES=42, PETRI_TRANSITIONS=29} [2022-11-25 17:24:31,773 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2022-11-25 17:24:31,773 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 29 transitions, 138 flow [2022-11-25 17:24:31,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:31,774 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:31,774 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:31,796 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:31,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:31,986 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:31,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:31,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1294009341, now seen corresponding path program 1 times [2022-11-25 17:24:31,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:31,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438457368] [2022-11-25 17:24:31,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:31,988 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-11-25 17:24:31,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:31,990 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:32,030 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:32,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:32,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 17:24:32,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:32,220 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:32,221 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:32,221 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438457368] [2022-11-25 17:24:32,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438457368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:32,221 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:32,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:24:32,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216512123] [2022-11-25 17:24:32,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:32,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 17:24:32,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:32,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 17:24:32,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 17:24:32,259 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 248 [2022-11-25 17:24:32,260 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 29 transitions, 138 flow. Second operand has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:32,260 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:32,261 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 248 [2022-11-25 17:24:32,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:32,585 INFO L130 PetriNetUnfolder]: 143/277 cut-off events. [2022-11-25 17:24:32,585 INFO L131 PetriNetUnfolder]: For 269/269 co-relation queries the response was YES. [2022-11-25 17:24:32,586 INFO L83 FinitePrefix]: Finished finitePrefix Result has 810 conditions, 277 events. 143/277 cut-off events. For 269/269 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1061 event pairs, 56 based on Foata normal form. 10/281 useless extension candidates. Maximal degree in co-relation 801. Up to 108 conditions per place. [2022-11-25 17:24:32,587 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 34 selfloop transitions, 10 changer transitions 10/57 dead transitions. [2022-11-25 17:24:32,588 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 57 transitions, 336 flow [2022-11-25 17:24:32,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:24:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 17:24:32,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 805 transitions. [2022-11-25 17:24:32,591 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4637096774193548 [2022-11-25 17:24:32,592 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 805 transitions. [2022-11-25 17:24:32,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 805 transitions. [2022-11-25 17:24:32,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:32,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 805 transitions. [2022-11-25 17:24:32,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.0) internal successors, (805), 7 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:32,599 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:32,600 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:32,600 INFO L175 Difference]: Start difference. First operand has 42 places, 29 transitions, 138 flow. Second operand 7 states and 805 transitions. [2022-11-25 17:24:32,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 57 transitions, 336 flow [2022-11-25 17:24:32,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 57 transitions, 300 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-11-25 17:24:32,604 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 140 flow [2022-11-25 17:24:32,605 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=140, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2022-11-25 17:24:32,605 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2022-11-25 17:24:32,606 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 140 flow [2022-11-25 17:24:32,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:32,606 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:32,607 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-11-25 17:24:32,627 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:32,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:32,819 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:32,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:32,820 INFO L85 PathProgramCache]: Analyzing trace with hash -867993547, now seen corresponding path program 1 times [2022-11-25 17:24:32,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:32,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1726781486] [2022-11-25 17:24:32,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:32,821 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-11-25 17:24:32,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:32,822 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:32,826 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:32,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:24:32,981 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:33,244 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:33,245 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:33,245 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1726781486] [2022-11-25 17:24:33,245 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1726781486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:33,245 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:33,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:33,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425798276] [2022-11-25 17:24:33,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:33,246 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:24:33,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:33,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:24:33,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:33,262 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 248 [2022-11-25 17:24:33,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 140 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:33,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:33,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 248 [2022-11-25 17:24:33,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:33,518 INFO L130 PetriNetUnfolder]: 303/571 cut-off events. [2022-11-25 17:24:33,518 INFO L131 PetriNetUnfolder]: For 585/585 co-relation queries the response was YES. [2022-11-25 17:24:33,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1611 conditions, 571 events. 303/571 cut-off events. For 585/585 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2592 event pairs, 59 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 1601. Up to 248 conditions per place. [2022-11-25 17:24:33,523 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 54 selfloop transitions, 5 changer transitions 0/60 dead transitions. [2022-11-25 17:24:33,524 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 60 transitions, 402 flow [2022-11-25 17:24:33,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:24:33,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:24:33,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 578 transitions. [2022-11-25 17:24:33,527 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4661290322580645 [2022-11-25 17:24:33,527 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 578 transitions. [2022-11-25 17:24:33,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 578 transitions. [2022-11-25 17:24:33,528 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:33,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 578 transitions. [2022-11-25 17:24:33,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.6) internal successors, (578), 5 states have internal predecessors, (578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:33,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:33,533 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:33,534 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 140 flow. Second operand 5 states and 578 transitions. [2022-11-25 17:24:33,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 60 transitions, 402 flow [2022-11-25 17:24:33,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 60 transitions, 326 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-11-25 17:24:33,539 INFO L231 Difference]: Finished difference. Result has 44 places, 33 transitions, 138 flow [2022-11-25 17:24:33,540 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=138, PETRI_PLACES=44, PETRI_TRANSITIONS=33} [2022-11-25 17:24:33,540 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 3 predicate places. [2022-11-25 17:24:33,541 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 33 transitions, 138 flow [2022-11-25 17:24:33,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:33,541 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:33,542 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:33,560 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:33,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:33,755 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:33,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:33,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1392738927, now seen corresponding path program 1 times [2022-11-25 17:24:33,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:33,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1411315322] [2022-11-25 17:24:33,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:24:33,756 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-11-25 17:24:33,757 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:33,758 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:33,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:24:33,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2022-11-25 17:24:33,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:34,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:34,328 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:34,328 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:34,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1411315322] [2022-11-25 17:24:34,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1411315322] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:34,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:34,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:34,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897646443] [2022-11-25 17:24:34,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:34,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:24:34,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:34,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:24:34,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:34,778 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 248 [2022-11-25 17:24:34,778 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 33 transitions, 138 flow. Second operand has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:34,779 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:34,779 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 248 [2022-11-25 17:24:34,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:35,076 INFO L130 PetriNetUnfolder]: 229/456 cut-off events. [2022-11-25 17:24:35,077 INFO L131 PetriNetUnfolder]: For 265/265 co-relation queries the response was YES. [2022-11-25 17:24:35,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1307 conditions, 456 events. 229/456 cut-off events. For 265/265 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2143 event pairs, 78 based on Foata normal form. 2/453 useless extension candidates. Maximal degree in co-relation 1297. Up to 364 conditions per place. [2022-11-25 17:24:35,080 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 30 selfloop transitions, 3 changer transitions 6/44 dead transitions. [2022-11-25 17:24:35,080 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 265 flow [2022-11-25 17:24:35,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:24:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:24:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 509 transitions. [2022-11-25 17:24:35,083 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4104838709677419 [2022-11-25 17:24:35,083 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 509 transitions. [2022-11-25 17:24:35,083 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 509 transitions. [2022-11-25 17:24:35,084 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:35,084 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 509 transitions. [2022-11-25 17:24:35,085 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:35,087 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:35,088 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:35,088 INFO L175 Difference]: Start difference. First operand has 44 places, 33 transitions, 138 flow. Second operand 5 states and 509 transitions. [2022-11-25 17:24:35,088 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 265 flow [2022-11-25 17:24:35,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 262 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 17:24:35,091 INFO L231 Difference]: Finished difference. Result has 46 places, 30 transitions, 130 flow [2022-11-25 17:24:35,092 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=46, PETRI_TRANSITIONS=30} [2022-11-25 17:24:35,092 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 5 predicate places. [2022-11-25 17:24:35,093 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 30 transitions, 130 flow [2022-11-25 17:24:35,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:35,093 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:35,093 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-11-25 17:24:35,112 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:35,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:35,306 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:35,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:35,306 INFO L85 PathProgramCache]: Analyzing trace with hash -656587829, now seen corresponding path program 2 times [2022-11-25 17:24:35,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:35,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744563018] [2022-11-25 17:24:35,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:24:35,308 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-11-25 17:24:35,308 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:35,309 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:35,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:35,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:24:35,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:24:35,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:24:35,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:35,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:35,562 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:35,562 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:35,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [744563018] [2022-11-25 17:24:35,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [744563018] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:35,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:35,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:24:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905432637] [2022-11-25 17:24:35,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:35,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:24:35,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:35,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:24:35,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:35,593 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 248 [2022-11-25 17:24:35,593 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 30 transitions, 130 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:35,594 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:35,594 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 248 [2022-11-25 17:24:35,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:35,922 INFO L130 PetriNetUnfolder]: 243/496 cut-off events. [2022-11-25 17:24:35,923 INFO L131 PetriNetUnfolder]: For 363/363 co-relation queries the response was YES. [2022-11-25 17:24:35,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1422 conditions, 496 events. 243/496 cut-off events. For 363/363 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2357 event pairs, 40 based on Foata normal form. 3/499 useless extension candidates. Maximal degree in co-relation 1412. Up to 152 conditions per place. [2022-11-25 17:24:35,925 INFO L137 encePairwiseOnDemand]: 243/248 looper letters, 30 selfloop transitions, 2 changer transitions 50/83 dead transitions. [2022-11-25 17:24:35,926 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 83 transitions, 526 flow [2022-11-25 17:24:35,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:35,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:24:35,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 908 transitions. [2022-11-25 17:24:35,929 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4576612903225806 [2022-11-25 17:24:35,929 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 908 transitions. [2022-11-25 17:24:35,929 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 908 transitions. [2022-11-25 17:24:35,930 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:35,930 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 908 transitions. [2022-11-25 17:24:35,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.5) internal successors, (908), 8 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:35,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:35,937 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:35,937 INFO L175 Difference]: Start difference. First operand has 46 places, 30 transitions, 130 flow. Second operand 8 states and 908 transitions. [2022-11-25 17:24:35,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 83 transitions, 526 flow [2022-11-25 17:24:35,941 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 83 transitions, 502 flow, removed 5 selfloop flow, removed 6 redundant places. [2022-11-25 17:24:35,943 INFO L231 Difference]: Finished difference. Result has 52 places, 28 transitions, 127 flow [2022-11-25 17:24:35,944 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=127, PETRI_PLACES=52, PETRI_TRANSITIONS=28} [2022-11-25 17:24:35,946 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 11 predicate places. [2022-11-25 17:24:35,947 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 28 transitions, 127 flow [2022-11-25 17:24:35,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:35,947 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:35,948 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-11-25 17:24:35,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:36,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:36,160 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:36,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1041084263, now seen corresponding path program 3 times [2022-11-25 17:24:36,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:36,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330838216] [2022-11-25 17:24:36,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:24:36,161 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-11-25 17:24:36,161 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:36,163 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:36,168 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:36,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 17:24:36,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:24:36,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 17:24:36,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:36,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:24:36,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:36,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:36,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330838216] [2022-11-25 17:24:36,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330838216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:36,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:36,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:24:36,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630071692] [2022-11-25 17:24:36,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:36,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:24:36,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:36,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:24:36,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:24:36,522 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 248 [2022-11-25 17:24:36,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 28 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:36,523 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:36,523 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 248 [2022-11-25 17:24:36,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:36,690 INFO L130 PetriNetUnfolder]: 95/212 cut-off events. [2022-11-25 17:24:36,690 INFO L131 PetriNetUnfolder]: For 175/175 co-relation queries the response was YES. [2022-11-25 17:24:36,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 645 conditions, 212 events. 95/212 cut-off events. For 175/175 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 726 event pairs, 51 based on Foata normal form. 1/211 useless extension candidates. Maximal degree in co-relation 631. Up to 98 conditions per place. [2022-11-25 17:24:36,692 INFO L137 encePairwiseOnDemand]: 243/248 looper letters, 28 selfloop transitions, 3 changer transitions 16/48 dead transitions. [2022-11-25 17:24:36,692 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 48 transitions, 313 flow [2022-11-25 17:24:36,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:24:36,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 17:24:36,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-11-25 17:24:36,695 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45645161290322583 [2022-11-25 17:24:36,695 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 566 transitions. [2022-11-25 17:24:36,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 566 transitions. [2022-11-25 17:24:36,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:36,696 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 566 transitions. [2022-11-25 17:24:36,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:36,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:36,700 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:36,701 INFO L175 Difference]: Start difference. First operand has 52 places, 28 transitions, 127 flow. Second operand 5 states and 566 transitions. [2022-11-25 17:24:36,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 48 transitions, 313 flow [2022-11-25 17:24:36,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 48 transitions, 284 flow, removed 11 selfloop flow, removed 8 redundant places. [2022-11-25 17:24:36,703 INFO L231 Difference]: Finished difference. Result has 45 places, 28 transitions, 119 flow [2022-11-25 17:24:36,703 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=119, PETRI_PLACES=45, PETRI_TRANSITIONS=28} [2022-11-25 17:24:36,704 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 4 predicate places. [2022-11-25 17:24:36,704 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 28 transitions, 119 flow [2022-11-25 17:24:36,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.2) internal successors, (551), 5 states have internal predecessors, (551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:36,705 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:36,705 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-11-25 17:24:36,724 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:36,917 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:36,918 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:36,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:36,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1813429501, now seen corresponding path program 4 times [2022-11-25 17:24:36,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:36,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752227307] [2022-11-25 17:24:36,919 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:24:36,919 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-11-25 17:24:36,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:36,921 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:36,971 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:37,058 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:24:37,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:24:37,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-25 17:24:37,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:24:37,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-11-25 17:24:37,540 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:24:37,540 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 17:24:37,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752227307] [2022-11-25 17:24:37,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752227307] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:24:37,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:24:37,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:24:37,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518830918] [2022-11-25 17:24:37,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:24:37,541 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:24:37,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 17:24:37,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:24:37,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:24:37,700 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 248 [2022-11-25 17:24:37,702 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 28 transitions, 119 flow. Second operand has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:37,702 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 17:24:37,702 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 248 [2022-11-25 17:24:37,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 17:24:38,042 INFO L130 PetriNetUnfolder]: 75/164 cut-off events. [2022-11-25 17:24:38,043 INFO L131 PetriNetUnfolder]: For 126/126 co-relation queries the response was YES. [2022-11-25 17:24:38,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 164 events. 75/164 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 499 event pairs, 2 based on Foata normal form. 1/165 useless extension candidates. Maximal degree in co-relation 495. Up to 84 conditions per place. [2022-11-25 17:24:38,044 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 32 selfloop transitions, 4 changer transitions 20/58 dead transitions. [2022-11-25 17:24:38,044 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 58 transitions, 360 flow [2022-11-25 17:24:38,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:24:38,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 17:24:38,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 891 transitions. [2022-11-25 17:24:38,050 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4490927419354839 [2022-11-25 17:24:38,050 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 891 transitions. [2022-11-25 17:24:38,050 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 891 transitions. [2022-11-25 17:24:38,051 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 17:24:38,051 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 891 transitions. [2022-11-25 17:24:38,054 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 111.375) internal successors, (891), 8 states have internal predecessors, (891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:38,057 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:38,058 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 248.0) internal successors, (2232), 9 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:38,058 INFO L175 Difference]: Start difference. First operand has 45 places, 28 transitions, 119 flow. Second operand 8 states and 891 transitions. [2022-11-25 17:24:38,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 58 transitions, 360 flow [2022-11-25 17:24:38,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 58 transitions, 344 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-11-25 17:24:38,063 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 119 flow [2022-11-25 17:24:38,064 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=119, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2022-11-25 17:24:38,064 INFO L288 CegarLoopForPetriNet]: 41 programPoint places, 7 predicate places. [2022-11-25 17:24:38,065 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 119 flow [2022-11-25 17:24:38,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 108.0) internal successors, (1080), 10 states have internal predecessors, (1080), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:24:38,066 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 17:24:38,066 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-11-25 17:24:38,084 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:38,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:38,279 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 17:24:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:24:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash -616121361, now seen corresponding path program 5 times [2022-11-25 17:24:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 17:24:38,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [524375353] [2022-11-25 17:24:38,280 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:24:38,280 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-11-25 17:24:38,281 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 17:24:38,282 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:38,326 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:38,433 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 17:24:38,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 17:24:38,433 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:24:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:24:38,623 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 17:24:38,623 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:24:38,624 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-25 17:24:38,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-25 17:24:38,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-25 17:24:38,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-25 17:24:38,627 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-25 17:24:38,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-25 17:24:38,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-25 17:24:38,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-25 17:24:38,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-25 17:24:38,628 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-25 17:24:38,629 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-25 17:24:38,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-25 17:24:38,643 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-25 17:24:38,672 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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)] Forceful destruction successful, exit code 0 [2022-11-25 17:24:38,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/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-11-25 17:24:38,852 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1] [2022-11-25 17:24:38,858 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 17:24:38,858 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:24:38,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:24:38 BasicIcfg [2022-11-25 17:24:38,930 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:24:38,931 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:24:38,931 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:24:38,931 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:24:38,932 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:24:18" (3/4) ... [2022-11-25 17:24:38,934 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 17:24:38,934 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:24:38,935 INFO L158 Benchmark]: Toolchain (without parser) took 21978.29ms. Allocated memory was 71.3MB in the beginning and 174.1MB in the end (delta: 102.8MB). Free memory was 42.8MB in the beginning and 63.9MB in the end (delta: -21.1MB). Peak memory consumption was 82.6MB. Max. memory is 16.1GB. [2022-11-25 17:24:38,935 INFO L158 Benchmark]: CDTParser took 0.61ms. Allocated memory is still 71.3MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:24:38,936 INFO L158 Benchmark]: CACSL2BoogieTranslator took 692.38ms. Allocated memory was 71.3MB in the beginning and 98.6MB in the end (delta: 27.3MB). Free memory was 42.6MB in the beginning and 63.7MB in the end (delta: -21.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-25 17:24:38,936 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.01ms. Allocated memory is still 98.6MB. Free memory was 63.7MB in the beginning and 60.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:24:38,937 INFO L158 Benchmark]: Boogie Preprocessor took 56.22ms. Allocated memory is still 98.6MB. Free memory was 60.9MB in the beginning and 58.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:24:38,937 INFO L158 Benchmark]: RCFGBuilder took 950.76ms. Allocated memory is still 98.6MB. Free memory was 58.8MB in the beginning and 71.2MB in the end (delta: -12.4MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2022-11-25 17:24:38,937 INFO L158 Benchmark]: TraceAbstraction took 20169.28ms. Allocated memory was 98.6MB in the beginning and 174.1MB in the end (delta: 75.5MB). Free memory was 71.0MB in the beginning and 63.9MB in the end (delta: 7.0MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. [2022-11-25 17:24:38,938 INFO L158 Benchmark]: Witness Printer took 3.82ms. Allocated memory is still 174.1MB. Free memory is still 63.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:24:38,939 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.61ms. Allocated memory is still 71.3MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 692.38ms. Allocated memory was 71.3MB in the beginning and 98.6MB in the end (delta: 27.3MB). Free memory was 42.6MB in the beginning and 63.7MB in the end (delta: -21.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.01ms. Allocated memory is still 98.6MB. Free memory was 63.7MB in the beginning and 60.9MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.22ms. Allocated memory is still 98.6MB. Free memory was 60.9MB in the beginning and 58.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 950.76ms. Allocated memory is still 98.6MB. Free memory was 58.8MB in the beginning and 71.2MB in the end (delta: -12.4MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20169.28ms. Allocated memory was 98.6MB in the beginning and 174.1MB in the end (delta: 75.5MB). Free memory was 71.0MB in the beginning and 63.9MB in the end (delta: 7.0MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. * Witness Printer took 3.82ms. Allocated memory is still 174.1MB. Free memory is still 63.9MB. 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: 9.5s, 130 PlacesBefore, 41 PlacesAfterwards, 122 TransitionsBefore, 32 TransitionsAfterwards, 2302 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 123 TotalNumberOfCompositions, 6093 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2940, independent: 2773, independent conditional: 0, independent unconditional: 2773, dependent: 167, dependent conditional: 0, dependent unconditional: 167, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1659, independent: 1609, independent conditional: 0, independent unconditional: 1609, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1659, independent: 1585, independent conditional: 0, independent unconditional: 1585, dependent: 74, dependent conditional: 0, dependent unconditional: 74, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 74, independent: 24, independent conditional: 0, independent unconditional: 24, dependent: 50, dependent conditional: 0, dependent unconditional: 50, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 439, independent: 59, independent conditional: 0, independent unconditional: 59, dependent: 380, dependent conditional: 0, dependent unconditional: 380, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2940, independent: 1164, independent conditional: 0, independent unconditional: 1164, dependent: 117, dependent conditional: 0, dependent unconditional: 117, unknown: 1659, unknown conditional: 0, unknown unconditional: 1659] , Statistics on independence cache: Total cache size (in pairs): 146, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p2_EAX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L736] 0 _Bool weak$$choice0; [L737] 0 _Bool weak$$choice2; [L818] 0 pthread_t t1804; [L819] FCALL, FORK 0 pthread_create(&t1804, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1804, ((void *)0), P0, ((void *)0))=0, t1804={-6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L820] 0 pthread_t t1805; [L821] FCALL, FORK 0 pthread_create(&t1805, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1805, ((void *)0), P1, ((void *)0))=1, t1804={-6:0}, t1805={-10:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L822] 0 pthread_t t1806; [L823] FCALL, FORK 0 pthread_create(&t1806, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1806, ((void *)0), P2, ((void *)0))=2, t1804={-6:0}, t1805={-10:0}, t1806={-2:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L761] 2 x$w_buff1 = x$w_buff0 [L762] 2 x$w_buff0 = 2 [L763] 2 x$w_buff1_used = x$w_buff0_used [L764] 2 x$w_buff0_used = (_Bool)1 [L765] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L765] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L766] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L767] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L768] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L769] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L770] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L773] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L790] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L793] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L797] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L798] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L799] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L800] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L747] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L748] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L749] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L750] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L751] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L777] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L778] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L779] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L780] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=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$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L785] 2 return 0; [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L805] 3 return 0; [L754] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L756] 1 return 0; [L825] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L827] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L827] RET 0 assume_abort_if_not(main$tmp_guard0) [L829] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L830] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L831] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L832] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L833] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1804={-6:0}, t1805={-10:0}, t1806={-2:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L836] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L837] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L838] 0 x$flush_delayed = weak$$choice2 [L839] 0 x$mem_tmp = x [L840] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L841] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L842] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L843] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L844] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L845] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L846] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L848] 0 x = x$flush_delayed ? x$mem_tmp : x [L849] 0 x$flush_delayed = (_Bool)0 [L851] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - 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: 816]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 821]: 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: 823]: 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: 819]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 19.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.7s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 469 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 342 mSDsluCounter, 404 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 304 mSDsCounter, 93 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1420 IncrementalHoareTripleChecker+Invalid, 1513 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 93 mSolverCounterUnsat, 100 mSDtfsCounter, 1420 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=5, InterpolantAutomatonStates: 54, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 180 NumberOfCodeBlocks, 180 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 148 ConstructedInterpolants, 13 QuantifiedInterpolants, 1344 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1302 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-11-25 17:24:38,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3d06774-a329-4c1a-b284-b6ee1a44e502/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample