./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/thin002_rmo.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_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/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_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/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_c17de227-3aab-4b6f-aef7-7471ce93ef07/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 f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 18:40:28,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:40:28,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:40:28,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:40:28,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:40:28,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:40:28,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:40:28,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:40:28,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:40:28,788 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:40:28,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:40:28,790 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:40:28,790 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:40:28,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:40:28,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:40:28,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:40:28,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:40:28,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:40:28,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:40:28,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:40:28,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:40:28,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:40:28,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:40:28,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:40:28,805 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:40:28,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:40:28,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:40:28,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:40:28,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:40:28,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:40:28,808 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:40:28,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:40:28,809 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:40:28,810 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:40:28,811 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:40:28,811 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:40:28,812 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:40:28,812 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:40:28,812 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:40:28,813 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:40:28,813 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:40:28,814 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 18:40:28,832 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:40:28,833 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:40:28,833 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:40:28,833 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:40:28,834 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:40:28,834 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:40:28,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:40:28,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:40:28,835 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:40:28,835 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:40:28,835 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:40:28,835 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 18:40:28,836 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:40:28,836 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:40:28,836 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:40:28,836 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 18:40:28,836 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 18:40:28,836 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 18:40:28,837 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:40:28,837 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 18:40:28,837 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:40:28,837 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:40:28,837 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:40:28,837 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:40:28,838 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:40:28,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:40:28,838 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:40:28,838 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:40:28,838 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 18:40:28,838 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 18:40:28,839 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:40:28,839 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:40:28,839 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:40:28,839 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:40:28,839 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_c17de227-3aab-4b6f-aef7-7471ce93ef07/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_c17de227-3aab-4b6f-aef7-7471ce93ef07/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 -> f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 [2022-12-13 18:40:29,017 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:40:29,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:40:29,036 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:40:29,037 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:40:29,037 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:40:29,038 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2022-12-13 18:40:31,635 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:40:31,833 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:40:31,834 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2022-12-13 18:40:31,843 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/data/307972a1e/fb096004d39846c59a16406b0ca28725/FLAG3fad6921a [2022-12-13 18:40:32,205 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/data/307972a1e/fb096004d39846c59a16406b0ca28725 [2022-12-13 18:40:32,207 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:40:32,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:40:32,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:40:32,208 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:40:32,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:40:32,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:40:32" (1/1) ... [2022-12-13 18:40:32,212 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15829519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:40:32, skipping insertion in model container [2022-12-13 18:40:32,212 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:40:32" (1/1) ... [2022-12-13 18:40:32,217 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:40:32,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:40:32,356 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_c17de227-3aab-4b6f-aef7-7471ce93ef07/sv-benchmarks/c/pthread-wmm/thin002_rmo.i[988,1001] [2022-12-13 18:40:32,446 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,454 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,455 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,456 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,457 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,458 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,459 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,460 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,462 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,463 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,467 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,468 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,470 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,472 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:40:32,481 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:40:32,489 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_c17de227-3aab-4b6f-aef7-7471ce93ef07/sv-benchmarks/c/pthread-wmm/thin002_rmo.i[988,1001] [2022-12-13 18:40:32,508 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,514 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,515 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,516 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,517 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,518 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,519 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,520 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,521 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,522 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,525 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,526 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,527 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:40:32,528 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:40:32,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:40:32,551 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:40:32,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:40:32 WrapperNode [2022-12-13 18:40:32,551 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:40:32,552 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:40:32,552 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:40:32,552 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:40:32,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:40:32" (1/1) ... [2022-12-13 18:40:32,570 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:40:32" (1/1) ... [2022-12-13 18:40:32,591 INFO L138 Inliner]: procedures = 177, calls = 80, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 154 [2022-12-13 18:40:32,591 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:40:32,592 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:40:32,592 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:40:32,592 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:40:32,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:40:32" (1/1) ... [2022-12-13 18:40:32,601 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:40:32" (1/1) ... [2022-12-13 18:40:32,605 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:40:32" (1/1) ... [2022-12-13 18:40:32,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:40:32" (1/1) ... [2022-12-13 18:40:32,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:40:32" (1/1) ... [2022-12-13 18:40:32,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:40:32" (1/1) ... [2022-12-13 18:40:32,624 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:40:32" (1/1) ... [2022-12-13 18:40:32,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:40:32" (1/1) ... [2022-12-13 18:40:32,629 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:40:32,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:40:32,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:40:32,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:40:32,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:40:32" (1/1) ... [2022-12-13 18:40:32,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:40:32,647 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:40:32,657 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:40:32,665 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:40:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-13 18:40:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 18:40:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 18:40:32,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:40:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 18:40:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:40:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 18:40:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 18:40:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 18:40:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 18:40:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 18:40:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 18:40:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 18:40:32,698 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 18:40:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 18:40:32,698 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 18:40:32,699 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:40:32,699 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:40:32,700 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 18:40:32,810 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:40:32,813 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:40:33,162 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:40:33,418 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:40:33,419 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 18:40:33,421 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:40:33 BoogieIcfgContainer [2022-12-13 18:40:33,421 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:40:33,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:40:33,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:40:33,427 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:40:33,427 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:40:32" (1/3) ... [2022-12-13 18:40:33,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2be11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:40:33, skipping insertion in model container [2022-12-13 18:40:33,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:40:32" (2/3) ... [2022-12-13 18:40:33,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f2be11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:40:33, skipping insertion in model container [2022-12-13 18:40:33,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:40:33" (3/3) ... [2022-12-13 18:40:33,429 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_rmo.i [2022-12-13 18:40:33,448 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:40:33,448 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-12-13 18:40:33,448 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 18:40:33,511 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 18:40:33,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 201 places, 190 transitions, 400 flow [2022-12-13 18:40:33,604 INFO L130 PetriNetUnfolder]: 2/186 cut-off events. [2022-12-13 18:40:33,605 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:40:33,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 2/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 203 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-12-13 18:40:33,610 INFO L82 GeneralOperation]: Start removeDead. Operand has 201 places, 190 transitions, 400 flow [2022-12-13 18:40:33,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 186 transitions, 384 flow [2022-12-13 18:40:33,619 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 18:40:33,628 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 186 transitions, 384 flow [2022-12-13 18:40:33,631 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 186 transitions, 384 flow [2022-12-13 18:40:33,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 186 transitions, 384 flow [2022-12-13 18:40:33,669 INFO L130 PetriNetUnfolder]: 2/186 cut-off events. [2022-12-13 18:40:33,669 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:40:33,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 186 events. 2/186 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 204 event pairs, 0 based on Foata normal form. 0/150 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-12-13 18:40:33,673 INFO L119 LiptonReduction]: Number of co-enabled transitions 6364 [2022-12-13 18:40:40,388 INFO L134 LiptonReduction]: Checked pairs total: 22359 [2022-12-13 18:40:40,389 INFO L136 LiptonReduction]: Total number of compositions: 159 [2022-12-13 18:40:40,402 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:40:40,407 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;@7e17a6e3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:40:40,408 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2022-12-13 18:40:40,409 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 18:40:40,409 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:40:40,409 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:40:40,410 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 18:40:40,410 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:40:40,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:40:40,414 INFO L85 PathProgramCache]: Analyzing trace with hash 875, now seen corresponding path program 1 times [2022-12-13 18:40:40,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:40:40,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515434500] [2022-12-13 18:40:40,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:40,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:40:40,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:40,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:40:40,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:40:40,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515434500] [2022-12-13 18:40:40,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515434500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:40:40,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:40:40,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 18:40:40,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523389477] [2022-12-13 18:40:40,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:40:40,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 18:40:40,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:40:40,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 18:40:40,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 18:40:40,532 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 349 [2022-12-13 18:40:40,535 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 146 flow. Second operand has 2 states, 2 states have (on average 157.5) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:40,535 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:40:40,535 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 349 [2022-12-13 18:40:40,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:40:43,277 INFO L130 PetriNetUnfolder]: 20652/27845 cut-off events. [2022-12-13 18:40:43,277 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-13 18:40:43,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55656 conditions, 27845 events. 20652/27845 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 1733. Compared 171943 event pairs, 20652 based on Foata normal form. 405/17861 useless extension candidates. Maximal degree in co-relation 55644. Up to 27674 conditions per place. [2022-12-13 18:40:43,434 INFO L137 encePairwiseOnDemand]: 330/349 looper letters, 41 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2022-12-13 18:40:43,434 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 48 transitions, 190 flow [2022-12-13 18:40:43,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 18:40:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 18:40:43,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 374 transitions. [2022-12-13 18:40:43,447 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5358166189111748 [2022-12-13 18:40:43,447 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 374 transitions. [2022-12-13 18:40:43,447 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 374 transitions. [2022-12-13 18:40:43,448 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:40:43,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 374 transitions. [2022-12-13 18:40:43,452 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 187.0) internal successors, (374), 2 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:43,455 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 349.0) internal successors, (1047), 3 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:43,456 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 349.0) internal successors, (1047), 3 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:43,457 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 146 flow. Second operand 2 states and 374 transitions. [2022-12-13 18:40:43,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 48 transitions, 190 flow [2022-12-13 18:40:43,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 186 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 18:40:43,462 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 104 flow [2022-12-13 18:40:43,463 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2022-12-13 18:40:43,465 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -21 predicate places. [2022-12-13 18:40:43,466 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 104 flow [2022-12-13 18:40:43,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 157.5) internal successors, (315), 2 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:43,466 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:40:43,466 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 18:40:43,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 18:40:43,467 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:40:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:40:43,467 INFO L85 PathProgramCache]: Analyzing trace with hash 861745, now seen corresponding path program 1 times [2022-12-13 18:40:43,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:40:43,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957322666] [2022-12-13 18:40:43,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:43,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:40:43,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:43,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:40:43,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:40:43,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957322666] [2022-12-13 18:40:43,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957322666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:40:43,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:40:43,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:40:43,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658836254] [2022-12-13 18:40:43,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:40:43,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:40:43,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:40:43,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:40:43,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:40:43,701 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 349 [2022-12-13 18:40:43,701 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 104 flow. Second operand has 3 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 18:40:43,701 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:40:43,701 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 349 [2022-12-13 18:40:43,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:40:46,448 INFO L130 PetriNetUnfolder]: 19751/27216 cut-off events. [2022-12-13 18:40:46,448 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:40:46,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54205 conditions, 27216 events. 19751/27216 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1441. Compared 169561 event pairs, 12464 based on Foata normal form. 0/19711 useless extension candidates. Maximal degree in co-relation 54202. Up to 16695 conditions per place. [2022-12-13 18:40:46,585 INFO L137 encePairwiseOnDemand]: 334/349 looper letters, 50 selfloop transitions, 9 changer transitions 0/64 dead transitions. [2022-12-13 18:40:46,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 64 transitions, 254 flow [2022-12-13 18:40:46,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:40:46,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:40:46,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 515 transitions. [2022-12-13 18:40:46,587 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4918815663801337 [2022-12-13 18:40:46,587 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 515 transitions. [2022-12-13 18:40:46,588 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 515 transitions. [2022-12-13 18:40:46,588 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:40:46,588 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 515 transitions. [2022-12-13 18:40:46,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 171.66666666666666) internal successors, (515), 3 states have internal predecessors, (515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:46,591 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:46,591 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:46,591 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 104 flow. Second operand 3 states and 515 transitions. [2022-12-13 18:40:46,591 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 64 transitions, 254 flow [2022-12-13 18:40:46,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 64 transitions, 254 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 18:40:46,593 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 172 flow [2022-12-13 18:40:46,593 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=172, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2022-12-13 18:40:46,593 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2022-12-13 18:40:46,593 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 172 flow [2022-12-13 18:40:46,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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 18:40:46,594 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:40:46,594 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 18:40:46,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 18:40:46,594 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:40:46,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:40:46,595 INFO L85 PathProgramCache]: Analyzing trace with hash 861746, now seen corresponding path program 1 times [2022-12-13 18:40:46,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:40:46,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451147510] [2022-12-13 18:40:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:46,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:40:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:40:46,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:40:46,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451147510] [2022-12-13 18:40:46,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451147510] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:40:46,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:40:46,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:40:46,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138262432] [2022-12-13 18:40:46,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:40:46,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:40:46,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:40:46,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:40:46,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:40:46,712 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 349 [2022-12-13 18:40:46,713 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 172 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:46,713 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:40:46,713 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 349 [2022-12-13 18:40:46,713 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:40:47,977 INFO L130 PetriNetUnfolder]: 8656/12468 cut-off events. [2022-12-13 18:40:47,978 INFO L131 PetriNetUnfolder]: For 2537/2699 co-relation queries the response was YES. [2022-12-13 18:40:47,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30806 conditions, 12468 events. 8656/12468 cut-off events. For 2537/2699 co-relation queries the response was YES. Maximal size of possible extension queue 741. Compared 77248 event pairs, 7504 based on Foata normal form. 1422/12590 useless extension candidates. Maximal degree in co-relation 30801. Up to 11753 conditions per place. [2022-12-13 18:40:48,026 INFO L137 encePairwiseOnDemand]: 342/349 looper letters, 37 selfloop transitions, 1 changer transitions 1/47 dead transitions. [2022-12-13 18:40:48,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 47 transitions, 238 flow [2022-12-13 18:40:48,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:40:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:40:48,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 504 transitions. [2022-12-13 18:40:48,028 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4813753581661891 [2022-12-13 18:40:48,028 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 504 transitions. [2022-12-13 18:40:48,028 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 504 transitions. [2022-12-13 18:40:48,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:40:48,028 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 504 transitions. [2022-12-13 18:40:48,030 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 168.0) internal successors, (504), 3 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:48,032 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:48,032 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:48,032 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 172 flow. Second operand 3 states and 504 transitions. [2022-12-13 18:40:48,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 47 transitions, 238 flow [2022-12-13 18:40:48,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 47 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:40:48,046 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 142 flow [2022-12-13 18:40:48,047 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2022-12-13 18:40:48,047 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -25 predicate places. [2022-12-13 18:40:48,047 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 142 flow [2022-12-13 18:40:48,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:48,048 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:40:48,048 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:40:48,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 18:40:48,048 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:40:48,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:40:48,048 INFO L85 PathProgramCache]: Analyzing trace with hash -615792202, now seen corresponding path program 1 times [2022-12-13 18:40:48,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:40:48,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8352214] [2022-12-13 18:40:48,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:48,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:40:48,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:48,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:40:48,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:40:48,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8352214] [2022-12-13 18:40:48,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8352214] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:40:48,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:40:48,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:40:48,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627876707] [2022-12-13 18:40:48,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:40:48,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:40:48,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:40:48,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:40:48,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:40:48,182 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 349 [2022-12-13 18:40:48,183 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:48,183 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:40:48,183 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 349 [2022-12-13 18:40:48,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:40:49,652 INFO L130 PetriNetUnfolder]: 7918/11751 cut-off events. [2022-12-13 18:40:49,652 INFO L131 PetriNetUnfolder]: For 962/1070 co-relation queries the response was YES. [2022-12-13 18:40:49,671 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27083 conditions, 11751 events. 7918/11751 cut-off events. For 962/1070 co-relation queries the response was YES. Maximal size of possible extension queue 743. Compared 78018 event pairs, 2906 based on Foata normal form. 0/10046 useless extension candidates. Maximal degree in co-relation 27078. Up to 7155 conditions per place. [2022-12-13 18:40:49,711 INFO L137 encePairwiseOnDemand]: 345/349 looper letters, 65 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2022-12-13 18:40:49,711 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 76 transitions, 370 flow [2022-12-13 18:40:49,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:40:49,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:40:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2022-12-13 18:40:49,714 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5033428844317096 [2022-12-13 18:40:49,714 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 527 transitions. [2022-12-13 18:40:49,714 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 527 transitions. [2022-12-13 18:40:49,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:40:49,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 527 transitions. [2022-12-13 18:40:49,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.66666666666666) internal successors, (527), 3 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:49,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:49,718 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:49,718 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 142 flow. Second operand 3 states and 527 transitions. [2022-12-13 18:40:49,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 76 transitions, 370 flow [2022-12-13 18:40:49,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 369 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:40:49,720 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 154 flow [2022-12-13 18:40:49,720 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=3, PETRI_FLOW=154, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2022-12-13 18:40:49,720 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -24 predicate places. [2022-12-13 18:40:49,721 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 154 flow [2022-12-13 18:40:49,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.0) internal successors, (480), 3 states have internal predecessors, (480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:49,721 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:40:49,721 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:40:49,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 18:40:49,722 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:40:49,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:40:49,722 INFO L85 PathProgramCache]: Analyzing trace with hash -615791902, now seen corresponding path program 1 times [2022-12-13 18:40:49,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:40:49,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486940167] [2022-12-13 18:40:49,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:49,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:40:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:49,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:40:49,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:40:49,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486940167] [2022-12-13 18:40:49,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486940167] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:40:49,896 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:40:49,896 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:40:49,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281245837] [2022-12-13 18:40:49,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:40:49,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:40:49,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:40:49,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:40:49,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:40:49,901 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 349 [2022-12-13 18:40:49,902 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 154 flow. Second operand has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:49,902 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:40:49,902 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 349 [2022-12-13 18:40:49,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:40:51,100 INFO L130 PetriNetUnfolder]: 8057/12365 cut-off events. [2022-12-13 18:40:51,100 INFO L131 PetriNetUnfolder]: For 3901/4120 co-relation queries the response was YES. [2022-12-13 18:40:51,114 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29707 conditions, 12365 events. 8057/12365 cut-off events. For 3901/4120 co-relation queries the response was YES. Maximal size of possible extension queue 793. Compared 87580 event pairs, 1689 based on Foata normal form. 60/11221 useless extension candidates. Maximal degree in co-relation 29701. Up to 8232 conditions per place. [2022-12-13 18:40:51,142 INFO L137 encePairwiseOnDemand]: 346/349 looper letters, 64 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2022-12-13 18:40:51,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 74 transitions, 386 flow [2022-12-13 18:40:51,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:40:51,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:40:51,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 520 transitions. [2022-12-13 18:40:51,144 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49665711556829034 [2022-12-13 18:40:51,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 520 transitions. [2022-12-13 18:40:51,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 520 transitions. [2022-12-13 18:40:51,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:40:51,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 520 transitions. [2022-12-13 18:40:51,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 173.33333333333334) internal successors, (520), 3 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:51,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:51,147 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:51,147 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 154 flow. Second operand 3 states and 520 transitions. [2022-12-13 18:40:51,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 74 transitions, 386 flow [2022-12-13 18:40:51,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 74 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:40:51,149 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 156 flow [2022-12-13 18:40:51,149 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=148, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2022-12-13 18:40:51,149 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -23 predicate places. [2022-12-13 18:40:51,150 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 156 flow [2022-12-13 18:40:51,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.0) internal successors, (477), 3 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:51,150 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:40:51,150 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:40:51,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 18:40:51,150 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:40:51,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:40:51,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1967500482, now seen corresponding path program 1 times [2022-12-13 18:40:51,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:40:51,151 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335233747] [2022-12-13 18:40:51,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:51,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:40:51,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:51,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:40:51,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:40:51,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335233747] [2022-12-13 18:40:51,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335233747] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:40:51,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:40:51,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:40:51,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382817521] [2022-12-13 18:40:51,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:40:51,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:40:51,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:40:51,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:40:51,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:40:51,383 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 146 out of 349 [2022-12-13 18:40:51,384 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 156 flow. Second operand has 5 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:51,384 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:40:51,384 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 146 of 349 [2022-12-13 18:40:51,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:40:52,408 INFO L130 PetriNetUnfolder]: 8140/11985 cut-off events. [2022-12-13 18:40:52,408 INFO L131 PetriNetUnfolder]: For 2047/2047 co-relation queries the response was YES. [2022-12-13 18:40:52,427 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30836 conditions, 11985 events. 8140/11985 cut-off events. For 2047/2047 co-relation queries the response was YES. Maximal size of possible extension queue 750. Compared 78176 event pairs, 2671 based on Foata normal form. 0/10775 useless extension candidates. Maximal degree in co-relation 30829. Up to 4482 conditions per place. [2022-12-13 18:40:52,460 INFO L137 encePairwiseOnDemand]: 340/349 looper letters, 69 selfloop transitions, 9 changer transitions 0/84 dead transitions. [2022-12-13 18:40:52,460 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 84 transitions, 430 flow [2022-12-13 18:40:52,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:40:52,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:40:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 656 transitions. [2022-12-13 18:40:52,463 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4699140401146132 [2022-12-13 18:40:52,463 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 656 transitions. [2022-12-13 18:40:52,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 656 transitions. [2022-12-13 18:40:52,464 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:40:52,464 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 656 transitions. [2022-12-13 18:40:52,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.0) internal successors, (656), 4 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 18:40:52,468 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:52,469 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:52,469 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 156 flow. Second operand 4 states and 656 transitions. [2022-12-13 18:40:52,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 84 transitions, 430 flow [2022-12-13 18:40:52,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 422 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:40:52,472 INFO L231 Difference]: Finished difference. Result has 58 places, 52 transitions, 224 flow [2022-12-13 18:40:52,472 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=148, 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=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=58, PETRI_TRANSITIONS=52} [2022-12-13 18:40:52,473 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -21 predicate places. [2022-12-13 18:40:52,473 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 52 transitions, 224 flow [2022-12-13 18:40:52,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 148.6) internal successors, (743), 5 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:52,474 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:40:52,474 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:40:52,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 18:40:52,474 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:40:52,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:40:52,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1909682225, now seen corresponding path program 1 times [2022-12-13 18:40:52,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:40:52,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488192498] [2022-12-13 18:40:52,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:52,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:40:52,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:52,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:40:52,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:40:52,738 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488192498] [2022-12-13 18:40:52,738 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488192498] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:40:52,738 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:40:52,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:40:52,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3947612] [2022-12-13 18:40:52,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:40:52,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:40:52,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:40:52,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:40:52,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:40:52,804 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 349 [2022-12-13 18:40:52,805 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 52 transitions, 224 flow. Second operand has 5 states, 5 states have (on average 154.6) internal successors, (773), 5 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:52,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:40:52,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 349 [2022-12-13 18:40:52,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:40:53,853 INFO L130 PetriNetUnfolder]: 7903/11658 cut-off events. [2022-12-13 18:40:53,853 INFO L131 PetriNetUnfolder]: For 6078/6078 co-relation queries the response was YES. [2022-12-13 18:40:53,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31878 conditions, 11658 events. 7903/11658 cut-off events. For 6078/6078 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 76254 event pairs, 2968 based on Foata normal form. 90/11078 useless extension candidates. Maximal degree in co-relation 31869. Up to 7011 conditions per place. [2022-12-13 18:40:53,901 INFO L137 encePairwiseOnDemand]: 346/349 looper letters, 67 selfloop transitions, 3 changer transitions 0/76 dead transitions. [2022-12-13 18:40:53,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 76 transitions, 435 flow [2022-12-13 18:40:53,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:40:53,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:40:53,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 666 transitions. [2022-12-13 18:40:53,904 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47707736389684813 [2022-12-13 18:40:53,904 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 666 transitions. [2022-12-13 18:40:53,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 666 transitions. [2022-12-13 18:40:53,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:40:53,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 666 transitions. [2022-12-13 18:40:53,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.5) internal successors, (666), 4 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:53,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:53,909 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:53,909 INFO L175 Difference]: Start difference. First operand has 58 places, 52 transitions, 224 flow. Second operand 4 states and 666 transitions. [2022-12-13 18:40:53,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 76 transitions, 435 flow [2022-12-13 18:40:53,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 76 transitions, 430 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:40:53,991 INFO L231 Difference]: Finished difference. Result has 58 places, 51 transitions, 221 flow [2022-12-13 18:40:53,991 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=221, PETRI_PLACES=58, PETRI_TRANSITIONS=51} [2022-12-13 18:40:53,991 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -21 predicate places. [2022-12-13 18:40:53,991 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 51 transitions, 221 flow [2022-12-13 18:40:53,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 154.6) internal successors, (773), 5 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:53,992 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:40:53,992 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:40:53,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 18:40:53,992 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:40:53,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:40:53,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1911738683, now seen corresponding path program 1 times [2022-12-13 18:40:53,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:40:53,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156587527] [2022-12-13 18:40:53,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:40:54,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:54,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:40:54,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:40:54,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156587527] [2022-12-13 18:40:54,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156587527] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:40:54,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:40:54,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:40:54,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995050620] [2022-12-13 18:40:54,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:40:54,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:40:54,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:40:54,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:40:54,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:40:54,196 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 349 [2022-12-13 18:40:54,197 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 51 transitions, 221 flow. Second operand has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:54,197 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:40:54,197 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 349 [2022-12-13 18:40:54,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:40:55,362 INFO L130 PetriNetUnfolder]: 7361/10661 cut-off events. [2022-12-13 18:40:55,362 INFO L131 PetriNetUnfolder]: For 6096/6162 co-relation queries the response was YES. [2022-12-13 18:40:55,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29802 conditions, 10661 events. 7361/10661 cut-off events. For 6096/6162 co-relation queries the response was YES. Maximal size of possible extension queue 676. Compared 64622 event pairs, 4680 based on Foata normal form. 24/9928 useless extension candidates. Maximal degree in co-relation 29794. Up to 6586 conditions per place. [2022-12-13 18:40:55,399 INFO L137 encePairwiseOnDemand]: 346/349 looper letters, 62 selfloop transitions, 3 changer transitions 0/74 dead transitions. [2022-12-13 18:40:55,399 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 74 transitions, 418 flow [2022-12-13 18:40:55,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:40:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:40:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 526 transitions. [2022-12-13 18:40:55,401 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5023877745940784 [2022-12-13 18:40:55,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 526 transitions. [2022-12-13 18:40:55,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 526 transitions. [2022-12-13 18:40:55,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:40:55,401 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 526 transitions. [2022-12-13 18:40:55,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 175.33333333333334) internal successors, (526), 3 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 18:40:55,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:55,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:55,403 INFO L175 Difference]: Start difference. First operand has 58 places, 51 transitions, 221 flow. Second operand 3 states and 526 transitions. [2022-12-13 18:40:55,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 74 transitions, 418 flow [2022-12-13 18:40:55,439 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 74 transitions, 414 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:40:55,439 INFO L231 Difference]: Finished difference. Result has 59 places, 51 transitions, 228 flow [2022-12-13 18:40:55,439 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=59, PETRI_TRANSITIONS=51} [2022-12-13 18:40:55,440 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -20 predicate places. [2022-12-13 18:40:55,440 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 51 transitions, 228 flow [2022-12-13 18:40:55,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.33333333333334) internal successors, (484), 3 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:55,440 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:40:55,440 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:40:55,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 18:40:55,441 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:40:55,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:40:55,441 INFO L85 PathProgramCache]: Analyzing trace with hash 648979917, now seen corresponding path program 1 times [2022-12-13 18:40:55,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:40:55,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222441780] [2022-12-13 18:40:55,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:55,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:40:55,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:55,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:40:55,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:40:55,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222441780] [2022-12-13 18:40:55,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222441780] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:40:55,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:40:55,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:40:55,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67691256] [2022-12-13 18:40:55,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:40:55,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:40:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:40:55,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:40:55,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:40:55,575 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 349 [2022-12-13 18:40:55,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 156.5) internal successors, (626), 4 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:55,577 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:40:55,577 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 349 [2022-12-13 18:40:55,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:40:57,457 INFO L130 PetriNetUnfolder]: 12984/19135 cut-off events. [2022-12-13 18:40:57,457 INFO L131 PetriNetUnfolder]: For 16053/16474 co-relation queries the response was YES. [2022-12-13 18:40:57,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54716 conditions, 19135 events. 12984/19135 cut-off events. For 16053/16474 co-relation queries the response was YES. Maximal size of possible extension queue 1172. Compared 134981 event pairs, 3830 based on Foata normal form. 220/17956 useless extension candidates. Maximal degree in co-relation 54707. Up to 6763 conditions per place. [2022-12-13 18:40:57,541 INFO L137 encePairwiseOnDemand]: 345/349 looper letters, 106 selfloop transitions, 3 changer transitions 0/117 dead transitions. [2022-12-13 18:40:57,541 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 117 transitions, 769 flow [2022-12-13 18:40:57,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:40:57,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:40:57,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 687 transitions. [2022-12-13 18:40:57,543 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49212034383954156 [2022-12-13 18:40:57,543 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 687 transitions. [2022-12-13 18:40:57,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 687 transitions. [2022-12-13 18:40:57,543 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:40:57,543 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 687 transitions. [2022-12-13 18:40:57,544 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 171.75) internal successors, (687), 4 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 18:40:57,545 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:57,546 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:57,546 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 228 flow. Second operand 4 states and 687 transitions. [2022-12-13 18:40:57,546 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 117 transitions, 769 flow [2022-12-13 18:40:57,596 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 117 transitions, 755 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:40:57,597 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 241 flow [2022-12-13 18:40:57,598 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=241, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2022-12-13 18:40:57,598 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -17 predicate places. [2022-12-13 18:40:57,598 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 241 flow [2022-12-13 18:40:57,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.5) internal successors, (626), 4 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:57,598 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:40:57,598 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:40:57,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 18:40:57,599 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:40:57,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:40:57,599 INFO L85 PathProgramCache]: Analyzing trace with hash 929482270, now seen corresponding path program 1 times [2022-12-13 18:40:57,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:40:57,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883323443] [2022-12-13 18:40:57,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:57,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:40:57,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:57,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 18:40:57,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:40:57,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883323443] [2022-12-13 18:40:57,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883323443] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:40:57,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:40:57,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:40:57,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27486491] [2022-12-13 18:40:57,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:40:57,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:40:57,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:40:57,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:40:57,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:40:57,803 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 145 out of 349 [2022-12-13 18:40:57,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 241 flow. Second operand has 5 states, 5 states have (on average 147.8) internal successors, (739), 5 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:57,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:40:57,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 145 of 349 [2022-12-13 18:40:57,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:40:59,268 INFO L130 PetriNetUnfolder]: 10307/14782 cut-off events. [2022-12-13 18:40:59,268 INFO L131 PetriNetUnfolder]: For 6884/6904 co-relation queries the response was YES. [2022-12-13 18:40:59,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44237 conditions, 14782 events. 10307/14782 cut-off events. For 6884/6904 co-relation queries the response was YES. Maximal size of possible extension queue 954. Compared 93405 event pairs, 3736 based on Foata normal form. 163/14022 useless extension candidates. Maximal degree in co-relation 44226. Up to 6519 conditions per place. [2022-12-13 18:40:59,343 INFO L137 encePairwiseOnDemand]: 337/349 looper letters, 56 selfloop transitions, 15 changer transitions 0/76 dead transitions. [2022-12-13 18:40:59,343 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 76 transitions, 481 flow [2022-12-13 18:40:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:40:59,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:40:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 639 transitions. [2022-12-13 18:40:59,345 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4577363896848137 [2022-12-13 18:40:59,345 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 639 transitions. [2022-12-13 18:40:59,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 639 transitions. [2022-12-13 18:40:59,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:40:59,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 639 transitions. [2022-12-13 18:40:59,347 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.75) internal successors, (639), 4 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:59,349 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:59,349 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:59,350 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 241 flow. Second operand 4 states and 639 transitions. [2022-12-13 18:40:59,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 76 transitions, 481 flow [2022-12-13 18:40:59,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 76 transitions, 475 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:40:59,435 INFO L231 Difference]: Finished difference. Result has 65 places, 57 transitions, 340 flow [2022-12-13 18:40:59,435 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=237, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=340, PETRI_PLACES=65, PETRI_TRANSITIONS=57} [2022-12-13 18:40:59,436 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -14 predicate places. [2022-12-13 18:40:59,436 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 57 transitions, 340 flow [2022-12-13 18:40:59,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 147.8) internal successors, (739), 5 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:59,436 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:40:59,436 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:40:59,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 18:40:59,436 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:40:59,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:40:59,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1250818060, now seen corresponding path program 1 times [2022-12-13 18:40:59,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:40:59,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656970763] [2022-12-13 18:40:59,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:40:59,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:40:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:40:59,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:40:59,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:40:59,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656970763] [2022-12-13 18:40:59,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656970763] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:40:59,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:40:59,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-13 18:40:59,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864756049] [2022-12-13 18:40:59,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:40:59,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-13 18:40:59,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:40:59,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-13 18:40:59,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-12-13 18:40:59,834 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 349 [2022-12-13 18:40:59,836 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 57 transitions, 340 flow. Second operand has 8 states, 8 states have (on average 141.875) internal successors, (1135), 8 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:40:59,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:40:59,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 349 [2022-12-13 18:40:59,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:41:01,250 INFO L130 PetriNetUnfolder]: 9410/13488 cut-off events. [2022-12-13 18:41:01,250 INFO L131 PetriNetUnfolder]: For 10685/10705 co-relation queries the response was YES. [2022-12-13 18:41:01,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43800 conditions, 13488 events. 9410/13488 cut-off events. For 10685/10705 co-relation queries the response was YES. Maximal size of possible extension queue 845. Compared 83727 event pairs, 2459 based on Foata normal form. 163/12784 useless extension candidates. Maximal degree in co-relation 43788. Up to 4805 conditions per place. [2022-12-13 18:41:01,298 INFO L137 encePairwiseOnDemand]: 335/349 looper letters, 82 selfloop transitions, 21 changer transitions 0/108 dead transitions. [2022-12-13 18:41:01,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 108 transitions, 804 flow [2022-12-13 18:41:01,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:41:01,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:41:01,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 917 transitions. [2022-12-13 18:41:01,300 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4379178605539637 [2022-12-13 18:41:01,300 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 917 transitions. [2022-12-13 18:41:01,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 917 transitions. [2022-12-13 18:41:01,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:41:01,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 917 transitions. [2022-12-13 18:41:01,303 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 152.83333333333334) internal successors, (917), 6 states have internal predecessors, (917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:01,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 349.0) internal successors, (2443), 7 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:01,305 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 349.0) internal successors, (2443), 7 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:01,305 INFO L175 Difference]: Start difference. First operand has 65 places, 57 transitions, 340 flow. Second operand 6 states and 917 transitions. [2022-12-13 18:41:01,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 108 transitions, 804 flow [2022-12-13 18:41:01,384 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 108 transitions, 797 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:41:01,385 INFO L231 Difference]: Finished difference. Result has 72 places, 66 transitions, 514 flow [2022-12-13 18:41:01,385 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=514, PETRI_PLACES=72, PETRI_TRANSITIONS=66} [2022-12-13 18:41:01,386 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -7 predicate places. [2022-12-13 18:41:01,386 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 66 transitions, 514 flow [2022-12-13 18:41:01,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 141.875) internal successors, (1135), 8 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:01,386 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:41:01,386 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:01,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 18:41:01,387 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:41:01,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:01,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1333983228, now seen corresponding path program 1 times [2022-12-13 18:41:01,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:41:01,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393801453] [2022-12-13 18:41:01,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:01,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:41:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:01,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:41:01,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:41:01,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393801453] [2022-12-13 18:41:01,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393801453] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:41:01,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:41:01,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:41:01,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921798223] [2022-12-13 18:41:01,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:41:01,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:41:01,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:41:01,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:41:01,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:41:01,581 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 349 [2022-12-13 18:41:01,582 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 66 transitions, 514 flow. Second operand has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:01,582 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:41:01,582 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 349 [2022-12-13 18:41:01,582 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:41:03,710 INFO L130 PetriNetUnfolder]: 15613/22775 cut-off events. [2022-12-13 18:41:03,710 INFO L131 PetriNetUnfolder]: For 45299/45560 co-relation queries the response was YES. [2022-12-13 18:41:03,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79363 conditions, 22775 events. 15613/22775 cut-off events. For 45299/45560 co-relation queries the response was YES. Maximal size of possible extension queue 1360. Compared 161532 event pairs, 5240 based on Foata normal form. 90/21222 useless extension candidates. Maximal degree in co-relation 79348. Up to 8016 conditions per place. [2022-12-13 18:41:03,826 INFO L137 encePairwiseOnDemand]: 345/349 looper letters, 114 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2022-12-13 18:41:03,826 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 130 transitions, 1172 flow [2022-12-13 18:41:03,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:41:03,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:41:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 690 transitions. [2022-12-13 18:41:03,828 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49426934097421205 [2022-12-13 18:41:03,828 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 690 transitions. [2022-12-13 18:41:03,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 690 transitions. [2022-12-13 18:41:03,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:41:03,828 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 690 transitions. [2022-12-13 18:41:03,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 172.5) internal successors, (690), 4 states have internal predecessors, (690), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:03,831 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:03,831 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:03,831 INFO L175 Difference]: Start difference. First operand has 72 places, 66 transitions, 514 flow. Second operand 4 states and 690 transitions. [2022-12-13 18:41:03,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 130 transitions, 1172 flow [2022-12-13 18:41:03,976 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 130 transitions, 1135 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:41:03,977 INFO L231 Difference]: Finished difference. Result has 75 places, 68 transitions, 524 flow [2022-12-13 18:41:03,977 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=524, PETRI_PLACES=75, PETRI_TRANSITIONS=68} [2022-12-13 18:41:03,977 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -4 predicate places. [2022-12-13 18:41:03,977 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 68 transitions, 524 flow [2022-12-13 18:41:03,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.75) internal successors, (627), 4 states have internal predecessors, (627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:03,978 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:41:03,978 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:03,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 18:41:03,978 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:41:03,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:03,978 INFO L85 PathProgramCache]: Analyzing trace with hash 554702998, now seen corresponding path program 1 times [2022-12-13 18:41:03,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:41:03,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431903711] [2022-12-13 18:41:03,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:03,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:41:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:04,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 18:41:04,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:41:04,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431903711] [2022-12-13 18:41:04,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431903711] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:41:04,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:41:04,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-12-13 18:41:04,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144495257] [2022-12-13 18:41:04,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:41:04,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-12-13 18:41:04,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:41:04,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-12-13 18:41:04,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-12-13 18:41:05,085 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 349 [2022-12-13 18:41:05,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 68 transitions, 524 flow. Second operand has 12 states, 12 states have (on average 136.5) internal successors, (1638), 12 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:05,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:41:05,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 349 [2022-12-13 18:41:05,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:41:07,888 INFO L130 PetriNetUnfolder]: 15807/23469 cut-off events. [2022-12-13 18:41:07,888 INFO L131 PetriNetUnfolder]: For 36156/36575 co-relation queries the response was YES. [2022-12-13 18:41:07,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81879 conditions, 23469 events. 15807/23469 cut-off events. For 36156/36575 co-relation queries the response was YES. Maximal size of possible extension queue 1414. Compared 169313 event pairs, 6567 based on Foata normal form. 78/22592 useless extension candidates. Maximal degree in co-relation 81861. Up to 12000 conditions per place. [2022-12-13 18:41:08,022 INFO L137 encePairwiseOnDemand]: 339/349 looper letters, 129 selfloop transitions, 26 changer transitions 5/172 dead transitions. [2022-12-13 18:41:08,023 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 172 transitions, 1381 flow [2022-12-13 18:41:08,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:41:08,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 18:41:08,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1601 transitions. [2022-12-13 18:41:08,026 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4170356863766606 [2022-12-13 18:41:08,026 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1601 transitions. [2022-12-13 18:41:08,026 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1601 transitions. [2022-12-13 18:41:08,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:41:08,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1601 transitions. [2022-12-13 18:41:08,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 145.54545454545453) internal successors, (1601), 11 states have internal predecessors, (1601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:08,031 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 349.0) internal successors, (4188), 12 states have internal predecessors, (4188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:08,032 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 349.0) internal successors, (4188), 12 states have internal predecessors, (4188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:08,032 INFO L175 Difference]: Start difference. First operand has 75 places, 68 transitions, 524 flow. Second operand 11 states and 1601 transitions. [2022-12-13 18:41:08,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 172 transitions, 1381 flow [2022-12-13 18:41:08,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 82 places, 172 transitions, 1355 flow, removed 2 selfloop flow, removed 3 redundant places. [2022-12-13 18:41:08,405 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 790 flow [2022-12-13 18:41:08,405 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=790, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2022-12-13 18:41:08,406 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, 10 predicate places. [2022-12-13 18:41:08,406 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 790 flow [2022-12-13 18:41:08,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 136.5) internal successors, (1638), 12 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:08,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:41:08,406 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:08,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 18:41:08,407 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:41:08,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:08,407 INFO L85 PathProgramCache]: Analyzing trace with hash -120653724, now seen corresponding path program 1 times [2022-12-13 18:41:08,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:41:08,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017686349] [2022-12-13 18:41:08,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:08,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:41:08,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:08,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:41:08,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:41:08,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017686349] [2022-12-13 18:41:08,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017686349] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:41:08,654 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:41:08,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:41:08,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336061874] [2022-12-13 18:41:08,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:41:08,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 18:41:08,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:41:08,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 18:41:08,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:41:08,956 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 349 [2022-12-13 18:41:08,958 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 790 flow. Second operand has 10 states, 10 states have (on average 140.6) internal successors, (1406), 10 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:08,958 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:41:08,958 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 349 [2022-12-13 18:41:08,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:41:12,831 INFO L130 PetriNetUnfolder]: 25645/37712 cut-off events. [2022-12-13 18:41:12,831 INFO L131 PetriNetUnfolder]: For 87010/87130 co-relation queries the response was YES. [2022-12-13 18:41:12,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133130 conditions, 37712 events. 25645/37712 cut-off events. For 87010/87130 co-relation queries the response was YES. Maximal size of possible extension queue 2148. Compared 282490 event pairs, 5947 based on Foata normal form. 395/37218 useless extension candidates. Maximal degree in co-relation 133106. Up to 9736 conditions per place. [2022-12-13 18:41:13,030 INFO L137 encePairwiseOnDemand]: 333/349 looper letters, 128 selfloop transitions, 59 changer transitions 1/193 dead transitions. [2022-12-13 18:41:13,030 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 193 transitions, 1904 flow [2022-12-13 18:41:13,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 18:41:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 18:41:13,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1214 transitions. [2022-12-13 18:41:13,033 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4348137535816619 [2022-12-13 18:41:13,033 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1214 transitions. [2022-12-13 18:41:13,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1214 transitions. [2022-12-13 18:41:13,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:41:13,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1214 transitions. [2022-12-13 18:41:13,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 151.75) internal successors, (1214), 8 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:13,037 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 349.0) internal successors, (3141), 9 states have internal predecessors, (3141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:13,038 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 349.0) internal successors, (3141), 9 states have internal predecessors, (3141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:13,038 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 790 flow. Second operand 8 states and 1214 transitions. [2022-12-13 18:41:13,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 193 transitions, 1904 flow [2022-12-13 18:41:14,068 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 193 transitions, 1880 flow, removed 12 selfloop flow, removed 0 redundant places. [2022-12-13 18:41:14,069 INFO L231 Difference]: Finished difference. Result has 100 places, 123 transitions, 1440 flow [2022-12-13 18:41:14,070 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=778, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=1440, PETRI_PLACES=100, PETRI_TRANSITIONS=123} [2022-12-13 18:41:14,070 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, 21 predicate places. [2022-12-13 18:41:14,070 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 123 transitions, 1440 flow [2022-12-13 18:41:14,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 140.6) internal successors, (1406), 10 states have internal predecessors, (1406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:14,071 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:41:14,071 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:14,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 18:41:14,071 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:41:14,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:14,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1635429641, now seen corresponding path program 1 times [2022-12-13 18:41:14,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:41:14,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324585426] [2022-12-13 18:41:14,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:14,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:41:14,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:41:14,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:41:14,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324585426] [2022-12-13 18:41:14,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324585426] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:41:14,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:41:14,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:41:14,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603395324] [2022-12-13 18:41:14,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:41:14,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:41:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:41:14,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:41:14,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:41:14,385 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 349 [2022-12-13 18:41:14,386 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 123 transitions, 1440 flow. Second operand has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:14,386 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:41:14,386 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 349 [2022-12-13 18:41:14,386 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:41:18,168 INFO L130 PetriNetUnfolder]: 25546/36189 cut-off events. [2022-12-13 18:41:18,169 INFO L131 PetriNetUnfolder]: For 110354/110534 co-relation queries the response was YES. [2022-12-13 18:41:18,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 143777 conditions, 36189 events. 25546/36189 cut-off events. For 110354/110534 co-relation queries the response was YES. Maximal size of possible extension queue 2091. Compared 255118 event pairs, 2860 based on Foata normal form. 204/35488 useless extension candidates. Maximal degree in co-relation 143749. Up to 30412 conditions per place. [2022-12-13 18:41:18,394 INFO L137 encePairwiseOnDemand]: 341/349 looper letters, 158 selfloop transitions, 21 changer transitions 0/184 dead transitions. [2022-12-13 18:41:18,395 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 184 transitions, 2462 flow [2022-12-13 18:41:18,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:41:18,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:41:18,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 650 transitions. [2022-12-13 18:41:18,397 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4656160458452722 [2022-12-13 18:41:18,397 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 650 transitions. [2022-12-13 18:41:18,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 650 transitions. [2022-12-13 18:41:18,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:41:18,397 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 650 transitions. [2022-12-13 18:41:18,398 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 162.5) internal successors, (650), 4 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:18,400 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:18,400 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:18,400 INFO L175 Difference]: Start difference. First operand has 100 places, 123 transitions, 1440 flow. Second operand 4 states and 650 transitions. [2022-12-13 18:41:18,400 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 184 transitions, 2462 flow [2022-12-13 18:41:21,158 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 184 transitions, 2439 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:41:21,160 INFO L231 Difference]: Finished difference. Result has 103 places, 142 transitions, 1839 flow [2022-12-13 18:41:21,160 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1425, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1839, PETRI_PLACES=103, PETRI_TRANSITIONS=142} [2022-12-13 18:41:21,160 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, 24 predicate places. [2022-12-13 18:41:21,160 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 142 transitions, 1839 flow [2022-12-13 18:41:21,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 151.0) internal successors, (755), 5 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:21,161 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:41:21,161 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:21,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 18:41:21,161 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:41:21,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:21,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1194044480, now seen corresponding path program 1 times [2022-12-13 18:41:21,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:41:21,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577397452] [2022-12-13 18:41:21,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:21,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:41:21,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:41:21,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:41:21,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577397452] [2022-12-13 18:41:21,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577397452] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:41:21,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:41:21,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-12-13 18:41:21,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904071549] [2022-12-13 18:41:21,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:41:21,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 18:41:21,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:41:21,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 18:41:21,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2022-12-13 18:41:22,514 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 349 [2022-12-13 18:41:22,516 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 142 transitions, 1839 flow. Second operand has 13 states, 13 states have (on average 134.46153846153845) internal successors, (1748), 13 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:22,516 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:41:22,516 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 349 [2022-12-13 18:41:22,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:41:30,080 INFO L130 PetriNetUnfolder]: 38650/55234 cut-off events. [2022-12-13 18:41:30,080 INFO L131 PetriNetUnfolder]: For 204726/205550 co-relation queries the response was YES. [2022-12-13 18:41:30,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 231135 conditions, 55234 events. 38650/55234 cut-off events. For 204726/205550 co-relation queries the response was YES. Maximal size of possible extension queue 3031. Compared 406699 event pairs, 15950 based on Foata normal form. 52/53736 useless extension candidates. Maximal degree in co-relation 231104. Up to 15894 conditions per place. [2022-12-13 18:41:30,420 INFO L137 encePairwiseOnDemand]: 338/349 looper letters, 192 selfloop transitions, 83 changer transitions 7/299 dead transitions. [2022-12-13 18:41:30,421 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 299 transitions, 3579 flow [2022-12-13 18:41:30,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-13 18:41:30,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-12-13 18:41:30,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1872 transitions. [2022-12-13 18:41:30,424 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41260744985673353 [2022-12-13 18:41:30,424 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1872 transitions. [2022-12-13 18:41:30,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1872 transitions. [2022-12-13 18:41:30,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:41:30,425 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1872 transitions. [2022-12-13 18:41:30,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 144.0) internal successors, (1872), 13 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:30,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 349.0) internal successors, (4886), 14 states have internal predecessors, (4886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:30,431 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 349.0) internal successors, (4886), 14 states have internal predecessors, (4886), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:30,431 INFO L175 Difference]: Start difference. First operand has 103 places, 142 transitions, 1839 flow. Second operand 13 states and 1872 transitions. [2022-12-13 18:41:30,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 299 transitions, 3579 flow [2022-12-13 18:41:35,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 299 transitions, 3566 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:41:35,948 INFO L231 Difference]: Finished difference. Result has 122 places, 184 transitions, 2737 flow [2022-12-13 18:41:35,948 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=1836, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=46, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2737, PETRI_PLACES=122, PETRI_TRANSITIONS=184} [2022-12-13 18:41:35,949 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, 43 predicate places. [2022-12-13 18:41:35,949 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 184 transitions, 2737 flow [2022-12-13 18:41:35,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 134.46153846153845) internal successors, (1748), 13 states have internal predecessors, (1748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:35,949 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:41:35,949 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:35,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 18:41:35,950 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:41:35,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:35,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2141502142, now seen corresponding path program 1 times [2022-12-13 18:41:35,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:41:35,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220450712] [2022-12-13 18:41:35,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:35,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:41:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:36,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:41:36,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:41:36,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220450712] [2022-12-13 18:41:36,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220450712] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:41:36,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:41:36,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:41:36,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646886612] [2022-12-13 18:41:36,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:41:36,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 18:41:36,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:41:36,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 18:41:36,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:41:36,498 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 349 [2022-12-13 18:41:36,499 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 184 transitions, 2737 flow. Second operand has 10 states, 10 states have (on average 139.7) internal successors, (1397), 10 states have internal predecessors, (1397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:36,499 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:41:36,499 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 349 [2022-12-13 18:41:36,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:41:43,185 INFO L130 PetriNetUnfolder]: 34654/49173 cut-off events. [2022-12-13 18:41:43,185 INFO L131 PetriNetUnfolder]: For 225191/225549 co-relation queries the response was YES. [2022-12-13 18:41:43,411 INFO L83 FinitePrefix]: Finished finitePrefix Result has 208894 conditions, 49173 events. 34654/49173 cut-off events. For 225191/225549 co-relation queries the response was YES. Maximal size of possible extension queue 2795. Compared 359833 event pairs, 10065 based on Foata normal form. 414/48985 useless extension candidates. Maximal degree in co-relation 208855. Up to 23357 conditions per place. [2022-12-13 18:41:43,550 INFO L137 encePairwiseOnDemand]: 334/349 looper letters, 190 selfloop transitions, 115 changer transitions 1/315 dead transitions. [2022-12-13 18:41:43,550 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 315 transitions, 5010 flow [2022-12-13 18:41:43,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 18:41:43,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 18:41:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1191 transitions. [2022-12-13 18:41:43,553 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4265759312320917 [2022-12-13 18:41:43,553 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1191 transitions. [2022-12-13 18:41:43,553 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1191 transitions. [2022-12-13 18:41:43,553 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:41:43,553 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1191 transitions. [2022-12-13 18:41:43,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 148.875) internal successors, (1191), 8 states have internal predecessors, (1191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:43,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 349.0) internal successors, (3141), 9 states have internal predecessors, (3141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:43,557 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 349.0) internal successors, (3141), 9 states have internal predecessors, (3141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:43,557 INFO L175 Difference]: Start difference. First operand has 122 places, 184 transitions, 2737 flow. Second operand 8 states and 1191 transitions. [2022-12-13 18:41:43,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 315 transitions, 5010 flow [2022-12-13 18:41:51,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 129 places, 315 transitions, 4948 flow, removed 31 selfloop flow, removed 0 redundant places. [2022-12-13 18:41:51,640 INFO L231 Difference]: Finished difference. Result has 132 places, 225 transitions, 3867 flow [2022-12-13 18:41:51,640 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=2693, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=3867, PETRI_PLACES=132, PETRI_TRANSITIONS=225} [2022-12-13 18:41:51,640 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, 53 predicate places. [2022-12-13 18:41:51,640 INFO L495 AbstractCegarLoop]: Abstraction has has 132 places, 225 transitions, 3867 flow [2022-12-13 18:41:51,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 139.7) internal successors, (1397), 10 states have internal predecessors, (1397), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:51,641 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:41:51,641 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:41:51,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 18:41:51,641 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:41:51,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:41:51,641 INFO L85 PathProgramCache]: Analyzing trace with hash 554705548, now seen corresponding path program 1 times [2022-12-13 18:41:51,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:41:51,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892675979] [2022-12-13 18:41:51,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:41:51,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:41:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:41:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:41:51,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:41:51,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892675979] [2022-12-13 18:41:51,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892675979] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:41:51,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:41:51,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:41:51,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583629469] [2022-12-13 18:41:51,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:41:51,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:41:51,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:41:51,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:41:51,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:41:51,729 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 349 [2022-12-13 18:41:51,730 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 225 transitions, 3867 flow. Second operand has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:51,730 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:41:51,730 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 349 [2022-12-13 18:41:51,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:41:58,394 INFO L130 PetriNetUnfolder]: 33753/47682 cut-off events. [2022-12-13 18:41:58,394 INFO L131 PetriNetUnfolder]: For 274965/275319 co-relation queries the response was YES. [2022-12-13 18:41:58,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218035 conditions, 47682 events. 33753/47682 cut-off events. For 274965/275319 co-relation queries the response was YES. Maximal size of possible extension queue 2706. Compared 344365 event pairs, 18601 based on Foata normal form. 393/47534 useless extension candidates. Maximal degree in co-relation 217993. Up to 32282 conditions per place. [2022-12-13 18:41:58,703 INFO L137 encePairwiseOnDemand]: 336/349 looper letters, 64 selfloop transitions, 28 changer transitions 139/239 dead transitions. [2022-12-13 18:41:58,703 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 239 transitions, 4433 flow [2022-12-13 18:41:58,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:41:58,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:41:58,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 637 transitions. [2022-12-13 18:41:58,705 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45630372492836674 [2022-12-13 18:41:58,705 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 637 transitions. [2022-12-13 18:41:58,705 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 637 transitions. [2022-12-13 18:41:58,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:41:58,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 637 transitions. [2022-12-13 18:41:58,707 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 159.25) internal successors, (637), 4 states have internal predecessors, (637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:58,708 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:58,708 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:41:58,708 INFO L175 Difference]: Start difference. First operand has 132 places, 225 transitions, 3867 flow. Second operand 4 states and 637 transitions. [2022-12-13 18:41:58,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 239 transitions, 4433 flow [2022-12-13 18:42:10,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 239 transitions, 4299 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 18:42:10,870 INFO L231 Difference]: Finished difference. Result has 131 places, 90 transitions, 1136 flow [2022-12-13 18:42:10,870 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=3723, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1136, PETRI_PLACES=131, PETRI_TRANSITIONS=90} [2022-12-13 18:42:10,871 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, 52 predicate places. [2022-12-13 18:42:10,871 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 90 transitions, 1136 flow [2022-12-13 18:42:10,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 151.25) internal successors, (605), 4 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:10,871 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:42:10,871 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:10,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 18:42:10,872 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:42:10,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:10,872 INFO L85 PathProgramCache]: Analyzing trace with hash 148112993, now seen corresponding path program 1 times [2022-12-13 18:42:10,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:10,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935520031] [2022-12-13 18:42:10,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:10,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:10,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:42:10,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:42:10,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935520031] [2022-12-13 18:42:10,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935520031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:10,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:42:10,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:42:10,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078646283] [2022-12-13 18:42:10,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:10,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:42:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:42:10,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:42:10,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:42:10,986 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 349 [2022-12-13 18:42:10,987 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 90 transitions, 1136 flow. Second operand has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:10,987 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:42:10,987 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 349 [2022-12-13 18:42:10,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:42:15,200 INFO L130 PetriNetUnfolder]: 22920/33868 cut-off events. [2022-12-13 18:42:15,200 INFO L131 PetriNetUnfolder]: For 154707/156523 co-relation queries the response was YES. [2022-12-13 18:42:15,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124036 conditions, 33868 events. 22920/33868 cut-off events. For 154707/156523 co-relation queries the response was YES. Maximal size of possible extension queue 1753. Compared 249135 event pairs, 5645 based on Foata normal form. 769/34276 useless extension candidates. Maximal degree in co-relation 123992. Up to 13394 conditions per place. [2022-12-13 18:42:15,441 INFO L137 encePairwiseOnDemand]: 345/349 looper letters, 144 selfloop transitions, 4 changer transitions 4/168 dead transitions. [2022-12-13 18:42:15,441 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 168 transitions, 2515 flow [2022-12-13 18:42:15,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:42:15,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:42:15,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 677 transitions. [2022-12-13 18:42:15,443 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48495702005730656 [2022-12-13 18:42:15,443 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 677 transitions. [2022-12-13 18:42:15,443 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 677 transitions. [2022-12-13 18:42:15,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:42:15,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 677 transitions. [2022-12-13 18:42:15,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.25) internal successors, (677), 4 states have internal predecessors, (677), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:15,445 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:15,446 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:15,446 INFO L175 Difference]: Start difference. First operand has 131 places, 90 transitions, 1136 flow. Second operand 4 states and 677 transitions. [2022-12-13 18:42:15,446 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 168 transitions, 2515 flow [2022-12-13 18:42:18,431 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 168 transitions, 2104 flow, removed 77 selfloop flow, removed 12 redundant places. [2022-12-13 18:42:18,432 INFO L231 Difference]: Finished difference. Result has 112 places, 92 transitions, 972 flow [2022-12-13 18:42:18,433 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=90, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=972, PETRI_PLACES=112, PETRI_TRANSITIONS=92} [2022-12-13 18:42:18,433 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, 33 predicate places. [2022-12-13 18:42:18,433 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 92 transitions, 972 flow [2022-12-13 18:42:18,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.0) internal successors, (628), 4 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:18,433 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:42:18,433 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:18,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 18:42:18,433 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:42:18,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:18,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1717995237, now seen corresponding path program 1 times [2022-12-13 18:42:18,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:18,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692433608] [2022-12-13 18:42:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:42:18,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:42:18,899 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692433608] [2022-12-13 18:42:18,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692433608] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:18,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:42:18,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-12-13 18:42:18,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402452143] [2022-12-13 18:42:18,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:18,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-12-13 18:42:18,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:42:18,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-12-13 18:42:18,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-12-13 18:42:19,560 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 349 [2022-12-13 18:42:19,561 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 92 transitions, 972 flow. Second operand has 11 states, 11 states have (on average 139.72727272727272) internal successors, (1537), 11 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:19,561 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:42:19,561 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 349 [2022-12-13 18:42:19,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:42:22,852 INFO L130 PetriNetUnfolder]: 16102/24961 cut-off events. [2022-12-13 18:42:22,852 INFO L131 PetriNetUnfolder]: For 60711/61157 co-relation queries the response was YES. [2022-12-13 18:42:22,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83935 conditions, 24961 events. 16102/24961 cut-off events. For 60711/61157 co-relation queries the response was YES. Maximal size of possible extension queue 1498. Compared 190624 event pairs, 1097 based on Foata normal form. 928/25842 useless extension candidates. Maximal degree in co-relation 83899. Up to 12871 conditions per place. [2022-12-13 18:42:22,962 INFO L137 encePairwiseOnDemand]: 340/349 looper letters, 35 selfloop transitions, 12 changer transitions 85/140 dead transitions. [2022-12-13 18:42:22,962 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 140 transitions, 1406 flow [2022-12-13 18:42:22,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 18:42:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-12-13 18:42:22,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1597 transitions. [2022-12-13 18:42:22,965 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4159937483719719 [2022-12-13 18:42:22,965 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1597 transitions. [2022-12-13 18:42:22,965 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1597 transitions. [2022-12-13 18:42:22,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:42:22,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1597 transitions. [2022-12-13 18:42:22,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 145.1818181818182) internal successors, (1597), 11 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:22,970 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 349.0) internal successors, (4188), 12 states have internal predecessors, (4188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:22,971 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 349.0) internal successors, (4188), 12 states have internal predecessors, (4188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:22,971 INFO L175 Difference]: Start difference. First operand has 112 places, 92 transitions, 972 flow. Second operand 11 states and 1597 transitions. [2022-12-13 18:42:22,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 140 transitions, 1406 flow [2022-12-13 18:42:23,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 140 transitions, 1287 flow, removed 3 selfloop flow, removed 10 redundant places. [2022-12-13 18:42:23,994 INFO L231 Difference]: Finished difference. Result has 108 places, 42 transitions, 304 flow [2022-12-13 18:42:23,994 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=84, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=304, PETRI_PLACES=108, PETRI_TRANSITIONS=42} [2022-12-13 18:42:23,994 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, 29 predicate places. [2022-12-13 18:42:23,995 INFO L495 AbstractCegarLoop]: Abstraction has has 108 places, 42 transitions, 304 flow [2022-12-13 18:42:23,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 139.72727272727272) internal successors, (1537), 11 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:23,995 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:42:23,995 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:23,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 18:42:23,995 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:42:23,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:23,995 INFO L85 PathProgramCache]: Analyzing trace with hash 755895664, now seen corresponding path program 1 times [2022-12-13 18:42:23,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:23,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874703172] [2022-12-13 18:42:23,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:23,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:24,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:24,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:42:24,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:42:24,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874703172] [2022-12-13 18:42:24,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [874703172] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:24,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:42:24,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:42:24,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390882390] [2022-12-13 18:42:24,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:24,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 18:42:24,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:42:24,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 18:42:24,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:42:24,979 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 349 [2022-12-13 18:42:24,980 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 42 transitions, 304 flow. Second operand has 10 states, 10 states have (on average 136.8) internal successors, (1368), 10 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:24,980 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:42:24,980 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 349 [2022-12-13 18:42:24,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:42:25,882 INFO L130 PetriNetUnfolder]: 4171/6362 cut-off events. [2022-12-13 18:42:25,882 INFO L131 PetriNetUnfolder]: For 10883/10955 co-relation queries the response was YES. [2022-12-13 18:42:25,895 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18381 conditions, 6362 events. 4171/6362 cut-off events. For 10883/10955 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 37657 event pairs, 2755 based on Foata normal form. 96/6443 useless extension candidates. Maximal degree in co-relation 18351. Up to 4553 conditions per place. [2022-12-13 18:42:25,902 INFO L137 encePairwiseOnDemand]: 341/349 looper letters, 49 selfloop transitions, 15 changer transitions 2/72 dead transitions. [2022-12-13 18:42:25,902 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 72 transitions, 567 flow [2022-12-13 18:42:25,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-13 18:42:25,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-13 18:42:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1135 transitions. [2022-12-13 18:42:25,904 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4065186246418338 [2022-12-13 18:42:25,904 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1135 transitions. [2022-12-13 18:42:25,904 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1135 transitions. [2022-12-13 18:42:25,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:42:25,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1135 transitions. [2022-12-13 18:42:25,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 141.875) internal successors, (1135), 8 states have internal predecessors, (1135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:25,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 349.0) internal successors, (3141), 9 states have internal predecessors, (3141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:25,907 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 349.0) internal successors, (3141), 9 states have internal predecessors, (3141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:25,907 INFO L175 Difference]: Start difference. First operand has 108 places, 42 transitions, 304 flow. Second operand 8 states and 1135 transitions. [2022-12-13 18:42:25,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 72 transitions, 567 flow [2022-12-13 18:42:25,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 72 transitions, 466 flow, removed 5 selfloop flow, removed 21 redundant places. [2022-12-13 18:42:25,921 INFO L231 Difference]: Finished difference. Result has 86 places, 48 transitions, 307 flow [2022-12-13 18:42:25,921 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=307, PETRI_PLACES=86, PETRI_TRANSITIONS=48} [2022-12-13 18:42:25,921 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, 7 predicate places. [2022-12-13 18:42:25,921 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 48 transitions, 307 flow [2022-12-13 18:42:25,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 136.8) internal successors, (1368), 10 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:25,921 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:42:25,921 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:25,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 18:42:25,922 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:42:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:25,922 INFO L85 PathProgramCache]: Analyzing trace with hash 126479620, now seen corresponding path program 2 times [2022-12-13 18:42:25,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:25,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975290961] [2022-12-13 18:42:25,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:25,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:26,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:42:26,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:42:26,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975290961] [2022-12-13 18:42:26,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975290961] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:26,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:42:26,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:42:26,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44759347] [2022-12-13 18:42:26,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:26,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 18:42:26,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:42:26,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 18:42:26,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:42:27,246 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 349 [2022-12-13 18:42:27,246 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 48 transitions, 307 flow. Second operand has 10 states, 10 states have (on average 136.8) internal successors, (1368), 10 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:27,246 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:42:27,246 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 349 [2022-12-13 18:42:27,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:42:28,204 INFO L130 PetriNetUnfolder]: 4131/6271 cut-off events. [2022-12-13 18:42:28,204 INFO L131 PetriNetUnfolder]: For 4259/4319 co-relation queries the response was YES. [2022-12-13 18:42:28,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16961 conditions, 6271 events. 4131/6271 cut-off events. For 4259/4319 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 37087 event pairs, 1257 based on Foata normal form. 76/6333 useless extension candidates. Maximal degree in co-relation 16942. Up to 3269 conditions per place. [2022-12-13 18:42:28,219 INFO L137 encePairwiseOnDemand]: 341/349 looper letters, 45 selfloop transitions, 21 changer transitions 4/76 dead transitions. [2022-12-13 18:42:28,219 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 76 transitions, 545 flow [2022-12-13 18:42:28,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 18:42:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 18:42:28,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1273 transitions. [2022-12-13 18:42:28,221 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40528494110156 [2022-12-13 18:42:28,221 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1273 transitions. [2022-12-13 18:42:28,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1273 transitions. [2022-12-13 18:42:28,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:42:28,222 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1273 transitions. [2022-12-13 18:42:28,223 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 141.44444444444446) internal successors, (1273), 9 states have internal predecessors, (1273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:28,224 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 349.0) internal successors, (3490), 10 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:28,225 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 349.0) internal successors, (3490), 10 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:28,225 INFO L175 Difference]: Start difference. First operand has 86 places, 48 transitions, 307 flow. Second operand 9 states and 1273 transitions. [2022-12-13 18:42:28,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 76 transitions, 545 flow [2022-12-13 18:42:28,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 76 transitions, 524 flow, removed 4 selfloop flow, removed 4 redundant places. [2022-12-13 18:42:28,234 INFO L231 Difference]: Finished difference. Result has 92 places, 52 transitions, 365 flow [2022-12-13 18:42:28,234 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=365, PETRI_PLACES=92, PETRI_TRANSITIONS=52} [2022-12-13 18:42:28,234 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, 13 predicate places. [2022-12-13 18:42:28,234 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 52 transitions, 365 flow [2022-12-13 18:42:28,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 136.8) internal successors, (1368), 10 states have internal predecessors, (1368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:28,235 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:42:28,235 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:28,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 18:42:28,235 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:42:28,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:28,236 INFO L85 PathProgramCache]: Analyzing trace with hash 419910112, now seen corresponding path program 3 times [2022-12-13 18:42:28,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:28,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111419876] [2022-12-13 18:42:28,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:28,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:28,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:42:28,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:42:28,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111419876] [2022-12-13 18:42:28,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111419876] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:28,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:42:28,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-13 18:42:28,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91462334] [2022-12-13 18:42:28,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:28,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-12-13 18:42:28,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:42:28,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-12-13 18:42:28,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-12-13 18:42:29,143 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 349 [2022-12-13 18:42:29,145 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 52 transitions, 365 flow. Second operand has 10 states, 10 states have (on average 134.8) internal successors, (1348), 10 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:29,145 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:42:29,145 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 349 [2022-12-13 18:42:29,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:42:30,016 INFO L130 PetriNetUnfolder]: 4111/6239 cut-off events. [2022-12-13 18:42:30,017 INFO L131 PetriNetUnfolder]: For 5778/5830 co-relation queries the response was YES. [2022-12-13 18:42:30,027 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17524 conditions, 6239 events. 4111/6239 cut-off events. For 5778/5830 co-relation queries the response was YES. Maximal size of possible extension queue 343. Compared 36693 event pairs, 1063 based on Foata normal form. 60/6286 useless extension candidates. Maximal degree in co-relation 17505. Up to 3176 conditions per place. [2022-12-13 18:42:30,033 INFO L137 encePairwiseOnDemand]: 342/349 looper letters, 43 selfloop transitions, 22 changer transitions 9/80 dead transitions. [2022-12-13 18:42:30,033 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 80 transitions, 612 flow [2022-12-13 18:42:30,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-13 18:42:30,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2022-12-13 18:42:30,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1391 transitions. [2022-12-13 18:42:30,035 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39856733524355303 [2022-12-13 18:42:30,035 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1391 transitions. [2022-12-13 18:42:30,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1391 transitions. [2022-12-13 18:42:30,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:42:30,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1391 transitions. [2022-12-13 18:42:30,037 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 139.1) internal successors, (1391), 10 states have internal predecessors, (1391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:30,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 349.0) internal successors, (3839), 11 states have internal predecessors, (3839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:30,039 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 349.0) internal successors, (3839), 11 states have internal predecessors, (3839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:30,039 INFO L175 Difference]: Start difference. First operand has 92 places, 52 transitions, 365 flow. Second operand 10 states and 1391 transitions. [2022-12-13 18:42:30,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 80 transitions, 612 flow [2022-12-13 18:42:30,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 80 transitions, 582 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-12-13 18:42:30,061 INFO L231 Difference]: Finished difference. Result has 97 places, 52 transitions, 392 flow [2022-12-13 18:42:30,061 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=392, PETRI_PLACES=97, PETRI_TRANSITIONS=52} [2022-12-13 18:42:30,062 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, 18 predicate places. [2022-12-13 18:42:30,062 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 52 transitions, 392 flow [2022-12-13 18:42:30,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 134.8) internal successors, (1348), 10 states have internal predecessors, (1348), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:30,062 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:42:30,062 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:30,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 18:42:30,062 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:42:30,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:30,063 INFO L85 PathProgramCache]: Analyzing trace with hash -152488283, now seen corresponding path program 1 times [2022-12-13 18:42:30,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:30,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609536579] [2022-12-13 18:42:30,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:30,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:30,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:42:30,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:42:30,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609536579] [2022-12-13 18:42:30,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609536579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:30,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:42:30,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:42:30,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720978822] [2022-12-13 18:42:30,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:30,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:42:30,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:42:30,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:42:30,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:42:30,162 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 349 [2022-12-13 18:42:30,163 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 52 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:30,163 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:42:30,163 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 349 [2022-12-13 18:42:30,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:42:30,649 INFO L130 PetriNetUnfolder]: 2710/4334 cut-off events. [2022-12-13 18:42:30,649 INFO L131 PetriNetUnfolder]: For 5519/5621 co-relation queries the response was YES. [2022-12-13 18:42:30,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11895 conditions, 4334 events. 2710/4334 cut-off events. For 5519/5621 co-relation queries the response was YES. Maximal size of possible extension queue 287. Compared 26510 event pairs, 1018 based on Foata normal form. 100/4395 useless extension candidates. Maximal degree in co-relation 11876. Up to 4038 conditions per place. [2022-12-13 18:42:30,661 INFO L137 encePairwiseOnDemand]: 343/349 looper letters, 51 selfloop transitions, 5 changer transitions 6/77 dead transitions. [2022-12-13 18:42:30,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 77 transitions, 703 flow [2022-12-13 18:42:30,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:42:30,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:42:30,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2022-12-13 18:42:30,662 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47182425978987586 [2022-12-13 18:42:30,662 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 494 transitions. [2022-12-13 18:42:30,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 494 transitions. [2022-12-13 18:42:30,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:42:30,663 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 494 transitions. [2022-12-13 18:42:30,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:30,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:30,664 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:30,664 INFO L175 Difference]: Start difference. First operand has 97 places, 52 transitions, 392 flow. Second operand 3 states and 494 transitions. [2022-12-13 18:42:30,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 77 transitions, 703 flow [2022-12-13 18:42:30,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 77 transitions, 655 flow, removed 6 selfloop flow, removed 8 redundant places. [2022-12-13 18:42:30,668 INFO L231 Difference]: Finished difference. Result has 92 places, 56 transitions, 390 flow [2022-12-13 18:42:30,668 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=92, PETRI_TRANSITIONS=56} [2022-12-13 18:42:30,669 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, 13 predicate places. [2022-12-13 18:42:30,669 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 56 transitions, 390 flow [2022-12-13 18:42:30,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:30,669 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:42:30,669 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:30,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 18:42:30,669 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:42:30,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:30,670 INFO L85 PathProgramCache]: Analyzing trace with hash 367082924, now seen corresponding path program 1 times [2022-12-13 18:42:30,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:30,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101455387] [2022-12-13 18:42:30,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:30,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:30,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:42:30,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:42:30,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101455387] [2022-12-13 18:42:30,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101455387] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:30,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:42:30,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:42:30,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733299265] [2022-12-13 18:42:30,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:30,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:42:30,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:42:30,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:42:30,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:42:30,776 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 349 [2022-12-13 18:42:30,776 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 56 transitions, 390 flow. Second operand has 4 states, 4 states have (on average 156.25) internal successors, (625), 4 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:30,776 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:42:30,776 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 349 [2022-12-13 18:42:30,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:42:31,141 INFO L130 PetriNetUnfolder]: 1758/3024 cut-off events. [2022-12-13 18:42:31,142 INFO L131 PetriNetUnfolder]: For 4165/4277 co-relation queries the response was YES. [2022-12-13 18:42:31,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10286 conditions, 3024 events. 1758/3024 cut-off events. For 4165/4277 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19045 event pairs, 249 based on Foata normal form. 230/3223 useless extension candidates. Maximal degree in co-relation 10266. Up to 2164 conditions per place. [2022-12-13 18:42:31,152 INFO L137 encePairwiseOnDemand]: 343/349 looper letters, 58 selfloop transitions, 9 changer transitions 8/90 dead transitions. [2022-12-13 18:42:31,152 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 90 transitions, 784 flow [2022-12-13 18:42:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:42:31,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:42:31,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 658 transitions. [2022-12-13 18:42:31,153 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4713467048710602 [2022-12-13 18:42:31,154 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 658 transitions. [2022-12-13 18:42:31,154 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 658 transitions. [2022-12-13 18:42:31,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:42:31,154 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 658 transitions. [2022-12-13 18:42:31,154 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 164.5) internal successors, (658), 4 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:31,155 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:31,155 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:31,155 INFO L175 Difference]: Start difference. First operand has 92 places, 56 transitions, 390 flow. Second operand 4 states and 658 transitions. [2022-12-13 18:42:31,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 90 transitions, 784 flow [2022-12-13 18:42:31,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 90 transitions, 779 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:42:31,160 INFO L231 Difference]: Finished difference. Result has 95 places, 60 transitions, 437 flow [2022-12-13 18:42:31,160 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=437, PETRI_PLACES=95, PETRI_TRANSITIONS=60} [2022-12-13 18:42:31,160 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, 16 predicate places. [2022-12-13 18:42:31,161 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 60 transitions, 437 flow [2022-12-13 18:42:31,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.25) internal successors, (625), 4 states have internal predecessors, (625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:31,161 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:42:31,161 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:31,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 18:42:31,161 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:42:31,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:31,161 INFO L85 PathProgramCache]: Analyzing trace with hash 212829059, now seen corresponding path program 1 times [2022-12-13 18:42:31,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:31,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001769679] [2022-12-13 18:42:31,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:31,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:31,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:42:31,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:42:31,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001769679] [2022-12-13 18:42:31,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001769679] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:31,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:42:31,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:42:31,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668509134] [2022-12-13 18:42:31,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:31,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:42:31,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:42:31,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:42:31,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:42:31,269 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 349 [2022-12-13 18:42:31,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 60 transitions, 437 flow. Second operand has 5 states, 5 states have (on average 155.6) internal successors, (778), 5 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:31,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:42:31,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 349 [2022-12-13 18:42:31,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:42:31,565 INFO L130 PetriNetUnfolder]: 1146/2086 cut-off events. [2022-12-13 18:42:31,565 INFO L131 PetriNetUnfolder]: For 5092/5294 co-relation queries the response was YES. [2022-12-13 18:42:31,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8743 conditions, 2086 events. 1146/2086 cut-off events. For 5092/5294 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 12984 event pairs, 83 based on Foata normal form. 265/2320 useless extension candidates. Maximal degree in co-relation 8722. Up to 1121 conditions per place. [2022-12-13 18:42:31,572 INFO L137 encePairwiseOnDemand]: 343/349 looper letters, 63 selfloop transitions, 13 changer transitions 9/100 dead transitions. [2022-12-13 18:42:31,572 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 100 transitions, 902 flow [2022-12-13 18:42:31,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:42:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 18:42:31,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 819 transitions. [2022-12-13 18:42:31,574 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46934097421203436 [2022-12-13 18:42:31,574 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 819 transitions. [2022-12-13 18:42:31,574 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 819 transitions. [2022-12-13 18:42:31,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:42:31,574 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 819 transitions. [2022-12-13 18:42:31,575 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 163.8) internal successors, (819), 5 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:31,576 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:31,576 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:31,576 INFO L175 Difference]: Start difference. First operand has 95 places, 60 transitions, 437 flow. Second operand 5 states and 819 transitions. [2022-12-13 18:42:31,576 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 100 transitions, 902 flow [2022-12-13 18:42:31,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 100 transitions, 884 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 18:42:31,581 INFO L231 Difference]: Finished difference. Result has 98 places, 64 transitions, 487 flow [2022-12-13 18:42:31,581 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=419, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=487, PETRI_PLACES=98, PETRI_TRANSITIONS=64} [2022-12-13 18:42:31,581 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, 19 predicate places. [2022-12-13 18:42:31,581 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 64 transitions, 487 flow [2022-12-13 18:42:31,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 155.6) internal successors, (778), 5 states have internal predecessors, (778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:31,581 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:42:31,582 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:31,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 18:42:31,582 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:42:31,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:31,582 INFO L85 PathProgramCache]: Analyzing trace with hash 762795902, now seen corresponding path program 1 times [2022-12-13 18:42:31,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:31,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22128557] [2022-12-13 18:42:31,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:31,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:31,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:42:31,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 18:42:31,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22128557] [2022-12-13 18:42:31,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22128557] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:31,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:42:31,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:42:31,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047903064] [2022-12-13 18:42:31,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:31,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:42:31,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 18:42:31,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:42:31,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:42:31,697 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 349 [2022-12-13 18:42:31,698 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 64 transitions, 487 flow. Second operand has 6 states, 6 states have (on average 155.16666666666666) internal successors, (931), 6 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:31,698 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:42:31,698 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 349 [2022-12-13 18:42:31,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:42:31,973 INFO L130 PetriNetUnfolder]: 1016/1818 cut-off events. [2022-12-13 18:42:31,973 INFO L131 PetriNetUnfolder]: For 5718/5916 co-relation queries the response was YES. [2022-12-13 18:42:31,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8118 conditions, 1818 events. 1016/1818 cut-off events. For 5718/5916 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11124 event pairs, 63 based on Foata normal form. 175/1962 useless extension candidates. Maximal degree in co-relation 8096. Up to 717 conditions per place. [2022-12-13 18:42:31,980 INFO L137 encePairwiseOnDemand]: 343/349 looper letters, 59 selfloop transitions, 17 changer transitions 9/100 dead transitions. [2022-12-13 18:42:31,980 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 100 transitions, 928 flow [2022-12-13 18:42:31,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:42:31,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:42:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 971 transitions. [2022-12-13 18:42:31,982 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46370582617000955 [2022-12-13 18:42:31,982 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 971 transitions. [2022-12-13 18:42:31,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 971 transitions. [2022-12-13 18:42:31,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:42:31,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 971 transitions. [2022-12-13 18:42:31,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 161.83333333333334) internal successors, (971), 6 states have internal predecessors, (971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:31,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 349.0) internal successors, (2443), 7 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:31,984 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 349.0) internal successors, (2443), 7 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:31,984 INFO L175 Difference]: Start difference. First operand has 98 places, 64 transitions, 487 flow. Second operand 6 states and 971 transitions. [2022-12-13 18:42:31,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 100 transitions, 928 flow [2022-12-13 18:42:32,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 100 transitions, 862 flow, removed 11 selfloop flow, removed 6 redundant places. [2022-12-13 18:42:32,009 INFO L231 Difference]: Finished difference. Result has 98 places, 64 transitions, 478 flow [2022-12-13 18:42:32,009 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=434, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=478, PETRI_PLACES=98, PETRI_TRANSITIONS=64} [2022-12-13 18:42:32,009 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, 19 predicate places. [2022-12-13 18:42:32,010 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 64 transitions, 478 flow [2022-12-13 18:42:32,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 155.16666666666666) internal successors, (931), 6 states have internal predecessors, (931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:32,010 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:42:32,010 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:32,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 18:42:32,010 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:42:32,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:32,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1235806388, now seen corresponding path program 1 times [2022-12-13 18:42:32,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 18:42:32,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968999232] [2022-12-13 18:42:32,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:32,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 18:42:32,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:42:32,044 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:42:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:42:32,097 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 18:42:32,097 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 18:42:32,098 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (55 of 56 remaining) [2022-12-13 18:42:32,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 56 remaining) [2022-12-13 18:42:32,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 56 remaining) [2022-12-13 18:42:32,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 56 remaining) [2022-12-13 18:42:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 56 remaining) [2022-12-13 18:42:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 56 remaining) [2022-12-13 18:42:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 56 remaining) [2022-12-13 18:42:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 56 remaining) [2022-12-13 18:42:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 56 remaining) [2022-12-13 18:42:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 56 remaining) [2022-12-13 18:42:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 56 remaining) [2022-12-13 18:42:32,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 56 remaining) [2022-12-13 18:42:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 56 remaining) [2022-12-13 18:42:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 56 remaining) [2022-12-13 18:42:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 56 remaining) [2022-12-13 18:42:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 56 remaining) [2022-12-13 18:42:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 56 remaining) [2022-12-13 18:42:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 56 remaining) [2022-12-13 18:42:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 56 remaining) [2022-12-13 18:42:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 56 remaining) [2022-12-13 18:42:32,101 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 56 remaining) [2022-12-13 18:42:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 56 remaining) [2022-12-13 18:42:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 56 remaining) [2022-12-13 18:42:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 56 remaining) [2022-12-13 18:42:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 56 remaining) [2022-12-13 18:42:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 56 remaining) [2022-12-13 18:42:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 56 remaining) [2022-12-13 18:42:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 56 remaining) [2022-12-13 18:42:32,102 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 56 remaining) [2022-12-13 18:42:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 56 remaining) [2022-12-13 18:42:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 56 remaining) [2022-12-13 18:42:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 56 remaining) [2022-12-13 18:42:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 56 remaining) [2022-12-13 18:42:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (22 of 56 remaining) [2022-12-13 18:42:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 56 remaining) [2022-12-13 18:42:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 56 remaining) [2022-12-13 18:42:32,103 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 56 remaining) [2022-12-13 18:42:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 56 remaining) [2022-12-13 18:42:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 56 remaining) [2022-12-13 18:42:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 56 remaining) [2022-12-13 18:42:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 56 remaining) [2022-12-13 18:42:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 56 remaining) [2022-12-13 18:42:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 56 remaining) [2022-12-13 18:42:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 56 remaining) [2022-12-13 18:42:32,104 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 56 remaining) [2022-12-13 18:42:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 56 remaining) [2022-12-13 18:42:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 56 remaining) [2022-12-13 18:42:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 56 remaining) [2022-12-13 18:42:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 56 remaining) [2022-12-13 18:42:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 56 remaining) [2022-12-13 18:42:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 56 remaining) [2022-12-13 18:42:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 56 remaining) [2022-12-13 18:42:32,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 56 remaining) [2022-12-13 18:42:32,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 56 remaining) [2022-12-13 18:42:32,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 56 remaining) [2022-12-13 18:42:32,106 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 56 remaining) [2022-12-13 18:42:32,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 18:42:32,106 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:42:32,111 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 18:42:32,111 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:42:32,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:42:32 BasicIcfg [2022-12-13 18:42:32,167 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:42:32,168 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:42:32,168 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:42:32,168 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:42:32,168 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:40:33" (3/4) ... [2022-12-13 18:42:32,170 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 18:42:32,170 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:42:32,171 INFO L158 Benchmark]: Toolchain (without parser) took 119963.22ms. Allocated memory was 127.9MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 91.2MB in the beginning and 879.1MB in the end (delta: -787.9MB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2022-12-13 18:42:32,171 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 100.7MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:42:32,171 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.97ms. Allocated memory is still 127.9MB. Free memory was 90.9MB in the beginning and 63.8MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-12-13 18:42:32,171 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.43ms. Allocated memory is still 127.9MB. Free memory was 63.8MB in the beginning and 61.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:42:32,171 INFO L158 Benchmark]: Boogie Preprocessor took 37.62ms. Allocated memory is still 127.9MB. Free memory was 61.5MB in the beginning and 98.3MB in the end (delta: -36.8MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-12-13 18:42:32,172 INFO L158 Benchmark]: RCFGBuilder took 791.38ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 98.2MB in the beginning and 118.4MB in the end (delta: -20.1MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. [2022-12-13 18:42:32,172 INFO L158 Benchmark]: TraceAbstraction took 118743.70ms. Allocated memory was 155.2MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 117.3MB in the beginning and 879.1MB in the end (delta: -761.8MB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2022-12-13 18:42:32,172 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 3.9GB. Free memory is still 879.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:42:32,174 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 100.7MB. Free memory is still 50.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 342.97ms. Allocated memory is still 127.9MB. Free memory was 90.9MB in the beginning and 63.8MB in the end (delta: 27.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.43ms. Allocated memory is still 127.9MB. Free memory was 63.8MB in the beginning and 61.5MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.62ms. Allocated memory is still 127.9MB. Free memory was 61.5MB in the beginning and 98.3MB in the end (delta: -36.8MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * RCFGBuilder took 791.38ms. Allocated memory was 127.9MB in the beginning and 155.2MB in the end (delta: 27.3MB). Free memory was 98.2MB in the beginning and 118.4MB in the end (delta: -20.1MB). Peak memory consumption was 71.3MB. Max. memory is 16.1GB. * TraceAbstraction took 118743.70ms. Allocated memory was 155.2MB in the beginning and 3.9GB in the end (delta: 3.8GB). Free memory was 117.3MB in the beginning and 879.1MB in the end (delta: -761.8MB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 3.9GB. Free memory is still 879.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.8s, 197 PlacesBefore, 79 PlacesAfterwards, 186 TransitionsBefore, 67 TransitionsAfterwards, 6364 CoEnabledTransitionPairs, 7 FixpointIterations, 78 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 159 TotalNumberOfCompositions, 22359 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8688, independent: 8226, independent conditional: 0, independent unconditional: 8226, dependent: 462, dependent conditional: 0, dependent unconditional: 462, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2908, independent: 2823, independent conditional: 0, independent unconditional: 2823, dependent: 85, dependent conditional: 0, dependent unconditional: 85, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8688, independent: 5403, independent conditional: 0, independent unconditional: 5403, dependent: 377, dependent conditional: 0, dependent unconditional: 377, unknown: 2908, unknown conditional: 0, unknown unconditional: 2908] , Statistics on independence cache: Total cache size (in pairs): 430, Positive cache size: 386, Positive conditional cache size: 0, Positive unconditional cache size: 386, Negative cache size: 44, Negative conditional cache size: 0, Negative unconditional cache size: 44, 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p1_EAX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p3_EAX = 0; [L739] 0 int a = 0; [L740] 0 _Bool a$flush_delayed; [L741] 0 int a$mem_tmp; [L742] 0 _Bool a$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L744] 0 _Bool a$r_buff0_thd2; [L745] 0 _Bool a$r_buff0_thd3; [L746] 0 _Bool a$r_buff0_thd4; [L747] 0 _Bool a$r_buff1_thd0; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L752] 0 _Bool a$read_delayed; [L753] 0 int *a$read_delayed_var; [L754] 0 int a$w_buff0; [L755] 0 _Bool a$w_buff0_used; [L756] 0 int a$w_buff1; [L757] 0 _Bool a$w_buff1_used; [L758] 0 _Bool main$tmp_guard0; [L759] 0 _Bool main$tmp_guard1; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2721; [L861] FCALL, FORK 0 pthread_create(&t2721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2721, ((void *)0), P0, ((void *)0))=-1, t2721={9:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L862] 0 pthread_t t2722; [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] EXPR 1 \read(a) [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] 1 a = !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L777] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L778] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L779] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L780] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L782] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L783] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L784] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L785] EXPR 1 \read(a) [L785] 1 __unbuffered_p0_EAX = a [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] EXPR 1 \read(a) [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] 1 a = a$flush_delayed ? a$mem_tmp : a [L787] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L790] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L863] FCALL, FORK 0 pthread_create(&t2722, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2722, ((void *)0), P1, ((void *)0))=0, t2721={9:0}, t2722={6:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L802] 2 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=0, z=0] [L805] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L864] 0 pthread_t t2723; [L865] FCALL, FORK 0 pthread_create(&t2723, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2723, ((void *)0), P2, ((void *)0))=1, t2721={9:0}, t2722={6:0}, t2723={8:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L866] 0 pthread_t t2724; [L867] FCALL, FORK 0 pthread_create(&t2724, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2724, ((void *)0), P3, ((void *)0))=2, t2721={9:0}, t2722={6:0}, t2723={8:0}, t2724={5:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L817] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, 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=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=0] [L820] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, 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=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L832] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L795] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 1 return 0; [L835] 4 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 \read(a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L841] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L871] RET 0 assume_abort_if_not(main$tmp_guard0) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 \read(a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L876] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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, t2721={9:0}, t2722={6:0}, t2723={8:0}, t2724={5:0}, weak$$choice0=49, weak$$choice1=0, weak$$choice2=0, x=1, y=1, z=1] [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L884] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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=49, weak$$choice1=255, weak$$choice2=0, x=1, y=1, z=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: 858]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 867]: 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: 863]: 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: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 240 locations, 56 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: 118.6s, OverallIterations: 28, TraceHistogramMax: 1, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 104.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4137 SdHoareTripleChecker+Valid, 8.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3340 mSDsluCounter, 1171 SdHoareTripleChecker+Invalid, 7.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1075 mSDsCounter, 609 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 12186 IncrementalHoareTripleChecker+Invalid, 12795 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 609 mSolverCounterUnsat, 96 mSDtfsCounter, 12186 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3867occurred in iteration=17, InterpolantAutomatonStates: 151, 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.5s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 432 ConstructedInterpolants, 0 QuantifiedInterpolants, 5992 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 18:42:32,194 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/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_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/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_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/thin002_rmo.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/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_c17de227-3aab-4b6f-aef7-7471ce93ef07/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 f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 18:42:34,014 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 18:42:34,016 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 18:42:34,031 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 18:42:34,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 18:42:34,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 18:42:34,032 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 18:42:34,033 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 18:42:34,034 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 18:42:34,035 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 18:42:34,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 18:42:34,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 18:42:34,037 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 18:42:34,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 18:42:34,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 18:42:34,039 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 18:42:34,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 18:42:34,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 18:42:34,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 18:42:34,042 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 18:42:34,043 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 18:42:34,044 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 18:42:34,045 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 18:42:34,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 18:42:34,049 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 18:42:34,050 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 18:42:34,050 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 18:42:34,051 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 18:42:34,051 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 18:42:34,052 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 18:42:34,053 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 18:42:34,053 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 18:42:34,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 18:42:34,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 18:42:34,061 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 18:42:34,061 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 18:42:34,062 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 18:42:34,062 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 18:42:34,063 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 18:42:34,063 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 18:42:34,064 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 18:42:34,064 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 18:42:34,080 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 18:42:34,080 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 18:42:34,081 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 18:42:34,081 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 18:42:34,081 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 18:42:34,081 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 18:42:34,082 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 18:42:34,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 18:42:34,082 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 18:42:34,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 18:42:34,083 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 18:42:34,083 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 18:42:34,083 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 18:42:34,083 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 18:42:34,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 18:42:34,083 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 18:42:34,084 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 18:42:34,084 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 18:42:34,084 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 18:42:34,084 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 18:42:34,084 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 18:42:34,084 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 18:42:34,085 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 18:42:34,085 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 18:42:34,085 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 18:42:34,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 18:42:34,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 18:42:34,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:42:34,086 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 18:42:34,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 18:42:34,086 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 18:42:34,086 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 18:42:34,086 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 18:42:34,087 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 18:42:34,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 18:42:34,087 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 18:42:34,087 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 18:42:34,087 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_c17de227-3aab-4b6f-aef7-7471ce93ef07/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_c17de227-3aab-4b6f-aef7-7471ce93ef07/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 -> f0d8ae33a1a7c98578096fc4895533f629cc4062ad641b886abfeea14ddb85d4 [2022-12-13 18:42:34,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 18:42:34,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 18:42:34,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 18:42:34,307 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 18:42:34,307 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 18:42:34,308 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2022-12-13 18:42:36,836 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 18:42:36,996 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 18:42:36,997 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/sv-benchmarks/c/pthread-wmm/thin002_rmo.i [2022-12-13 18:42:37,008 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/data/6d2f0d424/7bf1592021f6466b92026a0daff00d5d/FLAG1c311dd29 [2022-12-13 18:42:37,018 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/data/6d2f0d424/7bf1592021f6466b92026a0daff00d5d [2022-12-13 18:42:37,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 18:42:37,021 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 18:42:37,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 18:42:37,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 18:42:37,024 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 18:42:37,025 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:42:37" (1/1) ... [2022-12-13 18:42:37,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@937c6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:42:37, skipping insertion in model container [2022-12-13 18:42:37,025 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 06:42:37" (1/1) ... [2022-12-13 18:42:37,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 18:42:37,068 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 18:42:37,209 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_c17de227-3aab-4b6f-aef7-7471ce93ef07/sv-benchmarks/c/pthread-wmm/thin002_rmo.i[988,1001] [2022-12-13 18:42:37,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,331 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,333 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,334 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,335 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,336 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,337 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,339 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,343 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,344 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,346 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,349 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,351 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,352 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:42:37,363 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 18:42:37,371 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_c17de227-3aab-4b6f-aef7-7471ce93ef07/sv-benchmarks/c/pthread-wmm/thin002_rmo.i[988,1001] [2022-12-13 18:42:37,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,395 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,398 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,400 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,401 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,402 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 18:42:37,403 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 18:42:37,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 18:42:37,427 INFO L208 MainTranslator]: Completed translation [2022-12-13 18:42:37,427 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:42:37 WrapperNode [2022-12-13 18:42:37,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 18:42:37,428 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 18:42:37,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 18:42:37,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 18:42:37,434 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:42:37" (1/1) ... [2022-12-13 18:42:37,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:42:37" (1/1) ... [2022-12-13 18:42:37,461 INFO L138 Inliner]: procedures = 181, calls = 80, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 155 [2022-12-13 18:42:37,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 18:42:37,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 18:42:37,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 18:42:37,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 18:42:37,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:42:37" (1/1) ... [2022-12-13 18:42:37,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:42:37" (1/1) ... [2022-12-13 18:42:37,474 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:42:37" (1/1) ... [2022-12-13 18:42:37,475 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:42:37" (1/1) ... [2022-12-13 18:42:37,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:42:37" (1/1) ... [2022-12-13 18:42:37,490 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:42:37" (1/1) ... [2022-12-13 18:42:37,493 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:42:37" (1/1) ... [2022-12-13 18:42:37,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:42:37" (1/1) ... [2022-12-13 18:42:37,497 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 18:42:37,498 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 18:42:37,498 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 18:42:37,498 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 18:42:37,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:42:37" (1/1) ... [2022-12-13 18:42:37,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 18:42:37,515 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 18:42:37,525 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 18:42:37,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 18:42:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-12-13 18:42:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 18:42:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 18:42:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 18:42:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 18:42:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 18:42:37,556 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 18:42:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2022-12-13 18:42:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 18:42:37,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 18:42:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 18:42:37,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 18:42:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 18:42:37,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 18:42:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-12-13 18:42:37,557 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-12-13 18:42:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 18:42:37,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 18:42:37,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 18:42:37,558 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-12-13 18:42:37,704 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 18:42:37,706 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 18:42:38,146 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 18:42:38,420 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 18:42:38,420 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 18:42:38,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:42:38 BoogieIcfgContainer [2022-12-13 18:42:38,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 18:42:38,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 18:42:38,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 18:42:38,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 18:42:38,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 06:42:37" (1/3) ... [2022-12-13 18:42:38,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c2e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:42:38, skipping insertion in model container [2022-12-13 18:42:38,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 06:42:37" (2/3) ... [2022-12-13 18:42:38,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72c2e40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 06:42:38, skipping insertion in model container [2022-12-13 18:42:38,430 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:42:38" (3/3) ... [2022-12-13 18:42:38,431 INFO L112 eAbstractionObserver]: Analyzing ICFG thin002_rmo.i [2022-12-13 18:42:38,452 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 18:42:38,452 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 34 error locations. [2022-12-13 18:42:38,452 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 18:42:38,545 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 18:42:38,588 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 202 places, 191 transitions, 402 flow [2022-12-13 18:42:38,639 INFO L130 PetriNetUnfolder]: 2/187 cut-off events. [2022-12-13 18:42:38,639 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:42:38,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 2/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 205 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-12-13 18:42:38,644 INFO L82 GeneralOperation]: Start removeDead. Operand has 202 places, 191 transitions, 402 flow [2022-12-13 18:42:38,648 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 198 places, 187 transitions, 386 flow [2022-12-13 18:42:38,651 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 18:42:38,659 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 198 places, 187 transitions, 386 flow [2022-12-13 18:42:38,661 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 198 places, 187 transitions, 386 flow [2022-12-13 18:42:38,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 198 places, 187 transitions, 386 flow [2022-12-13 18:42:38,694 INFO L130 PetriNetUnfolder]: 2/187 cut-off events. [2022-12-13 18:42:38,694 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:42:38,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 187 events. 2/187 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 198 event pairs, 0 based on Foata normal form. 0/151 useless extension candidates. Maximal degree in co-relation 120. Up to 2 conditions per place. [2022-12-13 18:42:38,696 INFO L119 LiptonReduction]: Number of co-enabled transitions 6364 [2022-12-13 18:42:53,011 INFO L134 LiptonReduction]: Checked pairs total: 22802 [2022-12-13 18:42:53,012 INFO L136 LiptonReduction]: Total number of compositions: 158 [2022-12-13 18:42:53,022 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 18:42:53,026 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;@711f2f82, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 18:42:53,026 INFO L358 AbstractCegarLoop]: Starting to check reachability of 56 error locations. [2022-12-13 18:42:53,028 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-12-13 18:42:53,028 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:42:53,028 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:42:53,028 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 18:42:53,029 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:42:53,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:53,032 INFO L85 PathProgramCache]: Analyzing trace with hash 875, now seen corresponding path program 1 times [2022-12-13 18:42:53,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:42:53,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235384637] [2022-12-13 18:42:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:53,041 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:42:53,041 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:42:53,042 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:42:53,043 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-12-13 18:42:53,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:53,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 18:42:53,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:42:53,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:42:53,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:42:53,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:42:53,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235384637] [2022-12-13 18:42:53,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1235384637] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:53,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:42:53,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 18:42:53,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364617506] [2022-12-13 18:42:53,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:53,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 18:42:53,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:42:53,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 18:42:53,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 18:42:53,149 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 349 [2022-12-13 18:42:53,151 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 67 transitions, 146 flow. Second operand has 2 states, 2 states have (on average 158.5) internal successors, (317), 2 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:53,151 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:42:53,151 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 349 [2022-12-13 18:42:53,152 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:42:56,364 INFO L130 PetriNetUnfolder]: 20652/27845 cut-off events. [2022-12-13 18:42:56,364 INFO L131 PetriNetUnfolder]: For 60/60 co-relation queries the response was YES. [2022-12-13 18:42:56,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 55656 conditions, 27845 events. 20652/27845 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 1738. Compared 171983 event pairs, 20652 based on Foata normal form. 405/17861 useless extension candidates. Maximal degree in co-relation 55644. Up to 27674 conditions per place. [2022-12-13 18:42:56,529 INFO L137 encePairwiseOnDemand]: 330/349 looper letters, 41 selfloop transitions, 0 changer transitions 0/48 dead transitions. [2022-12-13 18:42:56,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 48 transitions, 190 flow [2022-12-13 18:42:56,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 18:42:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 18:42:56,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 376 transitions. [2022-12-13 18:42:56,540 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5386819484240688 [2022-12-13 18:42:56,540 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 376 transitions. [2022-12-13 18:42:56,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 376 transitions. [2022-12-13 18:42:56,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:42:56,544 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 376 transitions. [2022-12-13 18:42:56,546 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 188.0) internal successors, (376), 2 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:56,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 349.0) internal successors, (1047), 3 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:56,550 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 349.0) internal successors, (1047), 3 states have internal predecessors, (1047), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:56,552 INFO L175 Difference]: Start difference. First operand has 79 places, 67 transitions, 146 flow. Second operand 2 states and 376 transitions. [2022-12-13 18:42:56,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 48 transitions, 190 flow [2022-12-13 18:42:56,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 48 transitions, 186 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-12-13 18:42:56,558 INFO L231 Difference]: Finished difference. Result has 58 places, 48 transitions, 104 flow [2022-12-13 18:42:56,559 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=104, PETRI_PLACES=58, PETRI_TRANSITIONS=48} [2022-12-13 18:42:56,562 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -21 predicate places. [2022-12-13 18:42:56,562 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 48 transitions, 104 flow [2022-12-13 18:42:56,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 158.5) internal successors, (317), 2 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:56,563 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:42:56,563 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 18:42:56,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-12-13 18:42:56,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:42:56,764 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:42:56,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:56,765 INFO L85 PathProgramCache]: Analyzing trace with hash 861870, now seen corresponding path program 1 times [2022-12-13 18:42:56,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:42:56,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444848281] [2022-12-13 18:42:56,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:56,766 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:42:56,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:42:56,767 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:42:56,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-12-13 18:42:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:56,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 18:42:56,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:42:56,979 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2022-12-13 18:42:56,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2022-12-13 18:42:57,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:42:57,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:42:57,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:42:57,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [444848281] [2022-12-13 18:42:57,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [444848281] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:57,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:42:57,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:42:57,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948463903] [2022-12-13 18:42:57,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:57,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:42:57,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:42:57,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:42:57,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:42:57,084 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 349 [2022-12-13 18:42:57,085 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 48 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:57,085 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:42:57,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 349 [2022-12-13 18:42:57,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:42:59,036 INFO L130 PetriNetUnfolder]: 13979/18960 cut-off events. [2022-12-13 18:42:59,036 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 18:42:59,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37927 conditions, 18960 events. 13979/18960 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1082. Compared 111077 event pairs, 8279 based on Foata normal form. 360/13543 useless extension candidates. Maximal degree in co-relation 37924. Up to 9981 conditions per place. [2022-12-13 18:42:59,114 INFO L137 encePairwiseOnDemand]: 341/349 looper letters, 51 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2022-12-13 18:42:59,115 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 59 transitions, 232 flow [2022-12-13 18:42:59,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:42:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:42:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2022-12-13 18:42:59,117 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49474689589302767 [2022-12-13 18:42:59,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 518 transitions. [2022-12-13 18:42:59,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 518 transitions. [2022-12-13 18:42:59,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:42:59,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 518 transitions. [2022-12-13 18:42:59,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:59,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:59,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:59,121 INFO L175 Difference]: Start difference. First operand has 58 places, 48 transitions, 104 flow. Second operand 3 states and 518 transitions. [2022-12-13 18:42:59,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 59 transitions, 232 flow [2022-12-13 18:42:59,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 59 transitions, 232 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 18:42:59,122 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 114 flow [2022-12-13 18:42:59,122 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2022-12-13 18:42:59,123 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -20 predicate places. [2022-12-13 18:42:59,123 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 114 flow [2022-12-13 18:42:59,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:59,123 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:42:59,123 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2022-12-13 18:42:59,131 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-12-13 18:42:59,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:42:59,324 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:42:59,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:42:59,325 INFO L85 PathProgramCache]: Analyzing trace with hash 861871, now seen corresponding path program 1 times [2022-12-13 18:42:59,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:42:59,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059552752] [2022-12-13 18:42:59,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:42:59,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:42:59,325 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:42:59,326 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:42:59,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-12-13 18:42:59,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:42:59,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 18:42:59,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:42:59,411 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-13 18:42:59,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-12-13 18:42:59,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:42:59,433 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:42:59,433 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:42:59,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059552752] [2022-12-13 18:42:59,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059552752] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:42:59,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:42:59,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 18:42:59,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458670859] [2022-12-13 18:42:59,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:42:59,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:42:59,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:42:59,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:42:59,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:42:59,493 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 349 [2022-12-13 18:42:59,494 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:42:59,494 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:42:59,494 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 349 [2022-12-13 18:42:59,494 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:43:00,495 INFO L130 PetriNetUnfolder]: 5533/7708 cut-off events. [2022-12-13 18:43:00,495 INFO L131 PetriNetUnfolder]: For 414/522 co-relation queries the response was YES. [2022-12-13 18:43:00,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16316 conditions, 7708 events. 5533/7708 cut-off events. For 414/522 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 41647 event pairs, 5533 based on Foata normal form. 0/6795 useless extension candidates. Maximal degree in co-relation 16311. Up to 7595 conditions per place. [2022-12-13 18:43:00,528 INFO L137 encePairwiseOnDemand]: 342/349 looper letters, 31 selfloop transitions, 1 changer transitions 1/40 dead transitions. [2022-12-13 18:43:00,528 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 40 transitions, 168 flow [2022-12-13 18:43:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:43:00,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:43:00,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 510 transitions. [2022-12-13 18:43:00,531 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4871060171919771 [2022-12-13 18:43:00,531 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 510 transitions. [2022-12-13 18:43:00,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 510 transitions. [2022-12-13 18:43:00,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:43:00,532 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 510 transitions. [2022-12-13 18:43:00,533 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:00,537 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:00,537 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:00,538 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 114 flow. Second operand 3 states and 510 transitions. [2022-12-13 18:43:00,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 40 transitions, 168 flow [2022-12-13 18:43:00,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 40 transitions, 164 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:43:00,543 INFO L231 Difference]: Finished difference. Result has 53 places, 39 transitions, 98 flow [2022-12-13 18:43:00,543 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=39} [2022-12-13 18:43:00,544 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -26 predicate places. [2022-12-13 18:43:00,544 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 39 transitions, 98 flow [2022-12-13 18:43:00,544 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.0) internal successors, (474), 3 states have internal predecessors, (474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:00,544 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:43:00,545 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:43:00,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-12-13 18:43:00,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:00,746 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:43:00,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:43:00,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1777602491, now seen corresponding path program 1 times [2022-12-13 18:43:00,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:43:00,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603823374] [2022-12-13 18:43:00,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:43:00,752 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:00,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:43:00,755 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:43:00,759 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-12-13 18:43:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:43:00,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 18:43:00,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:43:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:43:00,910 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:43:00,910 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:43:00,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603823374] [2022-12-13 18:43:00,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1603823374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:43:00,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:43:00,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:43:00,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657539786] [2022-12-13 18:43:00,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:43:00,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 18:43:00,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:43:00,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 18:43:00,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 18:43:00,923 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 349 [2022-12-13 18:43:00,924 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 39 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:00,925 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:43:00,925 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 349 [2022-12-13 18:43:00,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:43:01,675 INFO L130 PetriNetUnfolder]: 3444/4992 cut-off events. [2022-12-13 18:43:01,676 INFO L131 PetriNetUnfolder]: For 242/314 co-relation queries the response was YES. [2022-12-13 18:43:01,682 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10559 conditions, 4992 events. 3444/4992 cut-off events. For 242/314 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 26968 event pairs, 1134 based on Foata normal form. 24/4456 useless extension candidates. Maximal degree in co-relation 10554. Up to 4815 conditions per place. [2022-12-13 18:43:01,695 INFO L137 encePairwiseOnDemand]: 343/349 looper letters, 43 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2022-12-13 18:43:01,695 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 55 transitions, 232 flow [2022-12-13 18:43:01,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 18:43:01,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 18:43:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 508 transitions. [2022-12-13 18:43:01,697 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48519579751671443 [2022-12-13 18:43:01,697 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 508 transitions. [2022-12-13 18:43:01,697 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 508 transitions. [2022-12-13 18:43:01,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:43:01,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 508 transitions. [2022-12-13 18:43:01,698 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 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 18:43:01,700 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:01,700 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 349.0) internal successors, (1396), 4 states have internal predecessors, (1396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:01,700 INFO L175 Difference]: Start difference. First operand has 53 places, 39 transitions, 98 flow. Second operand 3 states and 508 transitions. [2022-12-13 18:43:01,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 55 transitions, 232 flow [2022-12-13 18:43:01,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 55 transitions, 231 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:43:01,702 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 130 flow [2022-12-13 18:43:01,702 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2022-12-13 18:43:01,702 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -25 predicate places. [2022-12-13 18:43:01,702 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 130 flow [2022-12-13 18:43:01,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.0) internal successors, (471), 3 states have internal predecessors, (471), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:01,703 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:43:01,703 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:43:01,714 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-12-13 18:43:01,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:01,905 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:43:01,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:43:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1790917963, now seen corresponding path program 1 times [2022-12-13 18:43:01,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:43:01,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977666695] [2022-12-13 18:43:01,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:43:01,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:01,910 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:43:01,912 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:43:01,915 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-12-13 18:43:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:43:02,117 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:43:02,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:43:02,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:43:02,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:43:02,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:43:02,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977666695] [2022-12-13 18:43:02,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1977666695] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:43:02,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:43:02,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:43:02,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934787173] [2022-12-13 18:43:02,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:43:02,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:43:02,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:43:02,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:43:02,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:43:02,164 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 349 [2022-12-13 18:43:02,166 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 156.5) internal successors, (626), 4 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:02,166 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:43:02,166 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 349 [2022-12-13 18:43:02,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:43:02,627 INFO L130 PetriNetUnfolder]: 1292/2084 cut-off events. [2022-12-13 18:43:02,627 INFO L131 PetriNetUnfolder]: For 485/509 co-relation queries the response was YES. [2022-12-13 18:43:02,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5110 conditions, 2084 events. 1292/2084 cut-off events. For 485/509 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 10643 event pairs, 311 based on Foata normal form. 44/1892 useless extension candidates. Maximal degree in co-relation 5104. Up to 1713 conditions per place. [2022-12-13 18:43:02,633 INFO L137 encePairwiseOnDemand]: 343/349 looper letters, 52 selfloop transitions, 9 changer transitions 0/68 dead transitions. [2022-12-13 18:43:02,633 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 320 flow [2022-12-13 18:43:02,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:43:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:43:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 674 transitions. [2022-12-13 18:43:02,635 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4828080229226361 [2022-12-13 18:43:02,635 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 674 transitions. [2022-12-13 18:43:02,635 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 674 transitions. [2022-12-13 18:43:02,635 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:43:02,635 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 674 transitions. [2022-12-13 18:43:02,636 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 168.5) internal successors, (674), 4 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:02,638 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:02,638 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:02,638 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 130 flow. Second operand 4 states and 674 transitions. [2022-12-13 18:43:02,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 320 flow [2022-12-13 18:43:02,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 68 transitions, 315 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 18:43:02,640 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 177 flow [2022-12-13 18:43:02,640 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=125, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=177, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2022-12-13 18:43:02,640 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2022-12-13 18:43:02,640 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 177 flow [2022-12-13 18:43:02,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.5) internal successors, (626), 4 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:02,641 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:43:02,641 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:43:02,652 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/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 18:43:02,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:02,842 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:43:02,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:43:02,843 INFO L85 PathProgramCache]: Analyzing trace with hash 107445095, now seen corresponding path program 1 times [2022-12-13 18:43:02,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:43:02,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [323825589] [2022-12-13 18:43:02,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:43:02,845 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:02,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:43:02,848 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:43:02,851 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-12-13 18:43:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:43:02,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 18:43:02,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:43:02,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:43:02,999 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:43:02,999 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:43:02,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [323825589] [2022-12-13 18:43:03,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [323825589] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:43:03,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:43:03,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 18:43:03,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445514785] [2022-12-13 18:43:03,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:43:03,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:43:03,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:43:03,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:43:03,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:43:03,012 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 349 [2022-12-13 18:43:03,013 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 177 flow. Second operand has 5 states, 5 states have (on average 156.2) internal successors, (781), 5 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:03,013 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:43:03,013 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 349 [2022-12-13 18:43:03,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:43:03,342 INFO L130 PetriNetUnfolder]: 439/785 cut-off events. [2022-12-13 18:43:03,342 INFO L131 PetriNetUnfolder]: For 578/581 co-relation queries the response was YES. [2022-12-13 18:43:03,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2259 conditions, 785 events. 439/785 cut-off events. For 578/581 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3281 event pairs, 87 based on Foata normal form. 30/760 useless extension candidates. Maximal degree in co-relation 2252. Up to 281 conditions per place. [2022-12-13 18:43:03,345 INFO L137 encePairwiseOnDemand]: 343/349 looper letters, 59 selfloop transitions, 13 changer transitions 0/79 dead transitions. [2022-12-13 18:43:03,345 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 79 transitions, 413 flow [2022-12-13 18:43:03,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 18:43:03,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 18:43:03,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 838 transitions. [2022-12-13 18:43:03,347 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4802292263610315 [2022-12-13 18:43:03,347 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 838 transitions. [2022-12-13 18:43:03,347 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 838 transitions. [2022-12-13 18:43:03,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:43:03,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 838 transitions. [2022-12-13 18:43:03,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.6) internal successors, (838), 5 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:03,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:03,351 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 349.0) internal successors, (2094), 6 states have internal predecessors, (2094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:03,351 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 177 flow. Second operand 5 states and 838 transitions. [2022-12-13 18:43:03,351 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 79 transitions, 413 flow [2022-12-13 18:43:03,353 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 79 transitions, 395 flow, removed 4 selfloop flow, removed 2 redundant places. [2022-12-13 18:43:03,354 INFO L231 Difference]: Finished difference. Result has 60 places, 51 transitions, 227 flow [2022-12-13 18:43:03,354 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=227, PETRI_PLACES=60, PETRI_TRANSITIONS=51} [2022-12-13 18:43:03,355 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -19 predicate places. [2022-12-13 18:43:03,355 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 51 transitions, 227 flow [2022-12-13 18:43:03,355 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 156.2) internal successors, (781), 5 states have internal predecessors, (781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:03,355 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:43:03,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, 1, 1] [2022-12-13 18:43:03,367 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-12-13 18:43:03,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:03,557 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:43:03,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:43:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash -559111559, now seen corresponding path program 1 times [2022-12-13 18:43:03,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:43:03,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1950883059] [2022-12-13 18:43:03,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:43:03,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:03,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:43:03,563 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:43:03,566 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-12-13 18:43:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:43:03,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-13 18:43:03,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:43:03,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:43:03,731 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:43:03,731 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:43:03,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1950883059] [2022-12-13 18:43:03,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1950883059] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:43:03,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:43:03,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 18:43:03,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103599312] [2022-12-13 18:43:03,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:43:03,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 18:43:03,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:43:03,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 18:43:03,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 18:43:03,745 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 349 [2022-12-13 18:43:03,746 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 51 transitions, 227 flow. Second operand has 6 states, 6 states have (on average 156.0) internal successors, (936), 6 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:03,746 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:43:03,746 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 349 [2022-12-13 18:43:03,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:43:04,124 INFO L130 PetriNetUnfolder]: 328/559 cut-off events. [2022-12-13 18:43:04,124 INFO L131 PetriNetUnfolder]: For 571/571 co-relation queries the response was YES. [2022-12-13 18:43:04,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1740 conditions, 559 events. 328/559 cut-off events. For 571/571 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2153 event pairs, 64 based on Foata normal form. 9/557 useless extension candidates. Maximal degree in co-relation 1732. Up to 214 conditions per place. [2022-12-13 18:43:04,127 INFO L137 encePairwiseOnDemand]: 343/349 looper letters, 51 selfloop transitions, 17 changer transitions 1/75 dead transitions. [2022-12-13 18:43:04,127 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 75 transitions, 417 flow [2022-12-13 18:43:04,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 18:43:04,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 18:43:04,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 988 transitions. [2022-12-13 18:43:04,129 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47182425978987586 [2022-12-13 18:43:04,129 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 988 transitions. [2022-12-13 18:43:04,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 988 transitions. [2022-12-13 18:43:04,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:43:04,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 988 transitions. [2022-12-13 18:43:04,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 164.66666666666666) internal successors, (988), 6 states have internal predecessors, (988), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:04,132 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 349.0) internal successors, (2443), 7 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:04,133 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 349.0) internal successors, (2443), 7 states have internal predecessors, (2443), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:04,133 INFO L175 Difference]: Start difference. First operand has 60 places, 51 transitions, 227 flow. Second operand 6 states and 988 transitions. [2022-12-13 18:43:04,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 75 transitions, 417 flow [2022-12-13 18:43:04,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 75 transitions, 381 flow, removed 8 selfloop flow, removed 4 redundant places. [2022-12-13 18:43:04,136 INFO L231 Difference]: Finished difference. Result has 58 places, 46 transitions, 217 flow [2022-12-13 18:43:04,136 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=217, PETRI_PLACES=58, PETRI_TRANSITIONS=46} [2022-12-13 18:43:04,137 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -21 predicate places. [2022-12-13 18:43:04,137 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 46 transitions, 217 flow [2022-12-13 18:43:04,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 156.0) internal successors, (936), 6 states have internal predecessors, (936), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:04,137 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:43:04,137 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:43:04,149 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/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 18:43:04,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:04,339 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:43:04,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:43:04,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1976864710, now seen corresponding path program 1 times [2022-12-13 18:43:04,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:43:04,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847251207] [2022-12-13 18:43:04,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:43:04,343 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:04,344 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:43:04,347 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:43:04,349 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-12-13 18:43:04,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:43:04,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 4 conjunts are in the unsatisfiable core [2022-12-13 18:43:04,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:43:05,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 18:43:05,011 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 18:43:05,021 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 72 treesize of output 68 [2022-12-13 18:43:05,033 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 18:43:05,036 WARN L207 Elim1Store]: Array PQE input equivalent to false [2022-12-13 18:43:05,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:43:05,163 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:43:05,163 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:43:05,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847251207] [2022-12-13 18:43:05,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847251207] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:43:05,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:43:05,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:43:05,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021252340] [2022-12-13 18:43:05,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:43:05,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 18:43:05,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:43:05,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 18:43:05,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 18:43:05,287 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 349 [2022-12-13 18:43:05,288 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 46 transitions, 217 flow. Second operand has 5 states, 5 states have (on average 159.4) internal successors, (797), 5 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:05,288 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:43:05,288 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 349 [2022-12-13 18:43:05,288 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:43:05,504 INFO L130 PetriNetUnfolder]: 382/685 cut-off events. [2022-12-13 18:43:05,505 INFO L131 PetriNetUnfolder]: For 997/997 co-relation queries the response was YES. [2022-12-13 18:43:05,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2053 conditions, 685 events. 382/685 cut-off events. For 997/997 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3262 event pairs, 68 based on Foata normal form. 0/679 useless extension candidates. Maximal degree in co-relation 2045. Up to 455 conditions per place. [2022-12-13 18:43:05,509 INFO L137 encePairwiseOnDemand]: 346/349 looper letters, 59 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2022-12-13 18:43:05,509 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 436 flow [2022-12-13 18:43:05,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:43:05,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:43:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 664 transitions. [2022-12-13 18:43:05,511 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47564469914040114 [2022-12-13 18:43:05,511 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 664 transitions. [2022-12-13 18:43:05,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 664 transitions. [2022-12-13 18:43:05,512 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:43:05,512 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 664 transitions. [2022-12-13 18:43:05,513 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.0) internal successors, (664), 4 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:05,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:05,515 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:05,516 INFO L175 Difference]: Start difference. First operand has 58 places, 46 transitions, 217 flow. Second operand 4 states and 664 transitions. [2022-12-13 18:43:05,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 436 flow [2022-12-13 18:43:05,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 66 transitions, 371 flow, removed 12 selfloop flow, removed 4 redundant places. [2022-12-13 18:43:05,520 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 169 flow [2022-12-13 18:43:05,520 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=165, PETRI_DIFFERENCE_MINUEND_PLACES=52, 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=4, PETRI_FLOW=169, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2022-12-13 18:43:05,521 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -24 predicate places. [2022-12-13 18:43:05,521 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 169 flow [2022-12-13 18:43:05,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 159.4) internal successors, (797), 5 states have internal predecessors, (797), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:05,521 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:43:05,521 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:43:05,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-12-13 18:43:05,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:05,723 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:43:05,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:43:05,724 INFO L85 PathProgramCache]: Analyzing trace with hash -816231852, now seen corresponding path program 1 times [2022-12-13 18:43:05,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:43:05,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366360447] [2022-12-13 18:43:05,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:43:05,726 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:05,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:43:05,729 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:43:05,732 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-12-13 18:43:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:43:05,978 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:43:05,979 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:43:06,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 18:43:06,012 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:43:06,013 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:43:06,013 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366360447] [2022-12-13 18:43:06,013 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366360447] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:43:06,013 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:43:06,013 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:43:06,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934699440] [2022-12-13 18:43:06,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:43:06,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:43:06,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:43:06,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:43:06,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:43:06,018 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 349 [2022-12-13 18:43:06,018 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 169 flow. Second operand has 4 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:06,018 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:43:06,018 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 349 [2022-12-13 18:43:06,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:43:06,211 INFO L130 PetriNetUnfolder]: 574/1014 cut-off events. [2022-12-13 18:43:06,211 INFO L131 PetriNetUnfolder]: For 800/800 co-relation queries the response was YES. [2022-12-13 18:43:06,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2884 conditions, 1014 events. 574/1014 cut-off events. For 800/800 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 5203 event pairs, 176 based on Foata normal form. 0/1003 useless extension candidates. Maximal degree in co-relation 2876. Up to 354 conditions per place. [2022-12-13 18:43:06,215 INFO L137 encePairwiseOnDemand]: 345/349 looper letters, 88 selfloop transitions, 3 changer transitions 0/96 dead transitions. [2022-12-13 18:43:06,215 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 96 transitions, 563 flow [2022-12-13 18:43:06,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:43:06,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:43:06,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 678 transitions. [2022-12-13 18:43:06,216 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48567335243553006 [2022-12-13 18:43:06,216 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 678 transitions. [2022-12-13 18:43:06,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 678 transitions. [2022-12-13 18:43:06,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:43:06,217 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 678 transitions. [2022-12-13 18:43:06,217 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 169.5) internal successors, (678), 4 states have internal predecessors, (678), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:06,218 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:06,219 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:06,219 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 169 flow. Second operand 4 states and 678 transitions. [2022-12-13 18:43:06,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 96 transitions, 563 flow [2022-12-13 18:43:06,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 96 transitions, 560 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:43:06,223 INFO L231 Difference]: Finished difference. Result has 57 places, 46 transitions, 180 flow [2022-12-13 18:43:06,223 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=166, 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=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=57, PETRI_TRANSITIONS=46} [2022-12-13 18:43:06,224 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2022-12-13 18:43:06,224 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 46 transitions, 180 flow [2022-12-13 18:43:06,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:06,224 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:43:06,224 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:43:06,233 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/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)] Ended with exit code 0 [2022-12-13 18:43:06,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:06,426 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:43:06,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:43:06,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1051937033, now seen corresponding path program 1 times [2022-12-13 18:43:06,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:43:06,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4221892] [2022-12-13 18:43:06,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 18:43:06,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:06,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:43:06,432 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:43:06,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-12-13 18:43:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 18:43:06,573 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 3 conjunts are in the unsatisfiable core [2022-12-13 18:43:06,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:43:06,913 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 72 treesize of output 68 [2022-12-13 18:43:06,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 18:43:06,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-12-13 18:43:06,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:43:06,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:43:06,966 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:43:06,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4221892] [2022-12-13 18:43:06,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4221892] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:43:06,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:43:06,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 18:43:06,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333829164] [2022-12-13 18:43:06,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:43:06,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:43:06,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:43:06,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:43:06,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:43:07,055 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 151 out of 349 [2022-12-13 18:43:07,055 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 46 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 156.5) internal successors, (626), 4 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:07,056 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:43:07,056 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 151 of 349 [2022-12-13 18:43:07,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:43:07,286 INFO L130 PetriNetUnfolder]: 541/978 cut-off events. [2022-12-13 18:43:07,286 INFO L131 PetriNetUnfolder]: For 967/967 co-relation queries the response was YES. [2022-12-13 18:43:07,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2965 conditions, 978 events. 541/978 cut-off events. For 967/967 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 5065 event pairs, 92 based on Foata normal form. 0/974 useless extension candidates. Maximal degree in co-relation 2956. Up to 704 conditions per place. [2022-12-13 18:43:07,290 INFO L137 encePairwiseOnDemand]: 346/349 looper letters, 59 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2022-12-13 18:43:07,290 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 386 flow [2022-12-13 18:43:07,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:43:07,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:43:07,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 647 transitions. [2022-12-13 18:43:07,292 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46346704871060174 [2022-12-13 18:43:07,292 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 647 transitions. [2022-12-13 18:43:07,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 647 transitions. [2022-12-13 18:43:07,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:43:07,292 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 647 transitions. [2022-12-13 18:43:07,293 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 161.75) internal successors, (647), 4 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:07,295 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:07,296 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:07,296 INFO L175 Difference]: Start difference. First operand has 57 places, 46 transitions, 180 flow. Second operand 4 states and 647 transitions. [2022-12-13 18:43:07,296 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 386 flow [2022-12-13 18:43:07,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 66 transitions, 382 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:43:07,302 INFO L231 Difference]: Finished difference. Result has 57 places, 45 transitions, 178 flow [2022-12-13 18:43:07,303 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=54, 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=4, PETRI_FLOW=178, PETRI_PLACES=57, PETRI_TRANSITIONS=45} [2022-12-13 18:43:07,303 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -22 predicate places. [2022-12-13 18:43:07,303 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 45 transitions, 178 flow [2022-12-13 18:43:07,304 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 156.5) internal successors, (626), 4 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:07,304 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:43:07,304 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:43:07,312 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/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 18:43:07,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:07,506 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:43:07,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:43:07,507 INFO L85 PathProgramCache]: Analyzing trace with hash 880640646, now seen corresponding path program 2 times [2022-12-13 18:43:07,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:43:07,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679749075] [2022-12-13 18:43:07,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 18:43:07,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:07,509 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:43:07,511 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:43:07,514 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-12-13 18:43:07,682 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 18:43:07,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:43:07,688 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:43:07,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:43:07,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:43:07,726 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:43:07,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:43:07,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679749075] [2022-12-13 18:43:07,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [679749075] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:43:07,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:43:07,727 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:43:07,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067140449] [2022-12-13 18:43:07,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:43:07,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:43:07,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:43:07,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:43:07,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:43:07,733 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 349 [2022-12-13 18:43:07,734 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 45 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:07,734 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:43:07,734 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 349 [2022-12-13 18:43:07,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:43:08,027 INFO L130 PetriNetUnfolder]: 841/1483 cut-off events. [2022-12-13 18:43:08,027 INFO L131 PetriNetUnfolder]: For 1377/1377 co-relation queries the response was YES. [2022-12-13 18:43:08,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4535 conditions, 1483 events. 841/1483 cut-off events. For 1377/1377 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 8258 event pairs, 227 based on Foata normal form. 1/1472 useless extension candidates. Maximal degree in co-relation 4526. Up to 564 conditions per place. [2022-12-13 18:43:08,036 INFO L137 encePairwiseOnDemand]: 345/349 looper letters, 82 selfloop transitions, 3 changer transitions 0/90 dead transitions. [2022-12-13 18:43:08,036 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 90 transitions, 552 flow [2022-12-13 18:43:08,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:43:08,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:43:08,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 671 transitions. [2022-12-13 18:43:08,037 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4806590257879656 [2022-12-13 18:43:08,037 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 671 transitions. [2022-12-13 18:43:08,037 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 671 transitions. [2022-12-13 18:43:08,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:43:08,037 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 671 transitions. [2022-12-13 18:43:08,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 167.75) internal successors, (671), 4 states have internal predecessors, (671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:08,039 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:08,040 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:08,040 INFO L175 Difference]: Start difference. First operand has 57 places, 45 transitions, 178 flow. Second operand 4 states and 671 transitions. [2022-12-13 18:43:08,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 90 transitions, 552 flow [2022-12-13 18:43:08,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 90 transitions, 544 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:43:08,047 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 189 flow [2022-12-13 18:43:08,047 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=189, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2022-12-13 18:43:08,047 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -20 predicate places. [2022-12-13 18:43:08,047 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 189 flow [2022-12-13 18:43:08,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:08,048 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:43:08,048 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:43:08,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/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)] Forceful destruction successful, exit code 0 [2022-12-13 18:43:08,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:08,249 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:43:08,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:43:08,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1288689034, now seen corresponding path program 3 times [2022-12-13 18:43:08,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:43:08,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087342800] [2022-12-13 18:43:08,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 18:43:08,251 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:08,251 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:43:08,253 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:43:08,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-12-13 18:43:08,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 18:43:08,379 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 18:43:08,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 18:43:08,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 18:43:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 18:43:08,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 18:43:08,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 18:43:08,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087342800] [2022-12-13 18:43:08,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087342800] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 18:43:08,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 18:43:08,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 18:43:08,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837796638] [2022-12-13 18:43:08,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 18:43:08,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 18:43:08,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 18:43:08,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 18:43:08,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 18:43:08,417 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 349 [2022-12-13 18:43:08,418 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 189 flow. Second operand has 4 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:08,418 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 18:43:08,418 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 349 [2022-12-13 18:43:08,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 18:43:08,705 INFO L130 PetriNetUnfolder]: 1140/1996 cut-off events. [2022-12-13 18:43:08,705 INFO L131 PetriNetUnfolder]: For 1972/1972 co-relation queries the response was YES. [2022-12-13 18:43:08,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6303 conditions, 1996 events. 1140/1996 cut-off events. For 1972/1972 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 11536 event pairs, 320 based on Foata normal form. 1/1985 useless extension candidates. Maximal degree in co-relation 6293. Up to 824 conditions per place. [2022-12-13 18:43:08,713 INFO L137 encePairwiseOnDemand]: 345/349 looper letters, 81 selfloop transitions, 3 changer transitions 0/89 dead transitions. [2022-12-13 18:43:08,714 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 89 transitions, 556 flow [2022-12-13 18:43:08,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 18:43:08,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 18:43:08,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 667 transitions. [2022-12-13 18:43:08,715 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4777936962750716 [2022-12-13 18:43:08,715 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 667 transitions. [2022-12-13 18:43:08,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 667 transitions. [2022-12-13 18:43:08,715 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 18:43:08,715 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 667 transitions. [2022-12-13 18:43:08,716 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:08,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:08,717 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 349.0) internal successors, (1745), 5 states have internal predecessors, (1745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:08,717 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 189 flow. Second operand 4 states and 667 transitions. [2022-12-13 18:43:08,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 89 transitions, 556 flow [2022-12-13 18:43:08,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 89 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 18:43:08,730 INFO L231 Difference]: Finished difference. Result has 61 places, 47 transitions, 199 flow [2022-12-13 18:43:08,731 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=349, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=61, PETRI_TRANSITIONS=47} [2022-12-13 18:43:08,731 INFO L288 CegarLoopForPetriNet]: 79 programPoint places, -18 predicate places. [2022-12-13 18:43:08,731 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 47 transitions, 199 flow [2022-12-13 18:43:08,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 159.5) internal successors, (638), 4 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 18:43:08,731 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 18:43:08,731 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:43:08,740 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-12-13 18:43:08,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:08,932 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 53 more)] === [2022-12-13 18:43:08,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 18:43:08,934 INFO L85 PathProgramCache]: Analyzing trace with hash -611906614, now seen corresponding path program 4 times [2022-12-13 18:43:08,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 18:43:08,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352444978] [2022-12-13 18:43:08,936 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 18:43:08,936 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:08,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 18:43:08,940 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-12-13 18:43:08,943 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-12-13 18:43:09,155 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 18:43:09,155 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 18:43:09,155 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 18:43:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 18:43:09,326 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 18:43:09,326 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 18:43:09,326 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK (55 of 56 remaining) [2022-12-13 18:43:09,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 56 remaining) [2022-12-13 18:43:09,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 56 remaining) [2022-12-13 18:43:09,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 56 remaining) [2022-12-13 18:43:09,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 56 remaining) [2022-12-13 18:43:09,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 56 remaining) [2022-12-13 18:43:09,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 56 remaining) [2022-12-13 18:43:09,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 56 remaining) [2022-12-13 18:43:09,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 56 remaining) [2022-12-13 18:43:09,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 56 remaining) [2022-12-13 18:43:09,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 56 remaining) [2022-12-13 18:43:09,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 56 remaining) [2022-12-13 18:43:09,328 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 56 remaining) [2022-12-13 18:43:09,329 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 56 remaining) [2022-12-13 18:43:09,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 56 remaining) [2022-12-13 18:43:09,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 56 remaining) [2022-12-13 18:43:09,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 56 remaining) [2022-12-13 18:43:09,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 56 remaining) [2022-12-13 18:43:09,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_LEAK (22 of 56 remaining) [2022-12-13 18:43:09,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 56 remaining) [2022-12-13 18:43:09,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 56 remaining) [2022-12-13 18:43:09,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 56 remaining) [2022-12-13 18:43:09,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 56 remaining) [2022-12-13 18:43:09,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 56 remaining) [2022-12-13 18:43:09,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 56 remaining) [2022-12-13 18:43:09,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 56 remaining) [2022-12-13 18:43:09,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 56 remaining) [2022-12-13 18:43:09,330 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 56 remaining) [2022-12-13 18:43:09,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 56 remaining) [2022-12-13 18:43:09,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 56 remaining) [2022-12-13 18:43:09,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 56 remaining) [2022-12-13 18:43:09,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 56 remaining) [2022-12-13 18:43:09,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 56 remaining) [2022-12-13 18:43:09,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 56 remaining) [2022-12-13 18:43:09,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 56 remaining) [2022-12-13 18:43:09,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 56 remaining) [2022-12-13 18:43:09,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 56 remaining) [2022-12-13 18:43:09,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 56 remaining) [2022-12-13 18:43:09,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 56 remaining) [2022-12-13 18:43:09,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 56 remaining) [2022-12-13 18:43:09,331 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 56 remaining) [2022-12-13 18:43:09,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-12-13 18:43:09,532 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 18:43:09,533 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 18:43:09,549 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 18:43:09,549 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 18:43:09,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 06:43:09 BasicIcfg [2022-12-13 18:43:09,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 18:43:09,626 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 18:43:09,626 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 18:43:09,626 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 18:43:09,627 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 06:42:38" (3/4) ... [2022-12-13 18:43:09,629 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 18:43:09,629 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 18:43:09,629 INFO L158 Benchmark]: Toolchain (without parser) took 32608.19ms. Allocated memory was 62.9MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 43.5MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 674.7MB. Max. memory is 16.1GB. [2022-12-13 18:43:09,629 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 48.2MB. Free memory was 26.7MB in the beginning and 26.6MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:43:09,629 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.72ms. Allocated memory is still 62.9MB. Free memory was 43.4MB in the beginning and 30.8MB in the end (delta: 12.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-13 18:43:09,630 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.80ms. Allocated memory is still 62.9MB. Free memory was 30.5MB in the beginning and 28.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 18:43:09,630 INFO L158 Benchmark]: Boogie Preprocessor took 35.44ms. Allocated memory is still 62.9MB. Free memory was 28.0MB in the beginning and 41.9MB in the end (delta: -13.9MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. [2022-12-13 18:43:09,630 INFO L158 Benchmark]: RCFGBuilder took 925.10ms. Allocated memory is still 62.9MB. Free memory was 41.6MB in the beginning and 23.2MB in the end (delta: 18.4MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2022-12-13 18:43:09,630 INFO L158 Benchmark]: TraceAbstraction took 31200.60ms. Allocated memory was 62.9MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 22.5MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 654.0MB. Max. memory is 16.1GB. [2022-12-13 18:43:09,630 INFO L158 Benchmark]: Witness Printer took 2.56ms. Allocated memory is still 2.1GB. Free memory is still 1.4GB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 18:43:09,631 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 48.2MB. Free memory was 26.7MB in the beginning and 26.6MB in the end (delta: 54.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.72ms. Allocated memory is still 62.9MB. Free memory was 43.4MB in the beginning and 30.8MB in the end (delta: 12.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.80ms. Allocated memory is still 62.9MB. Free memory was 30.5MB in the beginning and 28.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.44ms. Allocated memory is still 62.9MB. Free memory was 28.0MB in the beginning and 41.9MB in the end (delta: -13.9MB). Peak memory consumption was 2.8MB. Max. memory is 16.1GB. * RCFGBuilder took 925.10ms. Allocated memory is still 62.9MB. Free memory was 41.6MB in the beginning and 23.2MB in the end (delta: 18.4MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * TraceAbstraction took 31200.60ms. Allocated memory was 62.9MB in the beginning and 2.1GB in the end (delta: 2.0GB). Free memory was 22.5MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 654.0MB. Max. memory is 16.1GB. * Witness Printer took 2.56ms. Allocated memory is still 2.1GB. Free memory is still 1.4GB. 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: 14.4s, 198 PlacesBefore, 79 PlacesAfterwards, 187 TransitionsBefore, 67 TransitionsAfterwards, 6364 CoEnabledTransitionPairs, 7 FixpointIterations, 77 TrivialSequentialCompositions, 76 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 1 ChoiceCompositions, 158 TotalNumberOfCompositions, 22802 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 8776, independent: 8308, independent conditional: 0, independent unconditional: 8308, dependent: 468, dependent conditional: 0, dependent unconditional: 468, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2932, independent: 2853, independent conditional: 0, independent unconditional: 2853, dependent: 79, dependent conditional: 0, dependent unconditional: 79, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 8776, independent: 5455, independent conditional: 0, independent unconditional: 5455, dependent: 389, dependent conditional: 0, dependent unconditional: 389, unknown: 2932, unknown conditional: 0, unknown unconditional: 2932] , Statistics on independence cache: Total cache size (in pairs): 442, Positive cache size: 400, Positive conditional cache size: 0, Positive unconditional cache size: 400, Negative cache size: 42, Negative conditional cache size: 0, Negative unconditional cache size: 42, 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: [L711] 0 int __unbuffered_cnt = 0; [L713] 0 int __unbuffered_p0_EAX = 0; [L714] 0 _Bool __unbuffered_p0_EAX$flush_delayed; [L715] 0 int __unbuffered_p0_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p0_EAX$r_buff0_thd4; [L721] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p0_EAX$r_buff1_thd4; [L726] 0 _Bool __unbuffered_p0_EAX$read_delayed; [L727] 0 int *__unbuffered_p0_EAX$read_delayed_var; [L728] 0 int __unbuffered_p0_EAX$w_buff0; [L729] 0 _Bool __unbuffered_p0_EAX$w_buff0_used; [L730] 0 int __unbuffered_p0_EAX$w_buff1; [L731] 0 _Bool __unbuffered_p0_EAX$w_buff1_used; [L733] 0 int __unbuffered_p1_EAX = 0; [L735] 0 int __unbuffered_p2_EAX = 0; [L737] 0 int __unbuffered_p3_EAX = 0; [L739] 0 int a = 0; [L740] 0 _Bool a$flush_delayed; [L741] 0 int a$mem_tmp; [L742] 0 _Bool a$r_buff0_thd0; [L743] 0 _Bool a$r_buff0_thd1; [L744] 0 _Bool a$r_buff0_thd2; [L745] 0 _Bool a$r_buff0_thd3; [L746] 0 _Bool a$r_buff0_thd4; [L747] 0 _Bool a$r_buff1_thd0; [L748] 0 _Bool a$r_buff1_thd1; [L749] 0 _Bool a$r_buff1_thd2; [L750] 0 _Bool a$r_buff1_thd3; [L751] 0 _Bool a$r_buff1_thd4; [L752] 0 _Bool a$read_delayed; [L753] 0 int *a$read_delayed_var; [L754] 0 int a$w_buff0; [L755] 0 _Bool a$w_buff0_used; [L756] 0 int a$w_buff1; [L757] 0 _Bool a$w_buff1_used; [L758] 0 _Bool main$tmp_guard0; [L759] 0 _Bool main$tmp_guard1; [L761] 0 int x = 0; [L763] 0 int y = 0; [L765] 0 int z = 0; [L766] 0 _Bool weak$$choice0; [L767] 0 _Bool weak$$choice1; [L768] 0 _Bool weak$$choice2; [L860] 0 pthread_t t2721; [L861] FCALL, FORK 0 pthread_create(&t2721, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=0, __unbuffered_p0_EAX$read_delayed_var={0:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2721, ((void *)0), P0, ((void *)0))=0, t2721={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y=0, z=0] [L862] 0 pthread_t t2722; [L772] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L773] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L774] 1 a$flush_delayed = weak$$choice2 [L775] EXPR 1 \read(a) [L775] 1 a$mem_tmp = a [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] EXPR 1 \read(a) [L776] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L776] 1 a = !a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff1) [L777] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : a$w_buff0)) [L778] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff1 : a$w_buff1)) [L779] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used)) [L780] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L781] 1 a$r_buff0_thd1 = weak$$choice2 ? a$r_buff0_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff0_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1)) [L782] 1 a$r_buff1_thd1 = weak$$choice2 ? a$r_buff1_thd1 : (!a$w_buff0_used || !a$r_buff0_thd1 && !a$w_buff1_used || !a$r_buff0_thd1 && !a$r_buff1_thd1 ? a$r_buff1_thd1 : (a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L783] 1 __unbuffered_p0_EAX$read_delayed = (_Bool)1 [L784] 1 __unbuffered_p0_EAX$read_delayed_var = &a [L785] EXPR 1 \read(a) [L785] 1 __unbuffered_p0_EAX = a [L786] EXPR 1 a$flush_delayed ? a$mem_tmp : a [L786] 1 a = a$flush_delayed ? a$mem_tmp : a [L787] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=0, y=0, z=0] [L790] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=1, y=0, z=0] [L795] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L797] 1 return 0; [L863] FCALL, FORK 0 pthread_create(&t2722, ((void *)0), P1, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2722, ((void *)0), P1, ((void *)0))=1, t2721={7:0}, t2722={11:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=1, y=0, z=0] [L864] 0 pthread_t t2723; [L865] FCALL, FORK 0 pthread_create(&t2723, ((void *)0), P2, ((void *)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2723, ((void *)0), P2, ((void *)0))=2, t2721={7:0}, t2722={11:0}, t2723={14:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=1, y=0, z=0] [L802] 2 __unbuffered_p1_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, 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=2, x=1, y=0, z=0] [L805] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, 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=2, x=1, y=1, z=0] [L810] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 2 return 0; [L866] 0 pthread_t t2724; [L867] FCALL, FORK 0 pthread_create(&t2724, ((void *)0), P3, ((void *)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2724, ((void *)0), P3, ((void *)0))=3, t2721={7:0}, t2722={11:0}, t2723={14:0}, t2724={15:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=1, y=1, z=0] [L817] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, 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=2, x=1, y=1, z=0] [L820] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=0, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, 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=2, x=1, y=1, z=1] [L825] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L827] 3 return 0; [L832] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=1, y=1, z=1] [L835] 4 a = 1 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=1, y=1, z=1] [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 \read(a) [L838] EXPR 4 a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a [L838] EXPR 4 a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L839] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L840] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L841] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L842] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=1, y=1, z=1] [L845] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L847] 4 return 0; [L869] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L871] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L871] RET 0 assume_abort_if_not(main$tmp_guard0) [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 \read(a) [L873] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L873] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L874] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L875] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L876] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L877] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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, t2721={7:0}, t2722={11:0}, t2723={14:0}, t2724={15:0}, weak$$choice0=3, weak$$choice1=0, weak$$choice2=2, x=1, y=1, z=1] [L880] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 \read(*__unbuffered_p0_EAX$read_delayed_var) [L881] EXPR 0 weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX [L881] EXPR 0 __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L881] 0 __unbuffered_p0_EAX = __unbuffered_p0_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p0_EAX$read_delayed_var : __unbuffered_p0_EAX) : __unbuffered_p0_EAX [L882] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1 && __unbuffered_p3_EAX == 1) [L884] 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}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=1, __unbuffered_p0_EAX$flush_delayed=0, __unbuffered_p0_EAX$mem_tmp=0, __unbuffered_p0_EAX$r_buff0_thd0=0, __unbuffered_p0_EAX$r_buff0_thd1=0, __unbuffered_p0_EAX$r_buff0_thd2=0, __unbuffered_p0_EAX$r_buff0_thd3=0, __unbuffered_p0_EAX$r_buff0_thd4=0, __unbuffered_p0_EAX$r_buff1_thd0=0, __unbuffered_p0_EAX$r_buff1_thd1=0, __unbuffered_p0_EAX$r_buff1_thd2=0, __unbuffered_p0_EAX$r_buff1_thd3=0, __unbuffered_p0_EAX$r_buff1_thd4=0, __unbuffered_p0_EAX$read_delayed=1, __unbuffered_p0_EAX$read_delayed_var={3:0}, __unbuffered_p0_EAX$w_buff0=0, __unbuffered_p0_EAX$w_buff0_used=0, __unbuffered_p0_EAX$w_buff1=0, __unbuffered_p0_EAX$w_buff1_used=0, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=1, __unbuffered_p3_EAX=1, a={3:0}, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0: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=128, weak$$choice2=2, x=1, y=1, z=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: 858]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 861]: 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: 863]: 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: 867]: 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: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 241 locations, 56 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: 31.0s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 10.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 14.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 648 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 429 mSDsluCounter, 168 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 67 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1507 IncrementalHoareTripleChecker+Invalid, 1585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 101 mSDtfsCounter, 1507 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 210 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=6, InterpolantAutomatonStates: 46, 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.7s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 243 NumberOfCodeBlocks, 243 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 204 ConstructedInterpolants, 0 QuantifiedInterpolants, 840 SizeOfPredicates, 54 NumberOfNonLiveVariables, 1967 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 18:43:09,646 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c17de227-3aab-4b6f-aef7-7471ce93ef07/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