./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 13:20:47,518 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:20:47,519 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:20:47,531 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:20:47,531 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:20:47,532 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:20:47,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:20:47,534 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:20:47,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:20:47,536 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:20:47,536 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:20:47,537 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:20:47,537 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:20:47,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:20:47,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:20:47,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:20:47,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:20:47,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:20:47,542 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:20:47,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:20:47,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:20:47,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:20:47,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:20:47,546 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:20:47,548 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:20:47,548 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:20:47,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:20:47,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:20:47,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:20:47,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:20:47,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:20:47,550 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:20:47,551 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:20:47,552 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:20:47,552 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:20:47,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:20:47,553 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:20:47,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:20:47,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:20:47,554 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:20:47,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:20:47,555 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 13:20:47,568 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:20:47,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:20:47,568 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:20:47,568 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:20:47,569 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:20:47,569 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:20:47,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:20:47,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:20:47,570 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:20:47,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:20:47,570 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:20:47,570 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:20:47,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:20:47,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:20:47,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:20:47,571 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 13:20:47,571 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 13:20:47,571 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 13:20:47,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:20:47,571 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 13:20:47,571 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:20:47,571 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:20:47,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:20:47,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:20:47,572 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:20:47,572 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:20:47,572 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:20:47,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:20:47,573 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 13:20:47,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 13:20:47,573 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:20:47,573 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:20:47,573 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:20:47,573 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:20:47,574 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_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 [2022-12-13 13:20:47,743 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:20:47,760 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:20:47,762 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:20:47,763 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:20:47,763 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:20:47,764 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-12-13 13:20:50,306 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:20:50,493 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:20:50,494 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-12-13 13:20:50,502 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/data/0c6158089/ae6fa3ad388649f1b62310188706c8c5/FLAGa3795216e [2022-12-13 13:20:50,901 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/data/0c6158089/ae6fa3ad388649f1b62310188706c8c5 [2022-12-13 13:20:50,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:20:50,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:20:50,910 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:20:50,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:20:50,915 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:20:50,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:20:50" (1/1) ... [2022-12-13 13:20:50,917 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa45bc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:50, skipping insertion in model container [2022-12-13 13:20:50,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:20:50" (1/1) ... [2022-12-13 13:20:50,924 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:20:50,950 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:20:51,058 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_f25848fa-1235-4401-90df-8928707ab334/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-12-13 13:20:51,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,177 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,185 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,186 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,187 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,189 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,190 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,197 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,198 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,200 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,205 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,207 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,208 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,210 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:20:51,220 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:20:51,230 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_f25848fa-1235-4401-90df-8928707ab334/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-12-13 13:20:51,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,247 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,248 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,253 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,254 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,256 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,257 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,258 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,263 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,264 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,265 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,266 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,269 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,271 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:20:51,272 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:20:51,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:20:51,296 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:20:51,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:51 WrapperNode [2022-12-13 13:20:51,296 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:20:51,297 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:20:51,297 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:20:51,297 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:20:51,303 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:51" (1/1) ... [2022-12-13 13:20:51,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:51" (1/1) ... [2022-12-13 13:20:51,332 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 136 [2022-12-13 13:20:51,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:20:51,333 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:20:51,333 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:20:51,333 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:20:51,341 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:51" (1/1) ... [2022-12-13 13:20:51,341 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:51" (1/1) ... [2022-12-13 13:20:51,344 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:51" (1/1) ... [2022-12-13 13:20:51,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:51" (1/1) ... [2022-12-13 13:20:51,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:51" (1/1) ... [2022-12-13 13:20:51,356 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:51" (1/1) ... [2022-12-13 13:20:51,358 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:51" (1/1) ... [2022-12-13 13:20:51,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:51" (1/1) ... [2022-12-13 13:20:51,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:20:51,363 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:20:51,363 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:20:51,363 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:20:51,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:51" (1/1) ... [2022-12-13 13:20:51,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:20:51,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:20:51,391 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:20:51,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:20:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 13:20:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 13:20:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:20:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:20:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:20:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:20:51,423 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 13:20:51,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 13:20:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 13:20:51,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 13:20:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 13:20:51,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 13:20:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 13:20:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:20:51,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:20:51,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:20:51,426 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 13:20:51,544 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:20:51,545 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:20:51,962 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:20:52,196 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:20:52,196 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 13:20:52,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:20:52 BoogieIcfgContainer [2022-12-13 13:20:52,199 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:20:52,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:20:52,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:20:52,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:20:52,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:20:50" (1/3) ... [2022-12-13 13:20:52,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2053d29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:20:52, skipping insertion in model container [2022-12-13 13:20:52,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:20:51" (2/3) ... [2022-12-13 13:20:52,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2053d29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:20:52, skipping insertion in model container [2022-12-13 13:20:52,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:20:52" (3/3) ... [2022-12-13 13:20:52,211 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.opt.i [2022-12-13 13:20:52,228 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:20:52,228 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2022-12-13 13:20:52,228 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:20:52,317 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 13:20:52,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 189 places, 181 transitions, 377 flow [2022-12-13 13:20:52,392 INFO L130 PetriNetUnfolder]: 2/178 cut-off events. [2022-12-13 13:20:52,392 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:20:52,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 2/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 255 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-12-13 13:20:52,397 INFO L82 GeneralOperation]: Start removeDead. Operand has 189 places, 181 transitions, 377 flow [2022-12-13 13:20:52,401 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 186 places, 178 transitions, 365 flow [2022-12-13 13:20:52,404 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 13:20:52,412 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 186 places, 178 transitions, 365 flow [2022-12-13 13:20:52,414 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 186 places, 178 transitions, 365 flow [2022-12-13 13:20:52,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 186 places, 178 transitions, 365 flow [2022-12-13 13:20:52,443 INFO L130 PetriNetUnfolder]: 2/178 cut-off events. [2022-12-13 13:20:52,443 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:20:52,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 188 conditions, 178 events. 2/178 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 254 event pairs, 0 based on Foata normal form. 0/128 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-12-13 13:20:52,446 INFO L119 LiptonReduction]: Number of co-enabled transitions 7128 [2022-12-13 13:20:57,277 INFO L134 LiptonReduction]: Checked pairs total: 34739 [2022-12-13 13:20:57,277 INFO L136 LiptonReduction]: Total number of compositions: 152 [2022-12-13 13:20:57,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:20:57,291 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;@63d37913, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:20:57,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-12-13 13:20:57,292 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 13:20:57,293 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:20:57,293 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:20:57,293 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 13:20:57,293 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:20:57,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:20:57,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1014, now seen corresponding path program 1 times [2022-12-13 13:20:57,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:20:57,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520227680] [2022-12-13 13:20:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:20:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:20:57,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:20:57,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:20:57,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:20:57,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520227680] [2022-12-13 13:20:57,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520227680] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:20:57,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:20:57,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 13:20:57,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739773569] [2022-12-13 13:20:57,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:20:57,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 13:20:57,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:20:57,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 13:20:57,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:20:57,407 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 333 [2022-12-13 13:20:57,408 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 72 transitions, 153 flow. Second operand has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:20:57,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:20:57,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 333 [2022-12-13 13:20:57,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:00,918 INFO L130 PetriNetUnfolder]: 23428/32687 cut-off events. [2022-12-13 13:21:00,918 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-13 13:21:00,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65453 conditions, 32687 events. 23428/32687 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 2543. Compared 216108 event pairs, 23428 based on Foata normal form. 0/13853 useless extension candidates. Maximal degree in co-relation 65442. Up to 32628 conditions per place. [2022-12-13 13:21:01,054 INFO L137 encePairwiseOnDemand]: 307/333 looper letters, 45 selfloop transitions, 0 changer transitions 0/46 dead transitions. [2022-12-13 13:21:01,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 46 transitions, 191 flow [2022-12-13 13:21:01,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 13:21:01,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 13:21:01,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 333 transitions. [2022-12-13 13:21:01,068 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5 [2022-12-13 13:21:01,069 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 333 transitions. [2022-12-13 13:21:01,069 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 333 transitions. [2022-12-13 13:21:01,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:01,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 333 transitions. [2022-12-13 13:21:01,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 166.5) internal successors, (333), 2 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:01,081 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:01,082 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 333.0) internal successors, (999), 3 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:01,084 INFO L175 Difference]: Start difference. First operand has 82 places, 72 transitions, 153 flow. Second operand 2 states and 333 transitions. [2022-12-13 13:21:01,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 46 transitions, 191 flow [2022-12-13 13:21:01,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 46 transitions, 188 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 13:21:01,091 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 98 flow [2022-12-13 13:21:01,093 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=98, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-12-13 13:21:01,096 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, -28 predicate places. [2022-12-13 13:21:01,097 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 98 flow [2022-12-13 13:21:01,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 131.5) internal successors, (263), 2 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:01,097 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:01,097 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 13:21:01,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 13:21:01,098 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:01,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:01,099 INFO L85 PathProgramCache]: Analyzing trace with hash 31094242, now seen corresponding path program 1 times [2022-12-13 13:21:01,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:01,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973401244] [2022-12-13 13:21:01,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:01,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:01,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:01,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:01,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973401244] [2022-12-13 13:21:01,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973401244] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:01,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:01,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:21:01,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251829715] [2022-12-13 13:21:01,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:01,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:21:01,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:01,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:21:01,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:21:01,320 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 333 [2022-12-13 13:21:01,321 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:01,321 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:01,321 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 333 [2022-12-13 13:21:01,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:03,409 INFO L130 PetriNetUnfolder]: 14811/21812 cut-off events. [2022-12-13 13:21:03,409 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:21:03,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43434 conditions, 21812 events. 14811/21812 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1490. Compared 147607 event pairs, 9091 based on Foata normal form. 0/11792 useless extension candidates. Maximal degree in co-relation 43431. Up to 13032 conditions per place. [2022-12-13 13:21:03,501 INFO L137 encePairwiseOnDemand]: 314/333 looper letters, 52 selfloop transitions, 10 changer transitions 0/63 dead transitions. [2022-12-13 13:21:03,501 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 63 transitions, 256 flow [2022-12-13 13:21:03,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:21:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:21:03,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-12-13 13:21:03,504 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44644644644644643 [2022-12-13 13:21:03,504 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 446 transitions. [2022-12-13 13:21:03,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 446 transitions. [2022-12-13 13:21:03,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:03,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 446 transitions. [2022-12-13 13:21:03,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:03,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:03,509 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:03,509 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 98 flow. Second operand 3 states and 446 transitions. [2022-12-13 13:21:03,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 63 transitions, 256 flow [2022-12-13 13:21:03,509 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 13:21:03,510 INFO L231 Difference]: Finished difference. Result has 56 places, 52 transitions, 180 flow [2022-12-13 13:21:03,511 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=180, PETRI_PLACES=56, PETRI_TRANSITIONS=52} [2022-12-13 13:21:03,511 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, -26 predicate places. [2022-12-13 13:21:03,511 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 52 transitions, 180 flow [2022-12-13 13:21:03,512 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.33333333333333) internal successors, (379), 3 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:03,512 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:03,512 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 13:21:03,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 13:21:03,512 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:03,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:03,513 INFO L85 PathProgramCache]: Analyzing trace with hash 31094243, now seen corresponding path program 1 times [2022-12-13 13:21:03,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:03,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29600791] [2022-12-13 13:21:03,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:03,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:03,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:03,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:03,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:03,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29600791] [2022-12-13 13:21:03,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29600791] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:03,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:03,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:21:03,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687471256] [2022-12-13 13:21:03,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:03,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:21:03,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:03,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:21:03,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:21:03,636 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 333 [2022-12-13 13:21:03,637 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 52 transitions, 180 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:03,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:03,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 333 [2022-12-13 13:21:03,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:04,613 INFO L130 PetriNetUnfolder]: 4316/6749 cut-off events. [2022-12-13 13:21:04,614 INFO L131 PetriNetUnfolder]: For 2019/2019 co-relation queries the response was YES. [2022-12-13 13:21:04,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19179 conditions, 6749 events. 4316/6749 cut-off events. For 2019/2019 co-relation queries the response was YES. Maximal size of possible extension queue 529. Compared 41562 event pairs, 3129 based on Foata normal form. 1935/7754 useless extension candidates. Maximal degree in co-relation 19174. Up to 6593 conditions per place. [2022-12-13 13:21:04,634 INFO L137 encePairwiseOnDemand]: 323/333 looper letters, 41 selfloop transitions, 1 changer transitions 0/43 dead transitions. [2022-12-13 13:21:04,635 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 43 transitions, 246 flow [2022-12-13 13:21:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:21:04,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:21:04,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2022-12-13 13:21:04,636 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43043043043043044 [2022-12-13 13:21:04,636 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2022-12-13 13:21:04,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2022-12-13 13:21:04,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:04,637 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2022-12-13 13:21:04,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:04,639 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:04,639 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:04,639 INFO L175 Difference]: Start difference. First operand has 56 places, 52 transitions, 180 flow. Second operand 3 states and 430 transitions. [2022-12-13 13:21:04,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 43 transitions, 246 flow [2022-12-13 13:21:04,651 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 43 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:21:04,652 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 144 flow [2022-12-13 13:21:04,652 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=144, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2022-12-13 13:21:04,653 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, -35 predicate places. [2022-12-13 13:21:04,653 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 144 flow [2022-12-13 13:21:04,653 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:04,653 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:04,653 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:04,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 13:21:04,653 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:04,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:04,654 INFO L85 PathProgramCache]: Analyzing trace with hash -763801001, now seen corresponding path program 1 times [2022-12-13 13:21:04,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:04,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802009887] [2022-12-13 13:21:04,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:04,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:04,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:04,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:04,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802009887] [2022-12-13 13:21:04,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802009887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:04,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:04,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:21:04,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170041440] [2022-12-13 13:21:04,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:04,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:21:04,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:04,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:21:04,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:21:04,807 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 333 [2022-12-13 13:21:04,808 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 144 flow. Second operand has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:04,808 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:04,808 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 333 [2022-12-13 13:21:04,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:05,514 INFO L130 PetriNetUnfolder]: 4276/6597 cut-off events. [2022-12-13 13:21:05,515 INFO L131 PetriNetUnfolder]: For 1050/1050 co-relation queries the response was YES. [2022-12-13 13:21:05,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17544 conditions, 6597 events. 4276/6597 cut-off events. For 1050/1050 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 41657 event pairs, 1179 based on Foata normal form. 0/4939 useless extension candidates. Maximal degree in co-relation 17539. Up to 5554 conditions per place. [2022-12-13 13:21:05,537 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 74 selfloop transitions, 2 changer transitions 0/77 dead transitions. [2022-12-13 13:21:05,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 77 transitions, 410 flow [2022-12-13 13:21:05,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:21:05,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:21:05,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 449 transitions. [2022-12-13 13:21:05,539 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4494494494494494 [2022-12-13 13:21:05,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 449 transitions. [2022-12-13 13:21:05,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 449 transitions. [2022-12-13 13:21:05,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:05,539 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 449 transitions. [2022-12-13 13:21:05,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:05,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:05,541 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:05,542 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 144 flow. Second operand 3 states and 449 transitions. [2022-12-13 13:21:05,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 77 transitions, 410 flow [2022-12-13 13:21:05,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 77 transitions, 409 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:21:05,543 INFO L231 Difference]: Finished difference. Result has 49 places, 43 transitions, 151 flow [2022-12-13 13:21:05,543 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=151, PETRI_PLACES=49, PETRI_TRANSITIONS=43} [2022-12-13 13:21:05,544 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, -33 predicate places. [2022-12-13 13:21:05,544 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 43 transitions, 151 flow [2022-12-13 13:21:05,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.66666666666666) internal successors, (398), 3 states have internal predecessors, (398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:05,544 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:05,544 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:05,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 13:21:05,545 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:05,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:05,545 INFO L85 PathProgramCache]: Analyzing trace with hash -763801238, now seen corresponding path program 1 times [2022-12-13 13:21:05,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:05,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622939522] [2022-12-13 13:21:05,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:05,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:05,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:05,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:05,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:05,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622939522] [2022-12-13 13:21:05,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622939522] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:05,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:05,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:21:05,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447244783] [2022-12-13 13:21:05,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:05,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:21:05,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:05,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:21:05,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:21:05,607 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 130 out of 333 [2022-12-13 13:21:05,607 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 43 transitions, 151 flow. Second operand has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:05,607 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:05,607 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 130 of 333 [2022-12-13 13:21:05,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:06,299 INFO L130 PetriNetUnfolder]: 4196/6641 cut-off events. [2022-12-13 13:21:06,299 INFO L131 PetriNetUnfolder]: For 1281/1281 co-relation queries the response was YES. [2022-12-13 13:21:06,305 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18332 conditions, 6641 events. 4196/6641 cut-off events. For 1281/1281 co-relation queries the response was YES. Maximal size of possible extension queue 530. Compared 41817 event pairs, 1462 based on Foata normal form. 0/5067 useless extension candidates. Maximal degree in co-relation 18326. Up to 4942 conditions per place. [2022-12-13 13:21:06,320 INFO L137 encePairwiseOnDemand]: 329/333 looper letters, 63 selfloop transitions, 3 changer transitions 0/67 dead transitions. [2022-12-13 13:21:06,320 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 67 transitions, 370 flow [2022-12-13 13:21:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:21:06,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:21:06,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 444 transitions. [2022-12-13 13:21:06,321 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4444444444444444 [2022-12-13 13:21:06,321 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 444 transitions. [2022-12-13 13:21:06,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 444 transitions. [2022-12-13 13:21:06,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:06,322 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 444 transitions. [2022-12-13 13:21:06,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:06,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:06,325 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:06,325 INFO L175 Difference]: Start difference. First operand has 49 places, 43 transitions, 151 flow. Second operand 3 states and 444 transitions. [2022-12-13 13:21:06,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 67 transitions, 370 flow [2022-12-13 13:21:06,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 67 transitions, 364 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:21:06,327 INFO L231 Difference]: Finished difference. Result has 50 places, 43 transitions, 160 flow [2022-12-13 13:21:06,327 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=160, PETRI_PLACES=50, PETRI_TRANSITIONS=43} [2022-12-13 13:21:06,328 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, -32 predicate places. [2022-12-13 13:21:06,328 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 43 transitions, 160 flow [2022-12-13 13:21:06,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:06,329 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:06,329 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:06,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 13:21:06,329 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:06,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:06,330 INFO L85 PathProgramCache]: Analyzing trace with hash 484751775, now seen corresponding path program 1 times [2022-12-13 13:21:06,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:06,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642937393] [2022-12-13 13:21:06,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:06,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:06,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:06,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:06,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642937393] [2022-12-13 13:21:06,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642937393] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:06,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:06,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:21:06,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104099514] [2022-12-13 13:21:06,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:06,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:21:06,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:06,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:21:06,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:21:06,458 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 333 [2022-12-13 13:21:06,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 43 transitions, 160 flow. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:06,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:06,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 333 [2022-12-13 13:21:06,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:07,582 INFO L130 PetriNetUnfolder]: 7207/11056 cut-off events. [2022-12-13 13:21:07,582 INFO L131 PetriNetUnfolder]: For 2047/2047 co-relation queries the response was YES. [2022-12-13 13:21:07,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30736 conditions, 11056 events. 7207/11056 cut-off events. For 2047/2047 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 70018 event pairs, 1757 based on Foata normal form. 60/8656 useless extension candidates. Maximal degree in co-relation 30729. Up to 4578 conditions per place. [2022-12-13 13:21:07,618 INFO L137 encePairwiseOnDemand]: 329/333 looper letters, 94 selfloop transitions, 3 changer transitions 0/97 dead transitions. [2022-12-13 13:21:07,618 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 97 transitions, 547 flow [2022-12-13 13:21:07,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:21:07,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:21:07,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 586 transitions. [2022-12-13 13:21:07,620 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43993993993993996 [2022-12-13 13:21:07,620 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 586 transitions. [2022-12-13 13:21:07,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 586 transitions. [2022-12-13 13:21:07,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:07,621 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 586 transitions. [2022-12-13 13:21:07,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 146.5) internal successors, (586), 4 states have internal predecessors, (586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:07,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:07,623 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:07,624 INFO L175 Difference]: Start difference. First operand has 50 places, 43 transitions, 160 flow. Second operand 4 states and 586 transitions. [2022-12-13 13:21:07,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 97 transitions, 547 flow [2022-12-13 13:21:07,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 97 transitions, 541 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:21:07,626 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 173 flow [2022-12-13 13:21:07,626 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=173, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2022-12-13 13:21:07,627 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, -29 predicate places. [2022-12-13 13:21:07,627 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 173 flow [2022-12-13 13:21:07,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:07,627 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:07,627 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:07,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 13:21:07,627 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:07,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:07,628 INFO L85 PathProgramCache]: Analyzing trace with hash 2090027882, now seen corresponding path program 1 times [2022-12-13 13:21:07,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:07,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485535085] [2022-12-13 13:21:07,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:07,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:07,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:07,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:07,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485535085] [2022-12-13 13:21:07,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485535085] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:07,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:07,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:21:07,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425341881] [2022-12-13 13:21:07,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:07,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:21:07,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:07,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:21:07,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:21:07,745 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 333 [2022-12-13 13:21:07,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 173 flow. Second operand has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 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-12-13 13:21:07,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:07,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 333 [2022-12-13 13:21:07,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:09,071 INFO L130 PetriNetUnfolder]: 7166/11367 cut-off events. [2022-12-13 13:21:09,071 INFO L131 PetriNetUnfolder]: For 2717/2717 co-relation queries the response was YES. [2022-12-13 13:21:09,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32551 conditions, 11367 events. 7166/11367 cut-off events. For 2717/2717 co-relation queries the response was YES. Maximal size of possible extension queue 857. Compared 78193 event pairs, 3119 based on Foata normal form. 0/8873 useless extension candidates. Maximal degree in co-relation 32542. Up to 8322 conditions per place. [2022-12-13 13:21:09,128 INFO L137 encePairwiseOnDemand]: 327/333 looper letters, 52 selfloop transitions, 6 changer transitions 0/59 dead transitions. [2022-12-13 13:21:09,128 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 59 transitions, 340 flow [2022-12-13 13:21:09,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:21:09,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:21:09,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2022-12-13 13:21:09,131 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4214214214214214 [2022-12-13 13:21:09,131 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2022-12-13 13:21:09,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2022-12-13 13:21:09,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:09,132 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2022-12-13 13:21:09,133 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:09,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:09,136 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:09,136 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 173 flow. Second operand 3 states and 421 transitions. [2022-12-13 13:21:09,137 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 59 transitions, 340 flow [2022-12-13 13:21:09,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 59 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:21:09,148 INFO L231 Difference]: Finished difference. Result has 53 places, 47 transitions, 207 flow [2022-12-13 13:21:09,148 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=207, PETRI_PLACES=53, PETRI_TRANSITIONS=47} [2022-12-13 13:21:09,149 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, -29 predicate places. [2022-12-13 13:21:09,149 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 47 transitions, 207 flow [2022-12-13 13:21:09,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 127.0) internal successors, (508), 4 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-12-13 13:21:09,150 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:09,150 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:09,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 13:21:09,150 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:09,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:09,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2091971583, now seen corresponding path program 1 times [2022-12-13 13:21:09,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:09,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109196805] [2022-12-13 13:21:09,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:09,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:09,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:09,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:09,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109196805] [2022-12-13 13:21:09,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109196805] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:09,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:09,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:21:09,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418183351] [2022-12-13 13:21:09,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:09,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:21:09,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:09,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:21:09,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:21:09,322 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 333 [2022-12-13 13:21:09,323 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 47 transitions, 207 flow. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:09,323 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:09,323 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 333 [2022-12-13 13:21:09,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:10,588 INFO L130 PetriNetUnfolder]: 6983/11100 cut-off events. [2022-12-13 13:21:10,589 INFO L131 PetriNetUnfolder]: For 4789/4789 co-relation queries the response was YES. [2022-12-13 13:21:10,597 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33822 conditions, 11100 events. 6983/11100 cut-off events. For 4789/4789 co-relation queries the response was YES. Maximal size of possible extension queue 846. Compared 76146 event pairs, 2789 based on Foata normal form. 84/8830 useless extension candidates. Maximal degree in co-relation 33812. Up to 9441 conditions per place. [2022-12-13 13:21:10,621 INFO L137 encePairwiseOnDemand]: 330/333 looper letters, 64 selfloop transitions, 3 changer transitions 0/68 dead transitions. [2022-12-13 13:21:10,621 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 68 transitions, 422 flow [2022-12-13 13:21:10,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:21:10,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:21:10,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 566 transitions. [2022-12-13 13:21:10,622 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42492492492492495 [2022-12-13 13:21:10,622 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 566 transitions. [2022-12-13 13:21:10,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 566 transitions. [2022-12-13 13:21:10,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:10,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 566 transitions. [2022-12-13 13:21:10,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.5) internal successors, (566), 4 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-12-13 13:21:10,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:10,625 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:10,625 INFO L175 Difference]: Start difference. First operand has 53 places, 47 transitions, 207 flow. Second operand 4 states and 566 transitions. [2022-12-13 13:21:10,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 68 transitions, 422 flow [2022-12-13 13:21:10,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 68 transitions, 413 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:21:10,637 INFO L231 Difference]: Finished difference. Result has 53 places, 46 transitions, 200 flow [2022-12-13 13:21:10,637 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=200, PETRI_PLACES=53, PETRI_TRANSITIONS=46} [2022-12-13 13:21:10,638 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, -29 predicate places. [2022-12-13 13:21:10,638 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 46 transitions, 200 flow [2022-12-13 13:21:10,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 4 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:10,638 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:10,638 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:10,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 13:21:10,638 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:10,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:10,638 INFO L85 PathProgramCache]: Analyzing trace with hash 426631605, now seen corresponding path program 1 times [2022-12-13 13:21:10,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:10,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767565704] [2022-12-13 13:21:10,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:10,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:10,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:10,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:10,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767565704] [2022-12-13 13:21:10,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767565704] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:10,729 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:10,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:21:10,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802636198] [2022-12-13 13:21:10,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:10,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:21:10,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:10,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:21:10,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:21:10,783 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 333 [2022-12-13 13:21:10,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 46 transitions, 200 flow. Second operand has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:10,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:10,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 333 [2022-12-13 13:21:10,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:11,805 INFO L130 PetriNetUnfolder]: 5899/9374 cut-off events. [2022-12-13 13:21:11,805 INFO L131 PetriNetUnfolder]: For 4018/4030 co-relation queries the response was YES. [2022-12-13 13:21:11,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27938 conditions, 9374 events. 5899/9374 cut-off events. For 4018/4030 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 62192 event pairs, 2345 based on Foata normal form. 28/7403 useless extension candidates. Maximal degree in co-relation 27929. Up to 3992 conditions per place. [2022-12-13 13:21:11,840 INFO L137 encePairwiseOnDemand]: 317/333 looper letters, 52 selfloop transitions, 13 changer transitions 0/66 dead transitions. [2022-12-13 13:21:11,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 66 transitions, 410 flow [2022-12-13 13:21:11,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:21:11,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:21:11,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 543 transitions. [2022-12-13 13:21:11,841 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40765765765765766 [2022-12-13 13:21:11,841 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 543 transitions. [2022-12-13 13:21:11,842 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 543 transitions. [2022-12-13 13:21:11,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:11,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 543 transitions. [2022-12-13 13:21:11,843 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 135.75) internal successors, (543), 4 states have internal predecessors, (543), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:11,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:11,845 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:11,845 INFO L175 Difference]: Start difference. First operand has 53 places, 46 transitions, 200 flow. Second operand 4 states and 543 transitions. [2022-12-13 13:21:11,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 66 transitions, 410 flow [2022-12-13 13:21:11,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 66 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:21:11,856 INFO L231 Difference]: Finished difference. Result has 56 places, 51 transitions, 286 flow [2022-12-13 13:21:11,856 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=286, PETRI_PLACES=56, PETRI_TRANSITIONS=51} [2022-12-13 13:21:11,857 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, -26 predicate places. [2022-12-13 13:21:11,857 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 51 transitions, 286 flow [2022-12-13 13:21:11,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 123.6) internal successors, (618), 5 states have internal predecessors, (618), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:11,858 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:11,858 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:11,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 13:21:11,858 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:11,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:11,859 INFO L85 PathProgramCache]: Analyzing trace with hash -1669174052, now seen corresponding path program 1 times [2022-12-13 13:21:11,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:11,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506346370] [2022-12-13 13:21:11,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:11,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:12,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:12,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:12,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506346370] [2022-12-13 13:21:12,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506346370] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:12,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:12,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:21:12,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023127195] [2022-12-13 13:21:12,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:12,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:21:12,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:12,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:21:12,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:21:12,852 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 333 [2022-12-13 13:21:12,853 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 51 transitions, 286 flow. Second operand has 9 states, 9 states have (on average 115.44444444444444) internal successors, (1039), 9 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:12,853 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:12,853 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 333 [2022-12-13 13:21:12,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:14,323 INFO L130 PetriNetUnfolder]: 5799/9356 cut-off events. [2022-12-13 13:21:14,323 INFO L131 PetriNetUnfolder]: For 7369/7369 co-relation queries the response was YES. [2022-12-13 13:21:14,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 32486 conditions, 9356 events. 5799/9356 cut-off events. For 7369/7369 co-relation queries the response was YES. Maximal size of possible extension queue 729. Compared 63791 event pairs, 2154 based on Foata normal form. 141/8374 useless extension candidates. Maximal degree in co-relation 32476. Up to 7205 conditions per place. [2022-12-13 13:21:14,358 INFO L137 encePairwiseOnDemand]: 316/333 looper letters, 109 selfloop transitions, 49 changer transitions 0/159 dead transitions. [2022-12-13 13:21:14,358 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 159 transitions, 1160 flow [2022-12-13 13:21:14,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-13 13:21:14,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2022-12-13 13:21:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1728 transitions. [2022-12-13 13:21:14,362 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37065637065637064 [2022-12-13 13:21:14,362 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1728 transitions. [2022-12-13 13:21:14,362 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1728 transitions. [2022-12-13 13:21:14,362 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:14,362 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1728 transitions. [2022-12-13 13:21:14,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 123.42857142857143) internal successors, (1728), 14 states have internal predecessors, (1728), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:14,367 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 333.0) internal successors, (4995), 15 states have internal predecessors, (4995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:14,368 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 333.0) internal successors, (4995), 15 states have internal predecessors, (4995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:14,368 INFO L175 Difference]: Start difference. First operand has 56 places, 51 transitions, 286 flow. Second operand 14 states and 1728 transitions. [2022-12-13 13:21:14,368 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 159 transitions, 1160 flow [2022-12-13 13:21:14,394 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 159 transitions, 1151 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:21:14,395 INFO L231 Difference]: Finished difference. Result has 77 places, 96 transitions, 809 flow [2022-12-13 13:21:14,395 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=809, PETRI_PLACES=77, PETRI_TRANSITIONS=96} [2022-12-13 13:21:14,396 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, -5 predicate places. [2022-12-13 13:21:14,396 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 96 transitions, 809 flow [2022-12-13 13:21:14,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 115.44444444444444) internal successors, (1039), 9 states have internal predecessors, (1039), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:14,396 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:14,396 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:14,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 13:21:14,397 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:14,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:14,397 INFO L85 PathProgramCache]: Analyzing trace with hash 340677159, now seen corresponding path program 1 times [2022-12-13 13:21:14,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:14,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998416599] [2022-12-13 13:21:14,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:14,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:14,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:14,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:14,641 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998416599] [2022-12-13 13:21:14,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1998416599] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:14,642 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:14,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:21:14,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341007252] [2022-12-13 13:21:14,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:14,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:21:14,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:14,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:21:14,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:21:15,034 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 333 [2022-12-13 13:21:15,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 96 transitions, 809 flow. Second operand has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:15,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:15,035 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 333 [2022-12-13 13:21:15,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:16,718 INFO L130 PetriNetUnfolder]: 6487/10392 cut-off events. [2022-12-13 13:21:16,718 INFO L131 PetriNetUnfolder]: For 18686/18730 co-relation queries the response was YES. [2022-12-13 13:21:16,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42122 conditions, 10392 events. 6487/10392 cut-off events. For 18686/18730 co-relation queries the response was YES. Maximal size of possible extension queue 770. Compared 71361 event pairs, 1696 based on Foata normal form. 12/9795 useless extension candidates. Maximal degree in co-relation 42102. Up to 6207 conditions per place. [2022-12-13 13:21:16,765 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 189 selfloop transitions, 37 changer transitions 0/227 dead transitions. [2022-12-13 13:21:16,765 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 227 transitions, 2182 flow [2022-12-13 13:21:16,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:21:16,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:21:16,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1138 transitions. [2022-12-13 13:21:16,768 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37971304637971304 [2022-12-13 13:21:16,768 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1138 transitions. [2022-12-13 13:21:16,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1138 transitions. [2022-12-13 13:21:16,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:16,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1138 transitions. [2022-12-13 13:21:16,770 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 126.44444444444444) internal successors, (1138), 9 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:16,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 333.0) internal successors, (3330), 10 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:16,773 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 333.0) internal successors, (3330), 10 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:16,773 INFO L175 Difference]: Start difference. First operand has 77 places, 96 transitions, 809 flow. Second operand 9 states and 1138 transitions. [2022-12-13 13:21:16,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 227 transitions, 2182 flow [2022-12-13 13:21:16,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 227 transitions, 2151 flow, removed 14 selfloop flow, removed 1 redundant places. [2022-12-13 13:21:16,988 INFO L231 Difference]: Finished difference. Result has 90 places, 133 transitions, 1308 flow [2022-12-13 13:21:16,989 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1308, PETRI_PLACES=90, PETRI_TRANSITIONS=133} [2022-12-13 13:21:16,989 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 8 predicate places. [2022-12-13 13:21:16,989 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 133 transitions, 1308 flow [2022-12-13 13:21:16,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 116.55555555555556) internal successors, (1049), 9 states have internal predecessors, (1049), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:16,989 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:16,989 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:16,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 13:21:16,990 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:16,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:16,990 INFO L85 PathProgramCache]: Analyzing trace with hash 340677108, now seen corresponding path program 1 times [2022-12-13 13:21:16,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:16,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225937744] [2022-12-13 13:21:16,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:16,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:17,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:17,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225937744] [2022-12-13 13:21:17,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225937744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:17,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:17,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:21:17,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959879592] [2022-12-13 13:21:17,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:17,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:21:17,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:17,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:21:17,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:21:17,219 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 333 [2022-12-13 13:21:17,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 133 transitions, 1308 flow. Second operand has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:17,221 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:17,221 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 333 [2022-12-13 13:21:17,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:18,367 INFO L130 PetriNetUnfolder]: 4630/7599 cut-off events. [2022-12-13 13:21:18,367 INFO L131 PetriNetUnfolder]: For 17052/17070 co-relation queries the response was YES. [2022-12-13 13:21:18,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31495 conditions, 7599 events. 4630/7599 cut-off events. For 17052/17070 co-relation queries the response was YES. Maximal size of possible extension queue 521. Compared 50157 event pairs, 1777 based on Foata normal form. 234/7612 useless extension candidates. Maximal degree in co-relation 31468. Up to 3067 conditions per place. [2022-12-13 13:21:18,395 INFO L137 encePairwiseOnDemand]: 316/333 looper letters, 103 selfloop transitions, 52 changer transitions 6/162 dead transitions. [2022-12-13 13:21:18,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 162 transitions, 1779 flow [2022-12-13 13:21:18,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:21:18,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:21:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 777 transitions. [2022-12-13 13:21:18,397 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2022-12-13 13:21:18,397 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 777 transitions. [2022-12-13 13:21:18,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 777 transitions. [2022-12-13 13:21:18,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:18,398 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 777 transitions. [2022-12-13 13:21:18,399 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 129.5) internal successors, (777), 6 states have internal predecessors, (777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:18,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:18,401 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:18,401 INFO L175 Difference]: Start difference. First operand has 90 places, 133 transitions, 1308 flow. Second operand 6 states and 777 transitions. [2022-12-13 13:21:18,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 162 transitions, 1779 flow [2022-12-13 13:21:18,533 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 162 transitions, 1775 flow, removed 2 selfloop flow, removed 0 redundant places. [2022-12-13 13:21:18,534 INFO L231 Difference]: Finished difference. Result has 97 places, 131 transitions, 1450 flow [2022-12-13 13:21:18,534 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=48, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1450, PETRI_PLACES=97, PETRI_TRANSITIONS=131} [2022-12-13 13:21:18,535 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 15 predicate places. [2022-12-13 13:21:18,535 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 131 transitions, 1450 flow [2022-12-13 13:21:18,535 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.0) internal successors, (840), 7 states have internal predecessors, (840), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:18,535 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:18,535 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:18,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 13:21:18,535 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:18,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:18,536 INFO L85 PathProgramCache]: Analyzing trace with hash 1104311132, now seen corresponding path program 1 times [2022-12-13 13:21:18,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:18,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710759934] [2022-12-13 13:21:18,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:18,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:18,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:18,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:18,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:18,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710759934] [2022-12-13 13:21:18,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710759934] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:18,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:18,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:21:18,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104454373] [2022-12-13 13:21:18,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:18,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:21:18,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:18,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:21:18,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:21:19,185 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 333 [2022-12-13 13:21:19,187 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 131 transitions, 1450 flow. Second operand has 10 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:19,187 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:19,187 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 333 [2022-12-13 13:21:19,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:21,228 INFO L130 PetriNetUnfolder]: 6697/10548 cut-off events. [2022-12-13 13:21:21,228 INFO L131 PetriNetUnfolder]: For 34246/34246 co-relation queries the response was YES. [2022-12-13 13:21:21,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46976 conditions, 10548 events. 6697/10548 cut-off events. For 34246/34246 co-relation queries the response was YES. Maximal size of possible extension queue 566. Compared 66938 event pairs, 1838 based on Foata normal form. 24/10339 useless extension candidates. Maximal degree in co-relation 46947. Up to 8724 conditions per place. [2022-12-13 13:21:21,271 INFO L137 encePairwiseOnDemand]: 324/333 looper letters, 199 selfloop transitions, 28 changer transitions 0/227 dead transitions. [2022-12-13 13:21:21,271 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 227 transitions, 2585 flow [2022-12-13 13:21:21,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:21:21,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:21:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1110 transitions. [2022-12-13 13:21:21,273 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2022-12-13 13:21:21,274 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1110 transitions. [2022-12-13 13:21:21,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1110 transitions. [2022-12-13 13:21:21,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:21,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1110 transitions. [2022-12-13 13:21:21,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 123.33333333333333) internal successors, (1110), 9 states have internal predecessors, (1110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:21,278 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 333.0) internal successors, (3330), 10 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:21,278 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 333.0) internal successors, (3330), 10 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:21,278 INFO L175 Difference]: Start difference. First operand has 97 places, 131 transitions, 1450 flow. Second operand 9 states and 1110 transitions. [2022-12-13 13:21:21,278 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 227 transitions, 2585 flow [2022-12-13 13:21:21,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 227 transitions, 2507 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 13:21:21,607 INFO L231 Difference]: Finished difference. Result has 106 places, 151 transitions, 1749 flow [2022-12-13 13:21:21,607 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1391, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1749, PETRI_PLACES=106, PETRI_TRANSITIONS=151} [2022-12-13 13:21:21,608 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 24 predicate places. [2022-12-13 13:21:21,608 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 151 transitions, 1749 flow [2022-12-13 13:21:21,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:21,608 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:21,608 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:21,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 13:21:21,609 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:21,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:21,609 INFO L85 PathProgramCache]: Analyzing trace with hash 948746324, now seen corresponding path program 2 times [2022-12-13 13:21:21,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:21,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653916088] [2022-12-13 13:21:21,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:21,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:21,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:21,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:21,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:21,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653916088] [2022-12-13 13:21:21,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653916088] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:21,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:21,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:21:21,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228841072] [2022-12-13 13:21:21,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:21,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:21:21,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:21,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:21:21,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:21:22,242 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 333 [2022-12-13 13:21:22,243 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 151 transitions, 1749 flow. Second operand has 10 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:22,243 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:22,243 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 333 [2022-12-13 13:21:22,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:24,467 INFO L130 PetriNetUnfolder]: 7961/12406 cut-off events. [2022-12-13 13:21:24,467 INFO L131 PetriNetUnfolder]: For 40272/40272 co-relation queries the response was YES. [2022-12-13 13:21:24,500 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55610 conditions, 12406 events. 7961/12406 cut-off events. For 40272/40272 co-relation queries the response was YES. Maximal size of possible extension queue 621. Compared 79560 event pairs, 2323 based on Foata normal form. 24/12197 useless extension candidates. Maximal degree in co-relation 55576. Up to 7215 conditions per place. [2022-12-13 13:21:24,530 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 219 selfloop transitions, 51 changer transitions 0/270 dead transitions. [2022-12-13 13:21:24,530 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 270 transitions, 3138 flow [2022-12-13 13:21:24,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:21:24,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:21:24,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1126 transitions. [2022-12-13 13:21:24,533 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37570904237570907 [2022-12-13 13:21:24,533 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1126 transitions. [2022-12-13 13:21:24,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1126 transitions. [2022-12-13 13:21:24,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:24,533 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1126 transitions. [2022-12-13 13:21:24,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 125.11111111111111) internal successors, (1126), 9 states have internal predecessors, (1126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:24,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 333.0) internal successors, (3330), 10 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:24,537 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 333.0) internal successors, (3330), 10 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:24,538 INFO L175 Difference]: Start difference. First operand has 106 places, 151 transitions, 1749 flow. Second operand 9 states and 1126 transitions. [2022-12-13 13:21:24,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 270 transitions, 3138 flow [2022-12-13 13:21:25,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 270 transitions, 3085 flow, removed 19 selfloop flow, removed 2 redundant places. [2022-12-13 13:21:25,043 INFO L231 Difference]: Finished difference. Result has 115 places, 166 transitions, 2129 flow [2022-12-13 13:21:25,043 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1696, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2129, PETRI_PLACES=115, PETRI_TRANSITIONS=166} [2022-12-13 13:21:25,044 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 33 predicate places. [2022-12-13 13:21:25,044 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 166 transitions, 2129 flow [2022-12-13 13:21:25,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 114.6) internal successors, (1146), 10 states have internal predecessors, (1146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:25,044 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:25,044 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:25,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 13:21:25,045 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:25,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:25,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2019918404, now seen corresponding path program 3 times [2022-12-13 13:21:25,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:25,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408016250] [2022-12-13 13:21:25,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:25,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:25,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:25,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:25,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408016250] [2022-12-13 13:21:25,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408016250] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:25,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:25,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:21:25,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302435477] [2022-12-13 13:21:25,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:25,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:21:25,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:25,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:21:25,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:21:25,626 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 333 [2022-12-13 13:21:25,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 166 transitions, 2129 flow. Second operand has 10 states, 10 states have (on average 113.6) internal successors, (1136), 10 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:25,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:25,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 333 [2022-12-13 13:21:25,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:27,830 INFO L130 PetriNetUnfolder]: 7299/11232 cut-off events. [2022-12-13 13:21:27,830 INFO L131 PetriNetUnfolder]: For 46994/46994 co-relation queries the response was YES. [2022-12-13 13:21:27,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51295 conditions, 11232 events. 7299/11232 cut-off events. For 46994/46994 co-relation queries the response was YES. Maximal size of possible extension queue 539. Compared 68370 event pairs, 1283 based on Foata normal form. 24/11196 useless extension candidates. Maximal degree in co-relation 51258. Up to 4075 conditions per place. [2022-12-13 13:21:27,889 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 150 selfloop transitions, 81 changer transitions 0/231 dead transitions. [2022-12-13 13:21:27,889 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 231 transitions, 2763 flow [2022-12-13 13:21:27,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:21:27,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:21:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1225 transitions. [2022-12-13 13:21:27,892 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.36786786786786785 [2022-12-13 13:21:27,892 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1225 transitions. [2022-12-13 13:21:27,892 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1225 transitions. [2022-12-13 13:21:27,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:27,893 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1225 transitions. [2022-12-13 13:21:27,895 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 122.5) internal successors, (1225), 10 states have internal predecessors, (1225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:27,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 333.0) internal successors, (3663), 11 states have internal predecessors, (3663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:27,898 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 333.0) internal successors, (3663), 11 states have internal predecessors, (3663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:27,898 INFO L175 Difference]: Start difference. First operand has 115 places, 166 transitions, 2129 flow. Second operand 10 states and 1225 transitions. [2022-12-13 13:21:27,898 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 231 transitions, 2763 flow [2022-12-13 13:21:28,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 231 transitions, 2657 flow, removed 29 selfloop flow, removed 7 redundant places. [2022-12-13 13:21:28,401 INFO L231 Difference]: Finished difference. Result has 116 places, 154 transitions, 1979 flow [2022-12-13 13:21:28,401 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1817, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1979, PETRI_PLACES=116, PETRI_TRANSITIONS=154} [2022-12-13 13:21:28,402 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 34 predicate places. [2022-12-13 13:21:28,402 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 154 transitions, 1979 flow [2022-12-13 13:21:28,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 113.6) internal successors, (1136), 10 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:28,403 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:28,403 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:28,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 13:21:28,403 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:28,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:28,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1612475603, now seen corresponding path program 1 times [2022-12-13 13:21:28,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:28,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572333458] [2022-12-13 13:21:28,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:28,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:28,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:28,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572333458] [2022-12-13 13:21:28,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572333458] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:28,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:28,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:21:28,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975057376] [2022-12-13 13:21:28,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:28,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:21:28,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:28,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:21:28,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:21:28,490 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 333 [2022-12-13 13:21:28,491 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 154 transitions, 1979 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:28,491 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:28,491 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 333 [2022-12-13 13:21:28,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:29,265 INFO L130 PetriNetUnfolder]: 2747/4738 cut-off events. [2022-12-13 13:21:29,265 INFO L131 PetriNetUnfolder]: For 20143/20163 co-relation queries the response was YES. [2022-12-13 13:21:29,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21758 conditions, 4738 events. 2747/4738 cut-off events. For 20143/20163 co-relation queries the response was YES. Maximal size of possible extension queue 291. Compared 29990 event pairs, 525 based on Foata normal form. 113/4828 useless extension candidates. Maximal degree in co-relation 21723. Up to 4282 conditions per place. [2022-12-13 13:21:29,281 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 161 selfloop transitions, 4 changer transitions 1/167 dead transitions. [2022-12-13 13:21:29,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 167 transitions, 2312 flow [2022-12-13 13:21:29,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:21:29,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:21:29,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 428 transitions. [2022-12-13 13:21:29,283 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42842842842842843 [2022-12-13 13:21:29,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 428 transitions. [2022-12-13 13:21:29,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 428 transitions. [2022-12-13 13:21:29,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:29,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 428 transitions. [2022-12-13 13:21:29,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:29,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:29,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 333.0) internal successors, (1332), 4 states have internal predecessors, (1332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:29,285 INFO L175 Difference]: Start difference. First operand has 116 places, 154 transitions, 1979 flow. Second operand 3 states and 428 transitions. [2022-12-13 13:21:29,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 167 transitions, 2312 flow [2022-12-13 13:21:29,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 167 transitions, 2054 flow, removed 19 selfloop flow, removed 11 redundant places. [2022-12-13 13:21:29,362 INFO L231 Difference]: Finished difference. Result has 106 places, 142 transitions, 1568 flow [2022-12-13 13:21:29,362 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1568, PETRI_PLACES=106, PETRI_TRANSITIONS=142} [2022-12-13 13:21:29,363 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 24 predicate places. [2022-12-13 13:21:29,363 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 142 transitions, 1568 flow [2022-12-13 13:21:29,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:29,363 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:29,363 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:29,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 13:21:29,363 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:29,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:29,363 INFO L85 PathProgramCache]: Analyzing trace with hash -741852959, now seen corresponding path program 1 times [2022-12-13 13:21:29,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:29,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486483112] [2022-12-13 13:21:29,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:29,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:29,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:29,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:29,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:29,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486483112] [2022-12-13 13:21:29,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486483112] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:29,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:29,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:21:29,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004615737] [2022-12-13 13:21:29,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:29,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:21:29,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:29,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:21:29,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:21:29,883 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 333 [2022-12-13 13:21:29,884 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 142 transitions, 1568 flow. Second operand has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:29,884 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:29,884 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 333 [2022-12-13 13:21:29,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:31,560 INFO L130 PetriNetUnfolder]: 4998/8679 cut-off events. [2022-12-13 13:21:31,560 INFO L131 PetriNetUnfolder]: For 25716/25775 co-relation queries the response was YES. [2022-12-13 13:21:31,577 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38770 conditions, 8679 events. 4998/8679 cut-off events. For 25716/25775 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 61697 event pairs, 1379 based on Foata normal form. 49/8672 useless extension candidates. Maximal degree in co-relation 38737. Up to 4713 conditions per place. [2022-12-13 13:21:31,591 INFO L137 encePairwiseOnDemand]: 320/333 looper letters, 257 selfloop transitions, 84 changer transitions 3/345 dead transitions. [2022-12-13 13:21:31,591 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 345 transitions, 4255 flow [2022-12-13 13:21:31,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 13:21:31,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 13:21:31,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1293 transitions. [2022-12-13 13:21:31,594 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.38828828828828826 [2022-12-13 13:21:31,594 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1293 transitions. [2022-12-13 13:21:31,594 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1293 transitions. [2022-12-13 13:21:31,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:31,594 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1293 transitions. [2022-12-13 13:21:31,596 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 129.3) internal successors, (1293), 10 states have internal predecessors, (1293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:31,597 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 333.0) internal successors, (3663), 11 states have internal predecessors, (3663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:31,598 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 333.0) internal successors, (3663), 11 states have internal predecessors, (3663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:31,598 INFO L175 Difference]: Start difference. First operand has 106 places, 142 transitions, 1568 flow. Second operand 10 states and 1293 transitions. [2022-12-13 13:21:31,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 345 transitions, 4255 flow [2022-12-13 13:21:31,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 345 transitions, 4242 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:21:31,820 INFO L231 Difference]: Finished difference. Result has 119 places, 218 transitions, 2811 flow [2022-12-13 13:21:31,820 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1564, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=2811, PETRI_PLACES=119, PETRI_TRANSITIONS=218} [2022-12-13 13:21:31,820 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 37 predicate places. [2022-12-13 13:21:31,820 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 218 transitions, 2811 flow [2022-12-13 13:21:31,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 119.0) internal successors, (952), 8 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:31,820 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:31,820 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:31,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 13:21:31,821 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash 1225007947, now seen corresponding path program 2 times [2022-12-13 13:21:31,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:31,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754259884] [2022-12-13 13:21:31,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:31,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:32,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:32,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:32,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754259884] [2022-12-13 13:21:32,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754259884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:32,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:32,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:21:32,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466719133] [2022-12-13 13:21:32,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:32,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:21:32,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:32,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:21:32,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:21:32,615 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 333 [2022-12-13 13:21:32,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 218 transitions, 2811 flow. Second operand has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:32,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:32,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 333 [2022-12-13 13:21:32,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:35,053 INFO L130 PetriNetUnfolder]: 7858/13783 cut-off events. [2022-12-13 13:21:35,053 INFO L131 PetriNetUnfolder]: For 66592/66644 co-relation queries the response was YES. [2022-12-13 13:21:35,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 68989 conditions, 13783 events. 7858/13783 cut-off events. For 66592/66644 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 109234 event pairs, 1886 based on Foata normal form. 69/13763 useless extension candidates. Maximal degree in co-relation 68951. Up to 8366 conditions per place. [2022-12-13 13:21:35,132 INFO L137 encePairwiseOnDemand]: 326/333 looper letters, 370 selfloop transitions, 75 changer transitions 19/465 dead transitions. [2022-12-13 13:21:35,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 465 transitions, 6781 flow [2022-12-13 13:21:35,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:21:35,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:21:35,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 812 transitions. [2022-12-13 13:21:35,136 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4064064064064064 [2022-12-13 13:21:35,136 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 812 transitions. [2022-12-13 13:21:35,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 812 transitions. [2022-12-13 13:21:35,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:35,136 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 812 transitions. [2022-12-13 13:21:35,137 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 135.33333333333334) internal successors, (812), 6 states have internal predecessors, (812), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:35,139 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:35,139 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:35,139 INFO L175 Difference]: Start difference. First operand has 119 places, 218 transitions, 2811 flow. Second operand 6 states and 812 transitions. [2022-12-13 13:21:35,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 465 transitions, 6781 flow [2022-12-13 13:21:36,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 465 transitions, 6714 flow, removed 33 selfloop flow, removed 1 redundant places. [2022-12-13 13:21:36,234 INFO L231 Difference]: Finished difference. Result has 126 places, 276 transitions, 3674 flow [2022-12-13 13:21:36,234 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=2760, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3674, PETRI_PLACES=126, PETRI_TRANSITIONS=276} [2022-12-13 13:21:36,234 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 44 predicate places. [2022-12-13 13:21:36,234 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 276 transitions, 3674 flow [2022-12-13 13:21:36,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:36,234 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:36,234 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:36,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 13:21:36,235 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:36,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:36,235 INFO L85 PathProgramCache]: Analyzing trace with hash -179818315, now seen corresponding path program 3 times [2022-12-13 13:21:36,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:36,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222816356] [2022-12-13 13:21:36,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:36,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:36,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:36,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222816356] [2022-12-13 13:21:36,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [222816356] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:36,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:36,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:21:36,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306750529] [2022-12-13 13:21:36,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:36,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:21:36,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:36,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:21:36,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:21:36,346 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 333 [2022-12-13 13:21:36,346 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 276 transitions, 3674 flow. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:36,346 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:36,347 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 333 [2022-12-13 13:21:36,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:37,196 INFO L130 PetriNetUnfolder]: 1963/4092 cut-off events. [2022-12-13 13:21:37,197 INFO L131 PetriNetUnfolder]: For 20146/20154 co-relation queries the response was YES. [2022-12-13 13:21:37,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20895 conditions, 4092 events. 1963/4092 cut-off events. For 20146/20154 co-relation queries the response was YES. Maximal size of possible extension queue 198. Compared 30902 event pairs, 198 based on Foata normal form. 346/4420 useless extension candidates. Maximal degree in co-relation 20854. Up to 2219 conditions per place. [2022-12-13 13:21:37,214 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 216 selfloop transitions, 7 changer transitions 36/260 dead transitions. [2022-12-13 13:21:37,214 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 260 transitions, 3418 flow [2022-12-13 13:21:37,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:21:37,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:21:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 567 transitions. [2022-12-13 13:21:37,215 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42567567567567566 [2022-12-13 13:21:37,215 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 567 transitions. [2022-12-13 13:21:37,215 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 567 transitions. [2022-12-13 13:21:37,215 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:37,215 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 567 transitions. [2022-12-13 13:21:37,216 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:37,217 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:37,217 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 333.0) internal successors, (1665), 5 states have internal predecessors, (1665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:37,217 INFO L175 Difference]: Start difference. First operand has 126 places, 276 transitions, 3674 flow. Second operand 4 states and 567 transitions. [2022-12-13 13:21:37,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 260 transitions, 3418 flow [2022-12-13 13:21:37,297 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 260 transitions, 3249 flow, removed 70 selfloop flow, removed 7 redundant places. [2022-12-13 13:21:37,299 INFO L231 Difference]: Finished difference. Result has 118 places, 149 transitions, 1604 flow [2022-12-13 13:21:37,299 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1958, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=168, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1604, PETRI_PLACES=118, PETRI_TRANSITIONS=149} [2022-12-13 13:21:37,299 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 36 predicate places. [2022-12-13 13:21:37,299 INFO L495 AbstractCegarLoop]: Abstraction has has 118 places, 149 transitions, 1604 flow [2022-12-13 13:21:37,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:37,299 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:37,299 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:37,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 13:21:37,300 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:37,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:37,300 INFO L85 PathProgramCache]: Analyzing trace with hash 552090458, now seen corresponding path program 1 times [2022-12-13 13:21:37,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:37,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677141945] [2022-12-13 13:21:37,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:37,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:38,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:38,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677141945] [2022-12-13 13:21:38,129 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677141945] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:38,129 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:38,129 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:21:38,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099710577] [2022-12-13 13:21:38,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:38,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:21:38,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:38,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:21:38,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:21:38,211 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 333 [2022-12-13 13:21:38,212 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 149 transitions, 1604 flow. Second operand has 8 states, 8 states have (on average 123.25) internal successors, (986), 8 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:38,212 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:38,212 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 333 [2022-12-13 13:21:38,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:39,494 INFO L130 PetriNetUnfolder]: 2488/5632 cut-off events. [2022-12-13 13:21:39,494 INFO L131 PetriNetUnfolder]: For 22689/22709 co-relation queries the response was YES. [2022-12-13 13:21:39,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28811 conditions, 5632 events. 2488/5632 cut-off events. For 22689/22709 co-relation queries the response was YES. Maximal size of possible extension queue 314. Compared 48389 event pairs, 527 based on Foata normal form. 21/5628 useless extension candidates. Maximal degree in co-relation 28775. Up to 3129 conditions per place. [2022-12-13 13:21:39,517 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 230 selfloop transitions, 29 changer transitions 3/263 dead transitions. [2022-12-13 13:21:39,517 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 263 transitions, 3256 flow [2022-12-13 13:21:39,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:21:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:21:39,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 808 transitions. [2022-12-13 13:21:39,518 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4044044044044044 [2022-12-13 13:21:39,518 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 808 transitions. [2022-12-13 13:21:39,519 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 808 transitions. [2022-12-13 13:21:39,519 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:39,519 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 808 transitions. [2022-12-13 13:21:39,520 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:39,521 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:39,521 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:39,521 INFO L175 Difference]: Start difference. First operand has 118 places, 149 transitions, 1604 flow. Second operand 6 states and 808 transitions. [2022-12-13 13:21:39,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 263 transitions, 3256 flow [2022-12-13 13:21:39,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 263 transitions, 3169 flow, removed 10 selfloop flow, removed 4 redundant places. [2022-12-13 13:21:39,655 INFO L231 Difference]: Finished difference. Result has 120 places, 158 transitions, 1765 flow [2022-12-13 13:21:39,655 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1553, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1765, PETRI_PLACES=120, PETRI_TRANSITIONS=158} [2022-12-13 13:21:39,655 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 38 predicate places. [2022-12-13 13:21:39,655 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 158 transitions, 1765 flow [2022-12-13 13:21:39,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 123.25) internal successors, (986), 8 states have internal predecessors, (986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:39,655 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:39,655 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:39,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 13:21:39,656 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:39,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:39,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1263937778, now seen corresponding path program 1 times [2022-12-13 13:21:39,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:39,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263199748] [2022-12-13 13:21:39,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:39,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:39,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:40,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-12-13 13:21:40,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:40,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263199748] [2022-12-13 13:21:40,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263199748] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:40,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:40,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:21:40,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308658234] [2022-12-13 13:21:40,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:40,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:21:40,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:40,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:21:40,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:21:40,458 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 333 [2022-12-13 13:21:40,459 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 158 transitions, 1765 flow. Second operand has 7 states, 7 states have (on average 125.57142857142857) internal successors, (879), 7 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:40,459 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:40,459 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 333 [2022-12-13 13:21:40,459 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:41,790 INFO L130 PetriNetUnfolder]: 2906/6664 cut-off events. [2022-12-13 13:21:41,791 INFO L131 PetriNetUnfolder]: For 31030/31050 co-relation queries the response was YES. [2022-12-13 13:21:41,809 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33961 conditions, 6664 events. 2906/6664 cut-off events. For 31030/31050 co-relation queries the response was YES. Maximal size of possible extension queue 375. Compared 59827 event pairs, 946 based on Foata normal form. 25/6689 useless extension candidates. Maximal degree in co-relation 33924. Up to 3982 conditions per place. [2022-12-13 13:21:41,820 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 212 selfloop transitions, 32 changer transitions 9/254 dead transitions. [2022-12-13 13:21:41,821 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 254 transitions, 3202 flow [2022-12-13 13:21:41,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:21:41,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:21:41,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 816 transitions. [2022-12-13 13:21:41,822 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4084084084084084 [2022-12-13 13:21:41,822 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 816 transitions. [2022-12-13 13:21:41,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 816 transitions. [2022-12-13 13:21:41,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:41,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 816 transitions. [2022-12-13 13:21:41,824 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:41,825 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:41,825 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:41,825 INFO L175 Difference]: Start difference. First operand has 120 places, 158 transitions, 1765 flow. Second operand 6 states and 816 transitions. [2022-12-13 13:21:41,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 254 transitions, 3202 flow [2022-12-13 13:21:41,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 254 transitions, 3201 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:21:41,993 INFO L231 Difference]: Finished difference. Result has 126 places, 167 transitions, 1961 flow [2022-12-13 13:21:41,993 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1756, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=157, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1961, PETRI_PLACES=126, PETRI_TRANSITIONS=167} [2022-12-13 13:21:41,993 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 44 predicate places. [2022-12-13 13:21:41,993 INFO L495 AbstractCegarLoop]: Abstraction has has 126 places, 167 transitions, 1961 flow [2022-12-13 13:21:41,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 125.57142857142857) internal successors, (879), 7 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:41,993 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:41,993 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:41,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 13:21:41,994 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:41,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:41,994 INFO L85 PathProgramCache]: Analyzing trace with hash 40659102, now seen corresponding path program 2 times [2022-12-13 13:21:41,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:41,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782287283] [2022-12-13 13:21:41,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:41,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:42,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:42,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:42,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:42,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782287283] [2022-12-13 13:21:42,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782287283] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:42,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:42,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:21:42,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845769687] [2022-12-13 13:21:42,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:42,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:21:42,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:42,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:21:42,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:21:42,430 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 333 [2022-12-13 13:21:42,430 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 167 transitions, 1961 flow. Second operand has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:42,431 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:42,431 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 333 [2022-12-13 13:21:42,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:43,914 INFO L130 PetriNetUnfolder]: 3249/7567 cut-off events. [2022-12-13 13:21:43,914 INFO L131 PetriNetUnfolder]: For 42455/42604 co-relation queries the response was YES. [2022-12-13 13:21:43,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40622 conditions, 7567 events. 3249/7567 cut-off events. For 42455/42604 co-relation queries the response was YES. Maximal size of possible extension queue 424. Compared 70646 event pairs, 758 based on Foata normal form. 119/7686 useless extension candidates. Maximal degree in co-relation 40582. Up to 3821 conditions per place. [2022-12-13 13:21:43,944 INFO L137 encePairwiseOnDemand]: 325/333 looper letters, 228 selfloop transitions, 30 changer transitions 16/275 dead transitions. [2022-12-13 13:21:43,944 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 275 transitions, 3567 flow [2022-12-13 13:21:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:21:43,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:21:43,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 820 transitions. [2022-12-13 13:21:43,945 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41041041041041043 [2022-12-13 13:21:43,945 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 820 transitions. [2022-12-13 13:21:43,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 820 transitions. [2022-12-13 13:21:43,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:43,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 820 transitions. [2022-12-13 13:21:43,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 136.66666666666666) internal successors, (820), 6 states have internal predecessors, (820), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:43,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:43,948 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 333.0) internal successors, (2331), 7 states have internal predecessors, (2331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:43,948 INFO L175 Difference]: Start difference. First operand has 126 places, 167 transitions, 1961 flow. Second operand 6 states and 820 transitions. [2022-12-13 13:21:43,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 275 transitions, 3567 flow [2022-12-13 13:21:44,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 275 transitions, 3562 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 13:21:44,153 INFO L231 Difference]: Finished difference. Result has 133 places, 175 transitions, 2160 flow [2022-12-13 13:21:44,153 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1956, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=167, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2160, PETRI_PLACES=133, PETRI_TRANSITIONS=175} [2022-12-13 13:21:44,154 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 51 predicate places. [2022-12-13 13:21:44,154 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 175 transitions, 2160 flow [2022-12-13 13:21:44,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.0) internal successors, (762), 6 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:44,154 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:44,154 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:44,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 13:21:44,154 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:44,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:44,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1998168634, now seen corresponding path program 3 times [2022-12-13 13:21:44,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:44,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282577149] [2022-12-13 13:21:44,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:44,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:44,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:45,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:45,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:45,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282577149] [2022-12-13 13:21:45,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282577149] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:45,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:45,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 13:21:45,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985270145] [2022-12-13 13:21:45,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:45,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 13:21:45,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:45,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 13:21:45,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-12-13 13:21:45,272 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 333 [2022-12-13 13:21:45,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 175 transitions, 2160 flow. Second operand has 11 states, 11 states have (on average 117.63636363636364) internal successors, (1294), 11 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:45,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:45,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 333 [2022-12-13 13:21:45,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:47,400 INFO L130 PetriNetUnfolder]: 3746/8800 cut-off events. [2022-12-13 13:21:47,400 INFO L131 PetriNetUnfolder]: For 57064/57089 co-relation queries the response was YES. [2022-12-13 13:21:47,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48906 conditions, 8800 events. 3746/8800 cut-off events. For 57064/57089 co-relation queries the response was YES. Maximal size of possible extension queue 518. Compared 84960 event pairs, 545 based on Foata normal form. 26/8814 useless extension candidates. Maximal degree in co-relation 48863. Up to 4404 conditions per place. [2022-12-13 13:21:47,444 INFO L137 encePairwiseOnDemand]: 321/333 looper letters, 200 selfloop transitions, 91 changer transitions 23/315 dead transitions. [2022-12-13 13:21:47,445 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 315 transitions, 4056 flow [2022-12-13 13:21:47,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 13:21:47,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 13:21:47,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1387 transitions. [2022-12-13 13:21:47,447 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.37865137865137866 [2022-12-13 13:21:47,447 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1387 transitions. [2022-12-13 13:21:47,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1387 transitions. [2022-12-13 13:21:47,447 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:47,448 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1387 transitions. [2022-12-13 13:21:47,449 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 126.0909090909091) internal successors, (1387), 11 states have internal predecessors, (1387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:47,451 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 333.0) internal successors, (3996), 12 states have internal predecessors, (3996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:47,451 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 333.0) internal successors, (3996), 12 states have internal predecessors, (3996), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:47,451 INFO L175 Difference]: Start difference. First operand has 133 places, 175 transitions, 2160 flow. Second operand 11 states and 1387 transitions. [2022-12-13 13:21:47,451 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 315 transitions, 4056 flow [2022-12-13 13:21:47,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 315 transitions, 4019 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-12-13 13:21:47,824 INFO L231 Difference]: Finished difference. Result has 147 places, 204 transitions, 2851 flow [2022-12-13 13:21:47,824 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=67, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=2851, PETRI_PLACES=147, PETRI_TRANSITIONS=204} [2022-12-13 13:21:47,824 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 65 predicate places. [2022-12-13 13:21:47,825 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 204 transitions, 2851 flow [2022-12-13 13:21:47,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 117.63636363636364) internal successors, (1294), 11 states have internal predecessors, (1294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:47,825 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:47,825 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:47,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 13:21:47,825 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:47,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:47,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1630448208, now seen corresponding path program 4 times [2022-12-13 13:21:47,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:47,825 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69264693] [2022-12-13 13:21:47,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:48,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:48,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69264693] [2022-12-13 13:21:48,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69264693] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:48,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:48,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:21:48,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936322800] [2022-12-13 13:21:48,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:48,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:21:48,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:48,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:21:48,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:21:48,973 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 333 [2022-12-13 13:21:48,973 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 204 transitions, 2851 flow. Second operand has 7 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:48,973 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:48,973 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 333 [2022-12-13 13:21:48,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:50,747 INFO L130 PetriNetUnfolder]: 3530/8646 cut-off events. [2022-12-13 13:21:50,748 INFO L131 PetriNetUnfolder]: For 73894/73917 co-relation queries the response was YES. [2022-12-13 13:21:50,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51058 conditions, 8646 events. 3530/8646 cut-off events. For 73894/73917 co-relation queries the response was YES. Maximal size of possible extension queue 528. Compared 85460 event pairs, 1087 based on Foata normal form. 24/8670 useless extension candidates. Maximal degree in co-relation 51009. Up to 6198 conditions per place. [2022-12-13 13:21:50,802 INFO L137 encePairwiseOnDemand]: 327/333 looper letters, 203 selfloop transitions, 47 changer transitions 8/259 dead transitions. [2022-12-13 13:21:50,802 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 259 transitions, 3982 flow [2022-12-13 13:21:50,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:21:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:21:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2022-12-13 13:21:50,804 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.393993993993994 [2022-12-13 13:21:50,804 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2022-12-13 13:21:50,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2022-12-13 13:21:50,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:50,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2022-12-13 13:21:50,805 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:50,806 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:50,807 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:50,807 INFO L175 Difference]: Start difference. First operand has 147 places, 204 transitions, 2851 flow. Second operand 5 states and 656 transitions. [2022-12-13 13:21:50,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 259 transitions, 3982 flow [2022-12-13 13:21:51,327 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 259 transitions, 3900 flow, removed 37 selfloop flow, removed 2 redundant places. [2022-12-13 13:21:51,329 INFO L231 Difference]: Finished difference. Result has 151 places, 206 transitions, 2955 flow [2022-12-13 13:21:51,329 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=2775, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=2955, PETRI_PLACES=151, PETRI_TRANSITIONS=206} [2022-12-13 13:21:51,330 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 69 predicate places. [2022-12-13 13:21:51,330 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 206 transitions, 2955 flow [2022-12-13 13:21:51,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.57142857142857) internal successors, (858), 7 states have internal predecessors, (858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:51,330 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:51,330 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:51,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 13:21:51,330 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:51,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:51,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1235112874, now seen corresponding path program 2 times [2022-12-13 13:21:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:51,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029959502] [2022-12-13 13:21:51,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:51,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:51,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:52,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:52,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:52,012 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029959502] [2022-12-13 13:21:52,012 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029959502] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:52,012 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:52,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 13:21:52,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064322918] [2022-12-13 13:21:52,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:52,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 13:21:52,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:52,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 13:21:52,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-12-13 13:21:52,098 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 333 [2022-12-13 13:21:52,099 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 206 transitions, 2955 flow. Second operand has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:52,099 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:52,099 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 333 [2022-12-13 13:21:52,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:54,262 INFO L130 PetriNetUnfolder]: 3741/9044 cut-off events. [2022-12-13 13:21:54,262 INFO L131 PetriNetUnfolder]: For 85269/85429 co-relation queries the response was YES. [2022-12-13 13:21:54,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54614 conditions, 9044 events. 3741/9044 cut-off events. For 85269/85429 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 89167 event pairs, 1177 based on Foata normal form. 126/9169 useless extension candidates. Maximal degree in co-relation 54564. Up to 4976 conditions per place. [2022-12-13 13:21:54,326 INFO L137 encePairwiseOnDemand]: 322/333 looper letters, 242 selfloop transitions, 61 changer transitions 7/311 dead transitions. [2022-12-13 13:21:54,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 311 transitions, 4725 flow [2022-12-13 13:21:54,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 13:21:54,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 13:21:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1151 transitions. [2022-12-13 13:21:54,329 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3840507173840507 [2022-12-13 13:21:54,329 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1151 transitions. [2022-12-13 13:21:54,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1151 transitions. [2022-12-13 13:21:54,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:54,330 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1151 transitions. [2022-12-13 13:21:54,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 127.88888888888889) internal successors, (1151), 9 states have internal predecessors, (1151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:54,335 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 333.0) internal successors, (3330), 10 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:54,336 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 333.0) internal successors, (3330), 10 states have internal predecessors, (3330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:54,336 INFO L175 Difference]: Start difference. First operand has 151 places, 206 transitions, 2955 flow. Second operand 9 states and 1151 transitions. [2022-12-13 13:21:54,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 311 transitions, 4725 flow [2022-12-13 13:21:54,918 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 311 transitions, 4647 flow, removed 7 selfloop flow, removed 3 redundant places. [2022-12-13 13:21:54,922 INFO L231 Difference]: Finished difference. Result has 159 places, 211 transitions, 3136 flow [2022-12-13 13:21:54,922 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=2895, PETRI_DIFFERENCE_MINUEND_PLACES=148, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=57, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=3136, PETRI_PLACES=159, PETRI_TRANSITIONS=211} [2022-12-13 13:21:54,922 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 77 predicate places. [2022-12-13 13:21:54,922 INFO L495 AbstractCegarLoop]: Abstraction has has 159 places, 211 transitions, 3136 flow [2022-12-13 13:21:54,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 119.0) internal successors, (1071), 9 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:54,922 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:54,923 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:54,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 13:21:54,923 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:54,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:54,923 INFO L85 PathProgramCache]: Analyzing trace with hash 748919636, now seen corresponding path program 3 times [2022-12-13 13:21:54,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:54,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660393758] [2022-12-13 13:21:54,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:54,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:55,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:55,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660393758] [2022-12-13 13:21:55,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660393758] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:55,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:55,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:21:55,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497366099] [2022-12-13 13:21:55,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:55,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:21:55,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:55,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:21:55,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:21:55,090 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 333 [2022-12-13 13:21:55,091 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 211 transitions, 3136 flow. Second operand has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 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-12-13 13:21:55,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:55,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 333 [2022-12-13 13:21:55,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:56,500 INFO L130 PetriNetUnfolder]: 2063/4620 cut-off events. [2022-12-13 13:21:56,500 INFO L131 PetriNetUnfolder]: For 55237/55360 co-relation queries the response was YES. [2022-12-13 13:21:56,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28926 conditions, 4620 events. 2063/4620 cut-off events. For 55237/55360 co-relation queries the response was YES. Maximal size of possible extension queue 525. Compared 41119 event pairs, 130 based on Foata normal form. 406/5006 useless extension candidates. Maximal degree in co-relation 28874. Up to 2041 conditions per place. [2022-12-13 13:21:56,527 INFO L137 encePairwiseOnDemand]: 328/333 looper letters, 98 selfloop transitions, 10 changer transitions 167/276 dead transitions. [2022-12-13 13:21:56,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 276 transitions, 4635 flow [2022-12-13 13:21:56,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:21:56,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:21:56,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 687 transitions. [2022-12-13 13:21:56,529 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4126126126126126 [2022-12-13 13:21:56,530 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 687 transitions. [2022-12-13 13:21:56,530 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 687 transitions. [2022-12-13 13:21:56,530 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:56,530 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 687 transitions. [2022-12-13 13:21:56,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 137.4) internal successors, (687), 5 states have internal predecessors, (687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:56,533 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:56,533 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 333.0) internal successors, (1998), 6 states have internal predecessors, (1998), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:56,533 INFO L175 Difference]: Start difference. First operand has 159 places, 211 transitions, 3136 flow. Second operand 5 states and 687 transitions. [2022-12-13 13:21:56,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 276 transitions, 4635 flow [2022-12-13 13:21:56,663 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 276 transitions, 4118 flow, removed 117 selfloop flow, removed 20 redundant places. [2022-12-13 13:21:56,667 INFO L231 Difference]: Finished difference. Result has 132 places, 67 transitions, 861 flow [2022-12-13 13:21:56,667 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=1668, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=861, PETRI_PLACES=132, PETRI_TRANSITIONS=67} [2022-12-13 13:21:56,667 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 50 predicate places. [2022-12-13 13:21:56,667 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 67 transitions, 861 flow [2022-12-13 13:21:56,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.6) internal successors, (653), 5 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-12-13 13:21:56,668 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:56,668 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:56,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 13:21:56,668 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:56,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:56,668 INFO L85 PathProgramCache]: Analyzing trace with hash -750540881, now seen corresponding path program 1 times [2022-12-13 13:21:56,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:56,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178199311] [2022-12-13 13:21:56,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:56,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:56,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:21:57,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:21:57,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 13:21:57,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178199311] [2022-12-13 13:21:57,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178199311] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:21:57,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:21:57,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 13:21:57,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678140696] [2022-12-13 13:21:57,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:21:57,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 13:21:57,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 13:21:57,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 13:21:57,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-12-13 13:21:58,008 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 333 [2022-12-13 13:21:58,009 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 67 transitions, 861 flow. Second operand has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:58,009 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:21:58,009 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 333 [2022-12-13 13:21:58,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:21:58,335 INFO L130 PetriNetUnfolder]: 201/446 cut-off events. [2022-12-13 13:21:58,336 INFO L131 PetriNetUnfolder]: For 4561/4567 co-relation queries the response was YES. [2022-12-13 13:21:58,337 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2843 conditions, 446 events. 201/446 cut-off events. For 4561/4567 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 2174 event pairs, 47 based on Foata normal form. 7/453 useless extension candidates. Maximal degree in co-relation 2803. Up to 163 conditions per place. [2022-12-13 13:21:58,339 INFO L137 encePairwiseOnDemand]: 326/333 looper letters, 45 selfloop transitions, 9 changer transitions 55/110 dead transitions. [2022-12-13 13:21:58,339 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 110 transitions, 1443 flow [2022-12-13 13:21:58,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 13:21:58,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 13:21:58,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 991 transitions. [2022-12-13 13:21:58,341 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.371996996996997 [2022-12-13 13:21:58,341 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 991 transitions. [2022-12-13 13:21:58,341 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 991 transitions. [2022-12-13 13:21:58,341 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:21:58,341 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 991 transitions. [2022-12-13 13:21:58,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 123.875) internal successors, (991), 8 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:58,344 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 333.0) internal successors, (2997), 9 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:58,345 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 333.0) internal successors, (2997), 9 states have internal predecessors, (2997), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:58,345 INFO L175 Difference]: Start difference. First operand has 132 places, 67 transitions, 861 flow. Second operand 8 states and 991 transitions. [2022-12-13 13:21:58,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 110 transitions, 1443 flow [2022-12-13 13:21:58,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 110 transitions, 1154 flow, removed 75 selfloop flow, removed 26 redundant places. [2022-12-13 13:21:58,353 INFO L231 Difference]: Finished difference. Result has 93 places, 45 transitions, 435 flow [2022-12-13 13:21:58,354 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=333, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=435, PETRI_PLACES=93, PETRI_TRANSITIONS=45} [2022-12-13 13:21:58,354 INFO L288 CegarLoopForPetriNet]: 82 programPoint places, 11 predicate places. [2022-12-13 13:21:58,354 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 45 transitions, 435 flow [2022-12-13 13:21:58,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 119.0) internal successors, (1190), 10 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:21:58,354 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:21:58,355 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:58,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 13:21:58,355 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:21:58,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:21:58,355 INFO L85 PathProgramCache]: Analyzing trace with hash 517655605, now seen corresponding path program 2 times [2022-12-13 13:21:58,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 13:21:58,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089409604] [2022-12-13 13:21:58,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:21:58,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 13:21:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:21:58,395 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:21:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:21:58,467 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 13:21:58,467 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 13:21:58,468 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2022-12-13 13:21:58,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2022-12-13 13:21:58,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2022-12-13 13:21:58,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2022-12-13 13:21:58,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2022-12-13 13:21:58,469 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2022-12-13 13:21:58,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2022-12-13 13:21:58,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2022-12-13 13:21:58,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2022-12-13 13:21:58,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2022-12-13 13:21:58,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2022-12-13 13:21:58,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2022-12-13 13:21:58,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2022-12-13 13:21:58,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2022-12-13 13:21:58,470 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2022-12-13 13:21:58,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2022-12-13 13:21:58,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2022-12-13 13:21:58,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2022-12-13 13:21:58,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2022-12-13 13:21:58,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2022-12-13 13:21:58,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2022-12-13 13:21:58,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2022-12-13 13:21:58,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2022-12-13 13:21:58,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2022-12-13 13:21:58,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2022-12-13 13:21:58,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2022-12-13 13:21:58,471 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2022-12-13 13:21:58,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2022-12-13 13:21:58,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2022-12-13 13:21:58,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2022-12-13 13:21:58,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2022-12-13 13:21:58,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2022-12-13 13:21:58,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2022-12-13 13:21:58,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2022-12-13 13:21:58,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2022-12-13 13:21:58,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2022-12-13 13:21:58,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2022-12-13 13:21:58,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2022-12-13 13:21:58,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2022-12-13 13:21:58,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2022-12-13 13:21:58,472 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2022-12-13 13:21:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2022-12-13 13:21:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2022-12-13 13:21:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2022-12-13 13:21:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2022-12-13 13:21:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2022-12-13 13:21:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2022-12-13 13:21:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2022-12-13 13:21:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2022-12-13 13:21:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2022-12-13 13:21:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2022-12-13 13:21:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2022-12-13 13:21:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2022-12-13 13:21:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2022-12-13 13:21:58,473 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2022-12-13 13:21:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2022-12-13 13:21:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2022-12-13 13:21:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2022-12-13 13:21:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2022-12-13 13:21:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2022-12-13 13:21:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2022-12-13 13:21:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2022-12-13 13:21:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2022-12-13 13:21:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2022-12-13 13:21:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2022-12-13 13:21:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2022-12-13 13:21:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2022-12-13 13:21:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2022-12-13 13:21:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2022-12-13 13:21:58,474 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2022-12-13 13:21:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2022-12-13 13:21:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2022-12-13 13:21:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2022-12-13 13:21:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2022-12-13 13:21:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2022-12-13 13:21:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2022-12-13 13:21:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2022-12-13 13:21:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2022-12-13 13:21:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2022-12-13 13:21:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2022-12-13 13:21:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2022-12-13 13:21:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2022-12-13 13:21:58,475 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2022-12-13 13:21:58,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2022-12-13 13:21:58,476 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2022-12-13 13:21:58,476 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 13:21:58,476 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:21:58,481 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:21:58,481 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:21:58,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:21:58 BasicIcfg [2022-12-13 13:21:58,547 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:21:58,548 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:21:58,548 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:21:58,548 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:21:58,548 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:20:52" (3/4) ... [2022-12-13 13:21:58,550 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 13:21:58,550 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:21:58,551 INFO L158 Benchmark]: Toolchain (without parser) took 67643.42ms. Allocated memory was 157.3MB in the beginning and 2.5GB in the end (delta: 2.4GB). Free memory was 117.5MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 354.5MB. Max. memory is 16.1GB. [2022-12-13 13:21:58,551 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory is still 49.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:21:58,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.09ms. Allocated memory is still 157.3MB. Free memory was 117.1MB in the beginning and 90.3MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 13:21:58,552 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.42ms. Allocated memory is still 157.3MB. Free memory was 90.3MB in the beginning and 87.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 13:21:58,552 INFO L158 Benchmark]: Boogie Preprocessor took 29.54ms. Allocated memory is still 157.3MB. Free memory was 87.7MB in the beginning and 85.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:21:58,553 INFO L158 Benchmark]: RCFGBuilder took 836.09ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 85.1MB in the beginning and 148.0MB in the end (delta: -62.8MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. [2022-12-13 13:21:58,553 INFO L158 Benchmark]: TraceAbstraction took 66340.79ms. Allocated memory was 188.7MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 146.8MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 350.4MB. Max. memory is 16.1GB. [2022-12-13 13:21:58,553 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 2.5GB. Free memory is still 2.1GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:21:58,555 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 100.7MB. Free memory is still 49.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.09ms. Allocated memory is still 157.3MB. Free memory was 117.1MB in the beginning and 90.3MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.42ms. Allocated memory is still 157.3MB. Free memory was 90.3MB in the beginning and 87.7MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.54ms. Allocated memory is still 157.3MB. Free memory was 87.7MB in the beginning and 85.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 836.09ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 85.1MB in the beginning and 148.0MB in the end (delta: -62.8MB). Peak memory consumption was 53.1MB. Max. memory is 16.1GB. * TraceAbstraction took 66340.79ms. Allocated memory was 188.7MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 146.8MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 350.4MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 2.5GB. Free memory is still 2.1GB. 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: 4.9s, 186 PlacesBefore, 82 PlacesAfterwards, 178 TransitionsBefore, 72 TransitionsAfterwards, 7128 CoEnabledTransitionPairs, 7 FixpointIterations, 71 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 2 ChoiceCompositions, 152 TotalNumberOfCompositions, 34739 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 9793, independent: 9194, independent conditional: 0, independent unconditional: 9194, dependent: 599, dependent conditional: 0, dependent unconditional: 599, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2969, independent: 2892, independent conditional: 0, independent unconditional: 2892, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 9793, independent: 6302, independent conditional: 0, independent unconditional: 6302, dependent: 522, dependent conditional: 0, dependent unconditional: 522, unknown: 2969, unknown conditional: 0, unknown unconditional: 2969] , Statistics on independence cache: Total cache size (in pairs): 411, Positive cache size: 366, Positive conditional cache size: 0, Positive unconditional cache size: 366, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2216; [L850] FCALL, FORK 0 pthread_create(&t2216, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2216, ((void *)0), P0, ((void *)0))=-2, t2216={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L851] 0 pthread_t t2217; [L852] FCALL, FORK 0 pthread_create(&t2217, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2217, ((void *)0), P1, ((void *)0))=-1, t2216={6:0}, t2217={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L853] 0 pthread_t t2218; [L854] FCALL, FORK 0 pthread_create(&t2218, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2218, ((void *)0), P2, ((void *)0))=0, t2216={6:0}, t2217={7:0}, t2218={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 \read(x) [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3: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] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3: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=1] [L761] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3: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=1] [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=0, weak$$choice2=0, x={3: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=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] EXPR 1 \read(x) [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=3, weak$$choice1=0, weak$$choice2=0, x={3: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=1] [L789] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3: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=1] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 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) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 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 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 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=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3: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=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2216={6:0}, t2217={7:0}, t2218={5:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=0, x={3: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=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=1, weak$$choice2=0, x={3: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=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: 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, 239 locations, 85 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: 66.1s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 50.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3900 SdHoareTripleChecker+Valid, 8.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3107 mSDsluCounter, 2034 SdHoareTripleChecker+Invalid, 7.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1826 mSDsCounter, 723 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11238 IncrementalHoareTripleChecker+Invalid, 11961 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 723 mSolverCounterUnsat, 208 mSDtfsCounter, 11238 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3674occurred in iteration=18, InterpolantAutomatonStates: 165, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.5s InterpolantComputationTime, 411 NumberOfCodeBlocks, 411 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 363 ConstructedInterpolants, 0 QuantifiedInterpolants, 5397 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 13:21:58,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 13:22:00,353 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 13:22:00,355 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 13:22:00,368 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 13:22:00,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 13:22:00,369 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 13:22:00,370 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 13:22:00,371 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 13:22:00,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 13:22:00,373 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 13:22:00,374 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 13:22:00,374 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 13:22:00,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 13:22:00,375 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 13:22:00,376 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 13:22:00,377 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 13:22:00,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 13:22:00,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 13:22:00,379 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 13:22:00,380 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 13:22:00,381 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 13:22:00,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 13:22:00,383 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 13:22:00,384 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 13:22:00,386 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 13:22:00,386 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 13:22:00,386 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 13:22:00,387 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 13:22:00,387 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 13:22:00,388 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 13:22:00,388 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 13:22:00,389 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 13:22:00,389 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 13:22:00,390 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 13:22:00,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 13:22:00,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 13:22:00,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 13:22:00,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 13:22:00,403 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 13:22:00,404 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 13:22:00,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 13:22:00,406 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 13:22:00,429 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 13:22:00,429 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 13:22:00,430 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 13:22:00,430 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 13:22:00,430 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 13:22:00,430 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 13:22:00,431 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 13:22:00,431 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 13:22:00,431 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 13:22:00,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 13:22:00,431 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 13:22:00,432 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 13:22:00,432 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 13:22:00,432 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 13:22:00,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 13:22:00,432 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 13:22:00,432 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 13:22:00,432 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 13:22:00,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 13:22:00,432 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 13:22:00,433 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 13:22:00,433 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 13:22:00,433 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 13:22:00,433 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 13:22:00,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 13:22:00,433 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 13:22:00,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 13:22:00,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:22:00,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 13:22:00,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 13:22:00,434 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 13:22:00,434 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 13:22:00,434 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 13:22:00,434 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 13:22:00,434 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 13:22:00,434 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 13:22:00,434 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 13:22:00,435 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_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2ca99869d70e44347287c08401504e0aa96889a44ad1dcfb8d04f6de3849ab47 [2022-12-13 13:22:00,646 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 13:22:00,661 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 13:22:00,663 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 13:22:00,664 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 13:22:00,664 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 13:22:00,666 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-12-13 13:22:03,253 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 13:22:03,451 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 13:22:03,451 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i [2022-12-13 13:22:03,461 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/data/b59e70dc8/dd14ea3cff2949a6bc746978c32e3e4b/FLAG13c0b2ab5 [2022-12-13 13:22:03,472 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/data/b59e70dc8/dd14ea3cff2949a6bc746978c32e3e4b [2022-12-13 13:22:03,474 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 13:22:03,475 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 13:22:03,475 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 13:22:03,476 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 13:22:03,478 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 13:22:03,479 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:22:03" (1/1) ... [2022-12-13 13:22:03,479 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@676b4169 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:22:03, skipping insertion in model container [2022-12-13 13:22:03,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 01:22:03" (1/1) ... [2022-12-13 13:22:03,485 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 13:22:03,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 13:22:03,626 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_f25848fa-1235-4401-90df-8928707ab334/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-12-13 13:22:03,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,762 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,768 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,769 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,770 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,772 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,773 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,779 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,780 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,782 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,783 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,787 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,788 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,790 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,792 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,793 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:22:03,814 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 13:22:03,827 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_f25848fa-1235-4401-90df-8928707ab334/sv-benchmarks/c/pthread-wmm/safe018_rmo.opt.i[992,1005] [2022-12-13 13:22:03,856 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,857 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,863 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,864 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,865 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,867 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,868 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,873 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,874 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,876 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,877 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,880 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,881 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,883 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 13:22:03,884 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 13:22:03,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 13:22:03,932 INFO L208 MainTranslator]: Completed translation [2022-12-13 13:22:03,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:22:03 WrapperNode [2022-12-13 13:22:03,932 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 13:22:03,933 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 13:22:03,933 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 13:22:03,934 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 13:22:03,940 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:22:03" (1/1) ... [2022-12-13 13:22:03,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:22:03" (1/1) ... [2022-12-13 13:22:03,991 INFO L138 Inliner]: procedures = 180, calls = 73, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 137 [2022-12-13 13:22:03,992 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 13:22:03,993 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 13:22:03,993 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 13:22:03,993 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 13:22:04,001 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:22:03" (1/1) ... [2022-12-13 13:22:04,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:22:03" (1/1) ... [2022-12-13 13:22:04,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:22:03" (1/1) ... [2022-12-13 13:22:04,005 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:22:03" (1/1) ... [2022-12-13 13:22:04,012 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:22:03" (1/1) ... [2022-12-13 13:22:04,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:22:03" (1/1) ... [2022-12-13 13:22:04,015 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:22:03" (1/1) ... [2022-12-13 13:22:04,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:22:03" (1/1) ... [2022-12-13 13:22:04,020 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 13:22:04,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 13:22:04,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 13:22:04,021 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 13:22:04,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:22:03" (1/1) ... [2022-12-13 13:22:04,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 13:22:04,037 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 13:22:04,049 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 13:22:04,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 13:22:04,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 13:22:04,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 13:22:04,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 13:22:04,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 13:22:04,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 13:22:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 13:22:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 13:22:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-13 13:22:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 13:22:04,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 13:22:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 13:22:04,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 13:22:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 13:22:04,082 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 13:22:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 13:22:04,082 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 13:22:04,082 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 13:22:04,083 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 13:22:04,215 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 13:22:04,217 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 13:22:04,797 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 13:22:05,201 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 13:22:05,201 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 13:22:05,203 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:22:05 BoogieIcfgContainer [2022-12-13 13:22:05,204 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 13:22:05,206 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 13:22:05,206 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 13:22:05,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 13:22:05,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 01:22:03" (1/3) ... [2022-12-13 13:22:05,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5317c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:22:05, skipping insertion in model container [2022-12-13 13:22:05,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 01:22:03" (2/3) ... [2022-12-13 13:22:05,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c5317c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 01:22:05, skipping insertion in model container [2022-12-13 13:22:05,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:22:05" (3/3) ... [2022-12-13 13:22:05,211 INFO L112 eAbstractionObserver]: Analyzing ICFG safe018_rmo.opt.i [2022-12-13 13:22:05,229 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 13:22:05,230 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 48 error locations. [2022-12-13 13:22:05,230 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 13:22:05,337 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 13:22:05,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 190 places, 182 transitions, 379 flow [2022-12-13 13:22:05,448 INFO L130 PetriNetUnfolder]: 2/179 cut-off events. [2022-12-13 13:22:05,448 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:22:05,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 179 events. 2/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 255 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-12-13 13:22:05,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 190 places, 182 transitions, 379 flow [2022-12-13 13:22:05,461 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 179 transitions, 367 flow [2022-12-13 13:22:05,464 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 13:22:05,475 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 187 places, 179 transitions, 367 flow [2022-12-13 13:22:05,478 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 187 places, 179 transitions, 367 flow [2022-12-13 13:22:05,478 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 179 transitions, 367 flow [2022-12-13 13:22:05,523 INFO L130 PetriNetUnfolder]: 2/179 cut-off events. [2022-12-13 13:22:05,523 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:22:05,524 INFO L83 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 179 events. 2/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 254 event pairs, 0 based on Foata normal form. 0/129 useless extension candidates. Maximal degree in co-relation 117. Up to 2 conditions per place. [2022-12-13 13:22:05,528 INFO L119 LiptonReduction]: Number of co-enabled transitions 7128 [2022-12-13 13:22:16,877 INFO L134 LiptonReduction]: Checked pairs total: 40040 [2022-12-13 13:22:16,877 INFO L136 LiptonReduction]: Total number of compositions: 149 [2022-12-13 13:22:16,887 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 13:22:16,892 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;@44b791b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 13:22:16,892 INFO L358 AbstractCegarLoop]: Starting to check reachability of 85 error locations. [2022-12-13 13:22:16,893 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 13:22:16,893 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:22:16,893 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:16,894 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 13:22:16,894 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:22:16,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:16,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1014, now seen corresponding path program 1 times [2022-12-13 13:22:16,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:22:16,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [796770305] [2022-12-13 13:22:16,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:16,906 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:16,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:22:16,907 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:22:16,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 13:22:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:16,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 13:22:16,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:16,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:16,994 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:22:16,995 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:22:16,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [796770305] [2022-12-13 13:22:16,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [796770305] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:16,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:16,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 13:22:16,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209307898] [2022-12-13 13:22:16,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:17,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 13:22:17,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:22:17,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 13:22:17,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 13:22:17,025 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 331 [2022-12-13 13:22:17,027 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 74 transitions, 157 flow. Second operand has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:17,027 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:17,027 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 331 [2022-12-13 13:22:17,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:21,191 INFO L130 PetriNetUnfolder]: 25008/34927 cut-off events. [2022-12-13 13:22:21,191 INFO L131 PetriNetUnfolder]: For 40/40 co-relation queries the response was YES. [2022-12-13 13:22:21,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69873 conditions, 34927 events. 25008/34927 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 2713. Compared 232414 event pairs, 25008 based on Foata normal form. 600/14933 useless extension candidates. Maximal degree in co-relation 69862. Up to 34808 conditions per place. [2022-12-13 13:22:21,345 INFO L137 encePairwiseOnDemand]: 304/331 looper letters, 46 selfloop transitions, 0 changer transitions 0/47 dead transitions. [2022-12-13 13:22:21,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 47 transitions, 195 flow [2022-12-13 13:22:21,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 13:22:21,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 13:22:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 337 transitions. [2022-12-13 13:22:21,356 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5090634441087614 [2022-12-13 13:22:21,357 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 337 transitions. [2022-12-13 13:22:21,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 337 transitions. [2022-12-13 13:22:21,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:21,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 337 transitions. [2022-12-13 13:22:21,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 168.5) internal successors, (337), 2 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:21,369 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:21,369 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 331.0) internal successors, (993), 3 states have internal predecessors, (993), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:21,370 INFO L175 Difference]: Start difference. First operand has 83 places, 74 transitions, 157 flow. Second operand 2 states and 337 transitions. [2022-12-13 13:22:21,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 47 transitions, 195 flow [2022-12-13 13:22:21,376 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 192 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 13:22:21,377 INFO L231 Difference]: Finished difference. Result has 55 places, 47 transitions, 100 flow [2022-12-13 13:22:21,378 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=100, PETRI_PLACES=55, PETRI_TRANSITIONS=47} [2022-12-13 13:22:21,382 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -28 predicate places. [2022-12-13 13:22:21,382 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 47 transitions, 100 flow [2022-12-13 13:22:21,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:21,382 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:21,383 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 13:22:21,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 13:22:21,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:21,584 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:22:21,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:21,586 INFO L85 PathProgramCache]: Analyzing trace with hash 31066437, now seen corresponding path program 1 times [2022-12-13 13:22:21,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:22:21,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [458644649] [2022-12-13 13:22:21,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:21,591 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:21,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:22:21,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:22:21,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 13:22:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:21,726 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:22:21,727 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:21,803 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 13:22:21,804 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 13:22:21,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:21,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:22:21,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:22:21,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [458644649] [2022-12-13 13:22:21,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [458644649] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:21,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:21,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:22:21,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623321820] [2022-12-13 13:22:21,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:21,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:22:21,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:22:21,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:22:21,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:22:21,894 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 331 [2022-12-13 13:22:21,895 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 47 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:21,895 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:21,896 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 331 [2022-12-13 13:22:21,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:24,091 INFO L130 PetriNetUnfolder]: 12067/17108 cut-off events. [2022-12-13 13:22:24,091 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 13:22:24,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34231 conditions, 17108 events. 12067/17108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1109. Compared 104993 event pairs, 7587 based on Foata normal form. 0/8594 useless extension candidates. Maximal degree in co-relation 34228. Up to 8673 conditions per place. [2022-12-13 13:22:24,171 INFO L137 encePairwiseOnDemand]: 320/331 looper letters, 58 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2022-12-13 13:22:24,171 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 248 flow [2022-12-13 13:22:24,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:22:24,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:22:24,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2022-12-13 13:22:24,176 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4561933534743202 [2022-12-13 13:22:24,176 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2022-12-13 13:22:24,176 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2022-12-13 13:22:24,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:24,177 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2022-12-13 13:22:24,180 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:24,184 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:24,186 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:24,186 INFO L175 Difference]: Start difference. First operand has 55 places, 47 transitions, 100 flow. Second operand 3 states and 453 transitions. [2022-12-13 13:22:24,186 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 248 flow [2022-12-13 13:22:24,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 61 transitions, 248 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 13:22:24,189 INFO L231 Difference]: Finished difference. Result has 56 places, 45 transitions, 116 flow [2022-12-13 13:22:24,189 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=56, PETRI_TRANSITIONS=45} [2022-12-13 13:22:24,190 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -27 predicate places. [2022-12-13 13:22:24,190 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 45 transitions, 116 flow [2022-12-13 13:22:24,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:24,191 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:24,191 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2022-12-13 13:22:24,198 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 13:22:24,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:24,392 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:22:24,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:24,392 INFO L85 PathProgramCache]: Analyzing trace with hash 31066438, now seen corresponding path program 1 times [2022-12-13 13:22:24,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:22:24,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014944200] [2022-12-13 13:22:24,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:24,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:24,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:22:24,395 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:22:24,396 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 13:22:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:24,475 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:22:24,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:24,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 13:22:24,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 13:22:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:24,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:22:24,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:22:24,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014944200] [2022-12-13 13:22:24,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1014944200] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:24,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:24,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 13:22:24,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520094783] [2022-12-13 13:22:24,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:24,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:22:24,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:22:24,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:22:24,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:22:24,594 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 331 [2022-12-13 13:22:24,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 45 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:24,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:24,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 331 [2022-12-13 13:22:24,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:25,302 INFO L130 PetriNetUnfolder]: 3453/5038 cut-off events. [2022-12-13 13:22:25,303 INFO L131 PetriNetUnfolder]: For 486/486 co-relation queries the response was YES. [2022-12-13 13:22:25,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11256 conditions, 5038 events. 3453/5038 cut-off events. For 486/486 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 26262 event pairs, 3453 based on Foata normal form. 0/4241 useless extension candidates. Maximal degree in co-relation 11251. Up to 5006 conditions per place. [2022-12-13 13:22:25,316 INFO L137 encePairwiseOnDemand]: 321/331 looper letters, 33 selfloop transitions, 1 changer transitions 1/36 dead transitions. [2022-12-13 13:22:25,317 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 36 transitions, 168 flow [2022-12-13 13:22:25,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:22:25,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:22:25,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 437 transitions. [2022-12-13 13:22:25,318 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44008056394763345 [2022-12-13 13:22:25,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 437 transitions. [2022-12-13 13:22:25,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 437 transitions. [2022-12-13 13:22:25,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:25,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 437 transitions. [2022-12-13 13:22:25,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:25,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:25,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:25,321 INFO L175 Difference]: Start difference. First operand has 56 places, 45 transitions, 116 flow. Second operand 3 states and 437 transitions. [2022-12-13 13:22:25,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 36 transitions, 168 flow [2022-12-13 13:22:25,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 36 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:22:25,322 INFO L231 Difference]: Finished difference. Result has 47 places, 35 transitions, 94 flow [2022-12-13 13:22:25,323 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=47, PETRI_TRANSITIONS=35} [2022-12-13 13:22:25,323 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -36 predicate places. [2022-12-13 13:22:25,323 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 35 transitions, 94 flow [2022-12-13 13:22:25,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 states have internal predecessors, (397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:25,323 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:25,323 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:25,331 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 13:22:25,524 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:25,525 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:22:25,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:25,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1564849535, now seen corresponding path program 1 times [2022-12-13 13:22:25,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:22:25,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [49153329] [2022-12-13 13:22:25,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:25,528 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:25,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:22:25,531 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:22:25,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 13:22:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:25,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:22:25,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:25,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:25,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:22:25,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:22:25,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [49153329] [2022-12-13 13:22:25,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [49153329] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:25,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:25,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:22:25,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464195694] [2022-12-13 13:22:25,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:25,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:22:25,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:22:25,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:22:25,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:22:25,694 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 331 [2022-12-13 13:22:25,695 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 35 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:25,695 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:25,695 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 331 [2022-12-13 13:22:25,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:26,028 INFO L130 PetriNetUnfolder]: 1212/1972 cut-off events. [2022-12-13 13:22:26,028 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2022-12-13 13:22:26,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4336 conditions, 1972 events. 1212/1972 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 10076 event pairs, 461 based on Foata normal form. 27/1698 useless extension candidates. Maximal degree in co-relation 4331. Up to 1830 conditions per place. [2022-12-13 13:22:26,034 INFO L137 encePairwiseOnDemand]: 326/331 looper letters, 45 selfloop transitions, 4 changer transitions 0/50 dead transitions. [2022-12-13 13:22:26,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 50 transitions, 226 flow [2022-12-13 13:22:26,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:22:26,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:22:26,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 434 transitions. [2022-12-13 13:22:26,035 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.43705941591137965 [2022-12-13 13:22:26,035 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 434 transitions. [2022-12-13 13:22:26,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 434 transitions. [2022-12-13 13:22:26,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:26,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 434 transitions. [2022-12-13 13:22:26,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:26,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:26,039 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:26,039 INFO L175 Difference]: Start difference. First operand has 47 places, 35 transitions, 94 flow. Second operand 3 states and 434 transitions. [2022-12-13 13:22:26,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 50 transitions, 226 flow [2022-12-13 13:22:26,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 50 transitions, 225 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:22:26,040 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 119 flow [2022-12-13 13:22:26,040 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=119, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2022-12-13 13:22:26,041 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -35 predicate places. [2022-12-13 13:22:26,041 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 119 flow [2022-12-13 13:22:26,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:26,042 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:26,042 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:26,064 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-12-13 13:22:26,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:26,243 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:22:26,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:26,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1821609652, now seen corresponding path program 1 times [2022-12-13 13:22:26,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:22:26,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [175282780] [2022-12-13 13:22:26,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:26,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:26,248 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:22:26,251 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:22:26,254 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 13:22:26,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:26,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:22:26,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:26,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:26,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:22:26,421 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:22:26,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [175282780] [2022-12-13 13:22:26,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [175282780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:26,421 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:26,421 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:22:26,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184918675] [2022-12-13 13:22:26,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:26,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:22:26,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:22:26,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:22:26,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:22:26,428 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 331 [2022-12-13 13:22:26,429 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 119 flow. Second operand has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:26,429 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:26,429 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 331 [2022-12-13 13:22:26,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:26,643 INFO L130 PetriNetUnfolder]: 273/535 cut-off events. [2022-12-13 13:22:26,643 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2022-12-13 13:22:26,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1312 conditions, 535 events. 273/535 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2159 event pairs, 101 based on Foata normal form. 27/506 useless extension candidates. Maximal degree in co-relation 1306. Up to 276 conditions per place. [2022-12-13 13:22:26,645 INFO L137 encePairwiseOnDemand]: 326/331 looper letters, 54 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2022-12-13 13:22:26,645 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 62 transitions, 301 flow [2022-12-13 13:22:26,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:22:26,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:22:26,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 574 transitions. [2022-12-13 13:22:26,647 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4335347432024169 [2022-12-13 13:22:26,647 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 574 transitions. [2022-12-13 13:22:26,647 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 574 transitions. [2022-12-13 13:22:26,647 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:26,647 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 574 transitions. [2022-12-13 13:22:26,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 143.5) internal successors, (574), 4 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:26,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 331.0) internal successors, (1655), 5 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:26,649 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 331.0) internal successors, (1655), 5 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:26,649 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 119 flow. Second operand 4 states and 574 transitions. [2022-12-13 13:22:26,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 62 transitions, 301 flow [2022-12-13 13:22:26,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 62 transitions, 297 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:22:26,651 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 155 flow [2022-12-13 13:22:26,651 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=155, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2022-12-13 13:22:26,651 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -32 predicate places. [2022-12-13 13:22:26,651 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 155 flow [2022-12-13 13:22:26,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.5) internal successors, (526), 4 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:26,652 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:26,652 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:26,660 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-12-13 13:22:26,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:26,853 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:22:26,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:26,854 INFO L85 PathProgramCache]: Analyzing trace with hash -257866752, now seen corresponding path program 1 times [2022-12-13 13:22:26,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:22:26,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104556505] [2022-12-13 13:22:26,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:26,856 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:26,856 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:22:26,859 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:22:26,861 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 13:22:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:27,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 13:22:27,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:27,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:27,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:22:27,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:22:27,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104556505] [2022-12-13 13:22:27,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104556505] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:27,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:27,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:22:27,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033732450] [2022-12-13 13:22:27,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:27,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:22:27,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:22:27,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:22:27,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:22:27,054 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 331 [2022-12-13 13:22:27,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 155 flow. Second operand has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:27,055 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:27,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 331 [2022-12-13 13:22:27,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:27,313 INFO L130 PetriNetUnfolder]: 162/306 cut-off events. [2022-12-13 13:22:27,313 INFO L131 PetriNetUnfolder]: For 225/225 co-relation queries the response was YES. [2022-12-13 13:22:27,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 306 events. 162/306 cut-off events. For 225/225 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1016 event pairs, 70 based on Foata normal form. 9/310 useless extension candidates. Maximal degree in co-relation 825. Up to 134 conditions per place. [2022-12-13 13:22:27,314 INFO L137 encePairwiseOnDemand]: 326/331 looper letters, 43 selfloop transitions, 10 changer transitions 1/55 dead transitions. [2022-12-13 13:22:27,314 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 55 transitions, 283 flow [2022-12-13 13:22:27,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 13:22:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 13:22:27,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 695 transitions. [2022-12-13 13:22:27,316 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4199395770392749 [2022-12-13 13:22:27,316 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 695 transitions. [2022-12-13 13:22:27,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 695 transitions. [2022-12-13 13:22:27,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:27,316 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 695 transitions. [2022-12-13 13:22:27,317 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 139.0) internal successors, (695), 5 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:27,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 331.0) internal successors, (1986), 6 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:27,319 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 331.0) internal successors, (1986), 6 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:27,319 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 155 flow. Second operand 5 states and 695 transitions. [2022-12-13 13:22:27,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 55 transitions, 283 flow [2022-12-13 13:22:27,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 55 transitions, 267 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 13:22:27,320 INFO L231 Difference]: Finished difference. Result has 46 places, 33 transitions, 137 flow [2022-12-13 13:22:27,320 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=137, PETRI_PLACES=46, PETRI_TRANSITIONS=33} [2022-12-13 13:22:27,321 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -37 predicate places. [2022-12-13 13:22:27,321 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 33 transitions, 137 flow [2022-12-13 13:22:27,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 131.4) internal successors, (657), 5 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:27,321 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:27,321 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:27,333 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 13:22:27,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:27,522 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:22:27,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:27,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1774363897, now seen corresponding path program 1 times [2022-12-13 13:22:27,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:22:27,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [295745572] [2022-12-13 13:22:27,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:27,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:27,525 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:22:27,526 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:22:27,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 13:22:27,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:27,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 13:22:27,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:27,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:27,734 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:22:27,735 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:22:27,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [295745572] [2022-12-13 13:22:27,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [295745572] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:27,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:27,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:22:27,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120570819] [2022-12-13 13:22:27,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:27,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 13:22:27,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:22:27,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 13:22:27,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 13:22:27,741 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 331 [2022-12-13 13:22:27,742 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 33 transitions, 137 flow. Second operand has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:27,742 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:27,742 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 331 [2022-12-13 13:22:27,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:27,928 INFO L130 PetriNetUnfolder]: 225/419 cut-off events. [2022-12-13 13:22:27,928 INFO L131 PetriNetUnfolder]: For 472/472 co-relation queries the response was YES. [2022-12-13 13:22:27,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1210 conditions, 419 events. 225/419 cut-off events. For 472/472 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1432 event pairs, 109 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 1203. Up to 207 conditions per place. [2022-12-13 13:22:27,930 INFO L137 encePairwiseOnDemand]: 327/331 looper letters, 59 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2022-12-13 13:22:27,930 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 62 transitions, 401 flow [2022-12-13 13:22:27,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:22:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:22:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2022-12-13 13:22:27,931 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42371601208459214 [2022-12-13 13:22:27,931 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 561 transitions. [2022-12-13 13:22:27,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 561 transitions. [2022-12-13 13:22:27,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:27,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 561 transitions. [2022-12-13 13:22:27,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 140.25) internal successors, (561), 4 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:27,933 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 331.0) internal successors, (1655), 5 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:27,934 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 331.0) internal successors, (1655), 5 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:27,934 INFO L175 Difference]: Start difference. First operand has 46 places, 33 transitions, 137 flow. Second operand 4 states and 561 transitions. [2022-12-13 13:22:27,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 62 transitions, 401 flow [2022-12-13 13:22:27,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 62 transitions, 345 flow, removed 12 selfloop flow, removed 3 redundant places. [2022-12-13 13:22:27,937 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 125 flow [2022-12-13 13:22:27,937 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2022-12-13 13:22:27,937 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -37 predicate places. [2022-12-13 13:22:27,937 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 125 flow [2022-12-13 13:22:27,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.25) internal successors, (533), 4 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:27,938 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:27,938 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:27,961 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-12-13 13:22:28,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:28,139 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:22:28,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:28,140 INFO L85 PathProgramCache]: Analyzing trace with hash -596089580, now seen corresponding path program 1 times [2022-12-13 13:22:28,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:22:28,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288929735] [2022-12-13 13:22:28,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:28,144 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:28,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:22:28,148 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:22:28,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 13:22:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:28,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 13:22:28,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:28,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-12-13 13:22:28,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:22:28,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:22:28,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288929735] [2022-12-13 13:22:28,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288929735] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:28,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:28,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 13:22:28,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377852510] [2022-12-13 13:22:28,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:28,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 13:22:28,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:22:28,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 13:22:28,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 13:22:28,359 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 331 [2022-12-13 13:22:28,360 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:28,360 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:28,360 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 331 [2022-12-13 13:22:28,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:28,535 INFO L130 PetriNetUnfolder]: 205/397 cut-off events. [2022-12-13 13:22:28,535 INFO L131 PetriNetUnfolder]: For 240/240 co-relation queries the response was YES. [2022-12-13 13:22:28,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 397 events. 205/397 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1386 event pairs, 106 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 1103. Up to 208 conditions per place. [2022-12-13 13:22:28,537 INFO L137 encePairwiseOnDemand]: 328/331 looper letters, 38 selfloop transitions, 2 changer transitions 0/41 dead transitions. [2022-12-13 13:22:28,537 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 41 transitions, 237 flow [2022-12-13 13:22:28,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 13:22:28,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 13:22:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-12-13 13:22:28,539 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.418932527693857 [2022-12-13 13:22:28,539 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 416 transitions. [2022-12-13 13:22:28,539 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 416 transitions. [2022-12-13 13:22:28,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:28,540 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 416 transitions. [2022-12-13 13:22:28,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 138.66666666666666) internal successors, (416), 3 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:28,541 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:28,541 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 331.0) internal successors, (1324), 4 states have internal predecessors, (1324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:28,541 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 125 flow. Second operand 3 states and 416 transitions. [2022-12-13 13:22:28,541 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 41 transitions, 237 flow [2022-12-13 13:22:28,543 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 41 transitions, 233 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:22:28,543 INFO L231 Difference]: Finished difference. Result has 45 places, 33 transitions, 123 flow [2022-12-13 13:22:28,543 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=45, PETRI_TRANSITIONS=33} [2022-12-13 13:22:28,544 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -38 predicate places. [2022-12-13 13:22:28,544 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 33 transitions, 123 flow [2022-12-13 13:22:28,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:28,544 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:28,545 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:28,553 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 13:22:28,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:28,746 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:22:28,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:28,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1667058203, now seen corresponding path program 1 times [2022-12-13 13:22:28,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:22:28,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101983120] [2022-12-13 13:22:28,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 13:22:28,749 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:28,750 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:22:28,752 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:22:28,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 13:22:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 13:22:28,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 13:22:28,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:28,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:28,930 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:22:28,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:22:28,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101983120] [2022-12-13 13:22:28,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101983120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:28,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:28,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 13:22:28,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692374663] [2022-12-13 13:22:28,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:28,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 13:22:28,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:22:28,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 13:22:28,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 13:22:29,021 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 331 [2022-12-13 13:22:29,022 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 33 transitions, 123 flow. Second operand has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:29,022 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:29,022 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 331 [2022-12-13 13:22:29,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:29,230 INFO L130 PetriNetUnfolder]: 205/395 cut-off events. [2022-12-13 13:22:29,230 INFO L131 PetriNetUnfolder]: For 228/228 co-relation queries the response was YES. [2022-12-13 13:22:29,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 395 events. 205/395 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1382 event pairs, 106 based on Foata normal form. 0/395 useless extension candidates. Maximal degree in co-relation 1104. Up to 212 conditions per place. [2022-12-13 13:22:29,232 INFO L137 encePairwiseOnDemand]: 328/331 looper letters, 37 selfloop transitions, 2 changer transitions 0/40 dead transitions. [2022-12-13 13:22:29,232 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 233 flow [2022-12-13 13:22:29,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 13:22:29,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 13:22:29,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 547 transitions. [2022-12-13 13:22:29,235 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4131419939577039 [2022-12-13 13:22:29,235 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 547 transitions. [2022-12-13 13:22:29,235 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 547 transitions. [2022-12-13 13:22:29,235 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:29,235 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 547 transitions. [2022-12-13 13:22:29,236 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 136.75) internal successors, (547), 4 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:29,237 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 331.0) internal successors, (1655), 5 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:29,237 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 331.0) internal successors, (1655), 5 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:29,237 INFO L175 Difference]: Start difference. First operand has 45 places, 33 transitions, 123 flow. Second operand 4 states and 547 transitions. [2022-12-13 13:22:29,237 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 233 flow [2022-12-13 13:22:29,238 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 229 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:22:29,239 INFO L231 Difference]: Finished difference. Result has 45 places, 32 transitions, 121 flow [2022-12-13 13:22:29,239 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=121, PETRI_PLACES=45, PETRI_TRANSITIONS=32} [2022-12-13 13:22:29,239 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -38 predicate places. [2022-12-13 13:22:29,239 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 32 transitions, 121 flow [2022-12-13 13:22:29,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 133.0) internal successors, (665), 5 states have internal predecessors, (665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:29,240 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:29,240 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:29,248 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-12-13 13:22:29,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:29,441 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:22:29,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:29,442 INFO L85 PathProgramCache]: Analyzing trace with hash -480796079, now seen corresponding path program 2 times [2022-12-13 13:22:29,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:22:29,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [929787399] [2022-12-13 13:22:29,444 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 13:22:29,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:29,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:22:29,447 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:22:29,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 13:22:29,589 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 13:22:29,589 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:22:29,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 40 conjunts are in the unsatisfiable core [2022-12-13 13:22:29,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:29,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-12-13 13:22:30,088 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 36 [2022-12-13 13:22:30,296 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 74 [2022-12-13 13:22:30,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2022-12-13 13:22:30,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:30,686 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:22:30,687 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:22:30,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [929787399] [2022-12-13 13:22:30,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [929787399] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:30,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:30,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:22:30,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937225056] [2022-12-13 13:22:30,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:30,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:22:30,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:22:30,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:22:30,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:22:31,606 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 331 [2022-12-13 13:22:31,606 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 32 transitions, 121 flow. Second operand has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:31,606 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:31,606 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 331 [2022-12-13 13:22:31,606 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:32,296 INFO L130 PetriNetUnfolder]: 315/635 cut-off events. [2022-12-13 13:22:32,296 INFO L131 PetriNetUnfolder]: For 436/436 co-relation queries the response was YES. [2022-12-13 13:22:32,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1839 conditions, 635 events. 315/635 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3006 event pairs, 113 based on Foata normal form. 2/637 useless extension candidates. Maximal degree in co-relation 1831. Up to 356 conditions per place. [2022-12-13 13:22:32,298 INFO L137 encePairwiseOnDemand]: 323/331 looper letters, 72 selfloop transitions, 9 changer transitions 0/82 dead transitions. [2022-12-13 13:22:32,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 82 transitions, 495 flow [2022-12-13 13:22:32,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:22:32,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:22:32,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 765 transitions. [2022-12-13 13:22:32,300 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3851963746223565 [2022-12-13 13:22:32,300 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 765 transitions. [2022-12-13 13:22:32,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 765 transitions. [2022-12-13 13:22:32,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:32,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 765 transitions. [2022-12-13 13:22:32,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:32,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 331.0) internal successors, (2317), 7 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:32,303 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 331.0) internal successors, (2317), 7 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:32,303 INFO L175 Difference]: Start difference. First operand has 45 places, 32 transitions, 121 flow. Second operand 6 states and 765 transitions. [2022-12-13 13:22:32,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 82 transitions, 495 flow [2022-12-13 13:22:32,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 82 transitions, 492 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 13:22:32,305 INFO L231 Difference]: Finished difference. Result has 51 places, 39 transitions, 175 flow [2022-12-13 13:22:32,305 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=175, PETRI_PLACES=51, PETRI_TRANSITIONS=39} [2022-12-13 13:22:32,306 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -32 predicate places. [2022-12-13 13:22:32,306 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 39 transitions, 175 flow [2022-12-13 13:22:32,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 120.85714285714286) internal successors, (846), 7 states have internal predecessors, (846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:32,306 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:32,306 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:32,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-12-13 13:22:32,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:32,508 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:22:32,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:32,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1021463219, now seen corresponding path program 3 times [2022-12-13 13:22:32,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:22:32,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597446854] [2022-12-13 13:22:32,510 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 13:22:32,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:32,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:22:32,513 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:22:32,516 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-13 13:22:32,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 13:22:32,650 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:22:32,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 45 conjunts are in the unsatisfiable core [2022-12-13 13:22:32,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:32,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 33 [2022-12-13 13:22:33,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 13:22:33,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 13:22:33,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 36 [2022-12-13 13:22:33,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 13:22:33,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:33,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:22:33,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:22:33,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597446854] [2022-12-13 13:22:33,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597446854] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:33,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:33,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 13:22:33,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239194464] [2022-12-13 13:22:33,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:33,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 13:22:33,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:22:33,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 13:22:33,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-13 13:22:34,907 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 331 [2022-12-13 13:22:34,908 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 39 transitions, 175 flow. Second operand has 8 states, 8 states have (on average 120.5) internal successors, (964), 8 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:34,908 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:34,908 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 331 [2022-12-13 13:22:34,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:35,684 INFO L130 PetriNetUnfolder]: 363/752 cut-off events. [2022-12-13 13:22:35,685 INFO L131 PetriNetUnfolder]: For 747/747 co-relation queries the response was YES. [2022-12-13 13:22:35,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2508 conditions, 752 events. 363/752 cut-off events. For 747/747 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 3791 event pairs, 177 based on Foata normal form. 1/753 useless extension candidates. Maximal degree in co-relation 2497. Up to 339 conditions per place. [2022-12-13 13:22:35,687 INFO L137 encePairwiseOnDemand]: 325/331 looper letters, 62 selfloop transitions, 9 changer transitions 0/72 dead transitions. [2022-12-13 13:22:35,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 72 transitions, 469 flow [2022-12-13 13:22:35,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:22:35,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:22:35,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 757 transitions. [2022-12-13 13:22:35,689 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.3811681772406848 [2022-12-13 13:22:35,689 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 757 transitions. [2022-12-13 13:22:35,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 757 transitions. [2022-12-13 13:22:35,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:35,689 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 757 transitions. [2022-12-13 13:22:35,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.16666666666667) internal successors, (757), 6 states have internal predecessors, (757), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:35,691 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 331.0) internal successors, (2317), 7 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:35,692 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 331.0) internal successors, (2317), 7 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:35,692 INFO L175 Difference]: Start difference. First operand has 51 places, 39 transitions, 175 flow. Second operand 6 states and 757 transitions. [2022-12-13 13:22:35,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 72 transitions, 469 flow [2022-12-13 13:22:35,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 72 transitions, 468 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 13:22:35,695 INFO L231 Difference]: Finished difference. Result has 57 places, 42 transitions, 220 flow [2022-12-13 13:22:35,695 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=57, PETRI_TRANSITIONS=42} [2022-12-13 13:22:35,695 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -26 predicate places. [2022-12-13 13:22:35,696 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 42 transitions, 220 flow [2022-12-13 13:22:35,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 120.5) internal successors, (964), 8 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:35,696 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:35,696 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:35,704 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-12-13 13:22:35,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:35,897 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:22:35,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:35,898 INFO L85 PathProgramCache]: Analyzing trace with hash -77337953, now seen corresponding path program 4 times [2022-12-13 13:22:35,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:22:35,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1244427604] [2022-12-13 13:22:35,900 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 13:22:35,900 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:35,901 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:22:35,903 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:22:35,906 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-13 13:22:36,041 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 13:22:36,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:22:36,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-13 13:22:36,051 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:36,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:22:36,131 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 13:22:36,249 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:22:36,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:36,269 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:22:36,269 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:22:36,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1244427604] [2022-12-13 13:22:36,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1244427604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:36,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:36,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 13:22:36,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216885204] [2022-12-13 13:22:36,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:36,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 13:22:36,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:22:36,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 13:22:36,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-12-13 13:22:36,727 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 331 [2022-12-13 13:22:36,728 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 42 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:36,728 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:36,728 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 331 [2022-12-13 13:22:36,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:37,290 INFO L130 PetriNetUnfolder]: 549/1164 cut-off events. [2022-12-13 13:22:37,290 INFO L131 PetriNetUnfolder]: For 1765/1765 co-relation queries the response was YES. [2022-12-13 13:22:37,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4181 conditions, 1164 events. 549/1164 cut-off events. For 1765/1765 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 6921 event pairs, 156 based on Foata normal form. 1/1165 useless extension candidates. Maximal degree in co-relation 4168. Up to 629 conditions per place. [2022-12-13 13:22:37,294 INFO L137 encePairwiseOnDemand]: 323/331 looper letters, 86 selfloop transitions, 13 changer transitions 0/100 dead transitions. [2022-12-13 13:22:37,294 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 100 transitions, 697 flow [2022-12-13 13:22:37,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:22:37,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:22:37,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 782 transitions. [2022-12-13 13:22:37,296 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39375629405840884 [2022-12-13 13:22:37,296 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 782 transitions. [2022-12-13 13:22:37,296 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 782 transitions. [2022-12-13 13:22:37,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:37,297 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 782 transitions. [2022-12-13 13:22:37,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:37,299 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 331.0) internal successors, (2317), 7 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:37,299 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 331.0) internal successors, (2317), 7 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:37,299 INFO L175 Difference]: Start difference. First operand has 57 places, 42 transitions, 220 flow. Second operand 6 states and 782 transitions. [2022-12-13 13:22:37,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 100 transitions, 697 flow [2022-12-13 13:22:37,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 100 transitions, 692 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 13:22:37,306 INFO L231 Difference]: Finished difference. Result has 64 places, 51 transitions, 314 flow [2022-12-13 13:22:37,307 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=314, PETRI_PLACES=64, PETRI_TRANSITIONS=51} [2022-12-13 13:22:37,307 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -19 predicate places. [2022-12-13 13:22:37,307 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 51 transitions, 314 flow [2022-12-13 13:22:37,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.33333333333333) internal successors, (740), 6 states have internal predecessors, (740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:37,307 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:37,307 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:37,317 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-13 13:22:37,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:37,508 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:22:37,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:37,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1353395283, now seen corresponding path program 5 times [2022-12-13 13:22:37,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:22:37,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [617282832] [2022-12-13 13:22:37,511 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 13:22:37,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:37,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:22:37,514 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:22:37,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-13 13:22:37,694 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 13:22:37,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 13:22:37,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 28 conjunts are in the unsatisfiable core [2022-12-13 13:22:37,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 13:22:37,879 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-12-13 13:22:37,951 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 13:22:38,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-12-13 13:22:38,121 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-13 13:22:38,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 13:22:38,149 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 13:22:38,149 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 13:22:38,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [617282832] [2022-12-13 13:22:38,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [617282832] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 13:22:38,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 13:22:38,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 13:22:38,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411064167] [2022-12-13 13:22:38,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 13:22:38,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 13:22:38,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 13:22:38,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 13:22:38,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-12-13 13:22:38,973 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 331 [2022-12-13 13:22:38,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 51 transitions, 314 flow. Second operand has 7 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:38,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 13:22:38,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 331 [2022-12-13 13:22:38,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 13:22:39,806 INFO L130 PetriNetUnfolder]: 741/1630 cut-off events. [2022-12-13 13:22:39,807 INFO L131 PetriNetUnfolder]: For 3617/3625 co-relation queries the response was YES. [2022-12-13 13:22:39,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6478 conditions, 1630 events. 741/1630 cut-off events. For 3617/3625 co-relation queries the response was YES. Maximal size of possible extension queue 164. Compared 11052 event pairs, 223 based on Foata normal form. 9/1639 useless extension candidates. Maximal degree in co-relation 6462. Up to 517 conditions per place. [2022-12-13 13:22:39,813 INFO L137 encePairwiseOnDemand]: 325/331 looper letters, 98 selfloop transitions, 14 changer transitions 0/113 dead transitions. [2022-12-13 13:22:39,813 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 113 transitions, 878 flow [2022-12-13 13:22:39,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 13:22:39,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 13:22:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 782 transitions. [2022-12-13 13:22:39,815 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39375629405840884 [2022-12-13 13:22:39,815 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 782 transitions. [2022-12-13 13:22:39,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 782 transitions. [2022-12-13 13:22:39,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 13:22:39,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 782 transitions. [2022-12-13 13:22:39,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 130.33333333333334) internal successors, (782), 6 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:39,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 331.0) internal successors, (2317), 7 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:39,818 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 331.0) internal successors, (2317), 7 states have internal predecessors, (2317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:39,818 INFO L175 Difference]: Start difference. First operand has 64 places, 51 transitions, 314 flow. Second operand 6 states and 782 transitions. [2022-12-13 13:22:39,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 113 transitions, 878 flow [2022-12-13 13:22:39,832 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 113 transitions, 873 flow, removed 2 selfloop flow, removed 1 redundant places. [2022-12-13 13:22:39,833 INFO L231 Difference]: Finished difference. Result has 71 places, 56 transitions, 407 flow [2022-12-13 13:22:39,833 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=331, PETRI_DIFFERENCE_MINUEND_FLOW=309, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=407, PETRI_PLACES=71, PETRI_TRANSITIONS=56} [2022-12-13 13:22:39,834 INFO L288 CegarLoopForPetriNet]: 83 programPoint places, -12 predicate places. [2022-12-13 13:22:39,834 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 56 transitions, 407 flow [2022-12-13 13:22:39,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 122.85714285714286) internal successors, (860), 7 states have internal predecessors, (860), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 13:22:39,834 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 13:22:39,834 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:39,843 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-12-13 13:22:40,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:40,035 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 82 more)] === [2022-12-13 13:22:40,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 13:22:40,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1786443489, now seen corresponding path program 6 times [2022-12-13 13:22:40,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 13:22:40,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506159288] [2022-12-13 13:22:40,038 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-12-13 13:22:40,039 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:40,039 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 13:22:40,042 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 13:22:40,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-12-13 13:22:40,237 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2022-12-13 13:22:40,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 13:22:40,237 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 13:22:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 13:22:40,405 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 13:22:40,406 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 13:22:40,406 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (84 of 85 remaining) [2022-12-13 13:22:40,407 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 85 remaining) [2022-12-13 13:22:40,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 85 remaining) [2022-12-13 13:22:40,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 85 remaining) [2022-12-13 13:22:40,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 85 remaining) [2022-12-13 13:22:40,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 85 remaining) [2022-12-13 13:22:40,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 85 remaining) [2022-12-13 13:22:40,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 85 remaining) [2022-12-13 13:22:40,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 85 remaining) [2022-12-13 13:22:40,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 85 remaining) [2022-12-13 13:22:40,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 85 remaining) [2022-12-13 13:22:40,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 85 remaining) [2022-12-13 13:22:40,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 85 remaining) [2022-12-13 13:22:40,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 85 remaining) [2022-12-13 13:22:40,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 85 remaining) [2022-12-13 13:22:40,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 85 remaining) [2022-12-13 13:22:40,408 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 85 remaining) [2022-12-13 13:22:40,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 85 remaining) [2022-12-13 13:22:40,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 85 remaining) [2022-12-13 13:22:40,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 85 remaining) [2022-12-13 13:22:40,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 85 remaining) [2022-12-13 13:22:40,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 85 remaining) [2022-12-13 13:22:40,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 85 remaining) [2022-12-13 13:22:40,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 85 remaining) [2022-12-13 13:22:40,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 85 remaining) [2022-12-13 13:22:40,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 85 remaining) [2022-12-13 13:22:40,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 85 remaining) [2022-12-13 13:22:40,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 85 remaining) [2022-12-13 13:22:40,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 85 remaining) [2022-12-13 13:22:40,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 85 remaining) [2022-12-13 13:22:40,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 85 remaining) [2022-12-13 13:22:40,409 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 85 remaining) [2022-12-13 13:22:40,410 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (37 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (36 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 85 remaining) [2022-12-13 13:22:40,411 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 85 remaining) [2022-12-13 13:22:40,412 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 85 remaining) [2022-12-13 13:22:40,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 85 remaining) [2022-12-13 13:22:40,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 85 remaining) [2022-12-13 13:22:40,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 85 remaining) [2022-12-13 13:22:40,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 85 remaining) [2022-12-13 13:22:40,413 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 85 remaining) [2022-12-13 13:22:40,422 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-12-13 13:22:40,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 13:22:40,614 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 13:22:40,631 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 13:22:40,631 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 13:22:40,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 01:22:40 BasicIcfg [2022-12-13 13:22:40,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 13:22:40,703 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 13:22:40,704 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 13:22:40,704 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 13:22:40,704 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 01:22:05" (3/4) ... [2022-12-13 13:22:40,706 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 13:22:40,706 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 13:22:40,706 INFO L158 Benchmark]: Toolchain (without parser) took 37231.75ms. Allocated memory was 90.2MB in the beginning and 1.8GB in the end (delta: 1.8GB). Free memory was 65.6MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 169.9MB. Max. memory is 16.1GB. [2022-12-13 13:22:40,706 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 35.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:22:40,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 457.05ms. Allocated memory is still 90.2MB. Free memory was 65.4MB in the beginning and 58.3MB in the end (delta: 7.1MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2022-12-13 13:22:40,707 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.56ms. Allocated memory is still 90.2MB. Free memory was 58.3MB in the beginning and 55.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 13:22:40,707 INFO L158 Benchmark]: Boogie Preprocessor took 27.40ms. Allocated memory is still 90.2MB. Free memory was 55.9MB in the beginning and 53.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 13:22:40,707 INFO L158 Benchmark]: RCFGBuilder took 1183.34ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 53.4MB in the beginning and 62.8MB in the end (delta: -9.4MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. [2022-12-13 13:22:40,707 INFO L158 Benchmark]: TraceAbstraction took 35497.21ms. Allocated memory was 109.1MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 61.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-12-13 13:22:40,707 INFO L158 Benchmark]: Witness Printer took 2.39ms. Allocated memory is still 1.8GB. Free memory is still 1.7GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 13:22:40,708 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 35.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 457.05ms. Allocated memory is still 90.2MB. Free memory was 65.4MB in the beginning and 58.3MB in the end (delta: 7.1MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.56ms. Allocated memory is still 90.2MB. Free memory was 58.3MB in the beginning and 55.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.40ms. Allocated memory is still 90.2MB. Free memory was 55.9MB in the beginning and 53.4MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1183.34ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 53.4MB in the beginning and 62.8MB in the end (delta: -9.4MB). Peak memory consumption was 28.7MB. Max. memory is 16.1GB. * TraceAbstraction took 35497.21ms. Allocated memory was 109.1MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 61.9MB in the beginning and 1.7GB in the end (delta: -1.6GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 2.39ms. Allocated memory is still 1.8GB. Free memory is still 1.7GB. 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: 11.4s, 187 PlacesBefore, 83 PlacesAfterwards, 179 TransitionsBefore, 74 TransitionsAfterwards, 7128 CoEnabledTransitionPairs, 8 FixpointIterations, 68 TrivialSequentialCompositions, 77 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 3 ConcurrentYvCompositions, 1 ChoiceCompositions, 149 TotalNumberOfCompositions, 40040 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 11073, independent: 10369, independent conditional: 0, independent unconditional: 10369, dependent: 704, dependent conditional: 0, dependent unconditional: 704, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2999, independent: 2922, independent conditional: 0, independent unconditional: 2922, dependent: 77, dependent conditional: 0, dependent unconditional: 77, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 11073, independent: 7447, independent conditional: 0, independent unconditional: 7447, dependent: 627, dependent conditional: 0, dependent unconditional: 627, unknown: 2999, unknown conditional: 0, unknown unconditional: 2999] , Statistics on independence cache: Total cache size (in pairs): 434, Positive cache size: 389, Positive conditional cache size: 0, Positive unconditional cache size: 389, Negative cache size: 45, Negative conditional cache size: 0, Negative unconditional cache size: 45, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p0_EBX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L717] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L718] 0 int __unbuffered_p2_EAX$mem_tmp; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L725] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L726] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L727] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L728] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L729] 0 int __unbuffered_p2_EAX$w_buff0; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L731] 0 int __unbuffered_p2_EAX$w_buff1; [L732] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L849] 0 pthread_t t2216; [L850] FCALL, FORK 0 pthread_create(&t2216, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2216, ((void *)0), P0, ((void *)0))=0, t2216={-2147483642:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L851] 0 pthread_t t2217; [L852] FCALL, FORK 0 pthread_create(&t2217, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2217, ((void *)0), P1, ((void *)0))=1, t2216={-2147483642:0}, t2217={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L853] 0 pthread_t t2218; [L854] FCALL, FORK 0 pthread_create(&t2218, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2218, ((void *)0), P2, ((void *)0))=2, t2216={-2147483642:0}, t2217={15:0}, t2218={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3: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] [L806] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 3 x$flush_delayed = weak$$choice2 [L809] EXPR 3 \read(x) [L809] 3 x$mem_tmp = x [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] EXPR 3 \read(x) [L810] EXPR 3 !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L810] 3 x = !x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff1) [L811] 3 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : x$w_buff0)) [L812] 3 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff1 : x$w_buff1)) [L813] 3 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used)) [L814] 3 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L815] 3 x$r_buff0_thd3 = weak$$choice2 ? x$r_buff0_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff0_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3)) [L816] 3 x$r_buff1_thd3 = weak$$choice2 ? x$r_buff1_thd3 : (!x$w_buff0_used || !x$r_buff0_thd3 && !x$w_buff1_used || !x$r_buff0_thd3 && !x$r_buff1_thd3 ? x$r_buff1_thd3 : (x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L817] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L818] 3 __unbuffered_p2_EAX$read_delayed_var = &x [L819] EXPR 3 \read(x) [L819] 3 __unbuffered_p2_EAX = x [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] EXPR 3 \read(x) [L820] EXPR 3 x$flush_delayed ? x$mem_tmp : x [L820] 3 x = x$flush_delayed ? x$mem_tmp : x [L821] 3 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x={3: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] [L824] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice1=0, weak$$choice2=0, x={3: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=1] [L761] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=6, weak$$choice1=0, weak$$choice2=0, x={3: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=1] [L764] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L765] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L766] 1 x$flush_delayed = weak$$choice2 [L767] EXPR 1 \read(x) [L767] 1 x$mem_tmp = x [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] EXPR 1 \read(x) [L768] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L768] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L769] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L770] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L771] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L772] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L773] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L774] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L775] EXPR 1 \read(x) [L775] 1 __unbuffered_p0_EBX = x [L776] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L776] 1 x = x$flush_delayed ? x$mem_tmp : x [L777] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=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=5, weak$$choice1=0, weak$$choice2=2, x={3: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=1] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L789] 2 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, x={3: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=1] [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 \read(x) [L792] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L792] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L792] 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) [L793] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L794] 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 [L795] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L796] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, x={3: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=1] [L799] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L801] 2 return 0; [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 \read(x) [L827] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L827] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L827] 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) [L828] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L829] 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 [L830] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L831] 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 [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, x={3: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=1] [L834] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L836] 3 return 0; [L856] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L858] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L858] RET 0 assume_abort_if_not(main$tmp_guard0) [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 \read(x) [L860] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L860] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L860] 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) [L861] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L862] 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 [L863] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L864] 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}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2216={-2147483642:0}, t2217={15:0}, t2218={6:0}, weak$$choice0=5, weak$$choice1=0, weak$$choice2=2, x={3: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=1] [L867] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 \read(*__unbuffered_p2_EAX$read_delayed_var) [L868] EXPR 0 weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX [L868] EXPR 0 __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L868] 0 __unbuffered_p2_EAX = __unbuffered_p2_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p2_EAX$read_delayed_var : __unbuffered_p2_EAX) : __unbuffered_p2_EAX [L869] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p2_EAX == 1) [L871] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={3:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice1=2, weak$$choice2=2, x={3: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=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 847]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 850]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: 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, 240 locations, 85 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: 35.3s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 15.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 11.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1296 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 896 mSDsluCounter, 530 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 501 mSDsCounter, 248 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2732 IncrementalHoareTripleChecker+Invalid, 2980 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 248 mSolverCounterUnsat, 29 mSDtfsCounter, 2732 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 198 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=407occurred in iteration=13, InterpolantAutomatonStates: 55, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 219 NumberOfCodeBlocks, 219 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 185 ConstructedInterpolants, 0 QuantifiedInterpolants, 2463 SizeOfPredicates, 63 NumberOfNonLiveVariables, 2154 ConjunctsInSsa, 176 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 13:22:40,728 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f25848fa-1235-4401-90df-8928707ab334/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample