./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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_8a0e78ed-dad9-476b-88c6-0009a4370867/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 10a668ec1ea7995e15ba3bf7e664e16993ba1d6d90153ec7cf305acc426b53b6 --- 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 14:24:19,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:24:19,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:24:19,086 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:24:19,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:24:19,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:24:19,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:24:19,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:24:19,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:24:19,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:24:19,094 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:24:19,095 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:24:19,095 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:24:19,096 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:24:19,098 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:24:19,099 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:24:19,100 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:24:19,101 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:24:19,102 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:24:19,104 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:24:19,106 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:24:19,107 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:24:19,108 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:24:19,109 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:24:19,113 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:24:19,113 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:24:19,114 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:24:19,115 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:24:19,115 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:24:19,116 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:24:19,117 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:24:19,118 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:24:19,118 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:24:19,119 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:24:19,120 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:24:19,120 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:24:19,121 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:24:19,121 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:24:19,121 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:24:19,122 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:24:19,122 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:24:19,123 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-12-13 14:24:19,145 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:24:19,146 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:24:19,146 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:24:19,146 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:24:19,147 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:24:19,147 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:24:19,148 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:24:19,148 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:24:19,148 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:24:19,148 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:24:19,148 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:24:19,149 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 14:24:19,149 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:24:19,149 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:24:19,149 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:24:19,149 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 14:24:19,150 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 14:24:19,150 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 14:24:19,150 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:24:19,150 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 14:24:19,150 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:24:19,150 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:24:19,150 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:24:19,150 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:24:19,151 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:24:19,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:24:19,151 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:24:19,151 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:24:19,151 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 14:24:19,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 14:24:19,151 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:24:19,152 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:24:19,152 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:24:19,152 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:24:19,152 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_8a0e78ed-dad9-476b-88c6-0009a4370867/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_8a0e78ed-dad9-476b-88c6-0009a4370867/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 -> 10a668ec1ea7995e15ba3bf7e664e16993ba1d6d90153ec7cf305acc426b53b6 [2022-12-13 14:24:19,339 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:24:19,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:24:19,356 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:24:19,357 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:24:19,357 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:24:19,358 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i [2022-12-13 14:24:21,888 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:24:22,088 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:24:22,088 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i [2022-12-13 14:24:22,100 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/data/69018182a/232bdb68d44446d5b31d213b9f32817c/FLAG609d048cc [2022-12-13 14:24:22,111 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/data/69018182a/232bdb68d44446d5b31d213b9f32817c [2022-12-13 14:24:22,113 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:24:22,114 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:24:22,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:24:22,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:24:22,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:24:22,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:24:22" (1/1) ... [2022-12-13 14:24:22,119 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bf929b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:22, skipping insertion in model container [2022-12-13 14:24:22,120 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:24:22" (1/1) ... [2022-12-13 14:24:22,125 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:24:22,156 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:24:22,269 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_8a0e78ed-dad9-476b-88c6-0009a4370867/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i[959,972] [2022-12-13 14:24:22,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,370 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,371 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,373 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,374 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,375 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,378 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,383 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,390 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,396 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:24:22,406 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:24:22,414 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_8a0e78ed-dad9-476b-88c6-0009a4370867/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i[959,972] [2022-12-13 14:24:22,429 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,430 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,432 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,433 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,434 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,436 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,437 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,439 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,442 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,444 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:22,448 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:22,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:24:22,471 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:24:22,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:22 WrapperNode [2022-12-13 14:24:22,471 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:24:22,472 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:24:22,472 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:24:22,472 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:24:22,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:22" (1/1) ... [2022-12-13 14:24:22,492 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:22" (1/1) ... [2022-12-13 14:24:22,517 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 143 [2022-12-13 14:24:22,517 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:24:22,518 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:24:22,518 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:24:22,518 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:24:22,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:22" (1/1) ... [2022-12-13 14:24:22,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:22" (1/1) ... [2022-12-13 14:24:22,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:22" (1/1) ... [2022-12-13 14:24:22,532 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:22" (1/1) ... [2022-12-13 14:24:22,539 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:22" (1/1) ... [2022-12-13 14:24:22,541 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:22" (1/1) ... [2022-12-13 14:24:22,543 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:22" (1/1) ... [2022-12-13 14:24:22,545 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:22" (1/1) ... [2022-12-13 14:24:22,548 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:24:22,548 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:24:22,549 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:24:22,549 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:24:22,550 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:22" (1/1) ... [2022-12-13 14:24:22,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:24:22,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:24:22,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:24:22,580 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:24:22,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-13 14:24:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 14:24:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:24:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 14:24:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 14:24:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 14:24:22,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 14:24:22,613 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 14:24:22,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 14:24:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 14:24:22,614 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 14:24:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 14:24:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 14:24:22,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:24:22,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:24:22,616 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 14:24:22,729 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:24:22,731 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:24:22,968 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:24:23,112 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:24:23,113 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 14:24:23,114 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:24:23 BoogieIcfgContainer [2022-12-13 14:24:23,115 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:24:23,116 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:24:23,116 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:24:23,118 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:24:23,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:24:22" (1/3) ... [2022-12-13 14:24:23,119 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdb534d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:24:23, skipping insertion in model container [2022-12-13 14:24:23,119 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:22" (2/3) ... [2022-12-13 14:24:23,120 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdb534d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:24:23, skipping insertion in model container [2022-12-13 14:24:23,120 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:24:23" (3/3) ... [2022-12-13 14:24:23,121 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.opt_pso.opt.i [2022-12-13 14:24:23,134 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:24:23,134 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-13 14:24:23,135 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 14:24:23,178 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 14:24:23,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 14:24:23,247 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 14:24:23,247 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:24:23,251 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-12-13 14:24:23,251 INFO L82 GeneralOperation]: Start removeDead. Operand has 133 places, 125 transitions, 265 flow [2022-12-13 14:24:23,254 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 122 transitions, 253 flow [2022-12-13 14:24:23,257 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 14:24:23,265 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-13 14:24:23,267 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 122 transitions, 253 flow [2022-12-13 14:24:23,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 253 flow [2022-12-13 14:24:23,287 INFO L130 PetriNetUnfolder]: 2/122 cut-off events. [2022-12-13 14:24:23,287 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:24:23,287 INFO L83 FinitePrefix]: Finished finitePrefix Result has 132 conditions, 122 events. 2/122 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-12-13 14:24:23,288 INFO L119 LiptonReduction]: Number of co-enabled transitions 2302 [2022-12-13 14:24:28,383 INFO L134 LiptonReduction]: Checked pairs total: 6397 [2022-12-13 14:24:28,383 INFO L136 LiptonReduction]: Total number of compositions: 123 [2022-12-13 14:24:28,396 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:24:28,400 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;@5b10031e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:24:28,400 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 14:24:28,401 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 14:24:28,402 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:24:28,402 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:28,402 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 14:24:28,402 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:28,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:28,406 INFO L85 PathProgramCache]: Analyzing trace with hash 542, now seen corresponding path program 1 times [2022-12-13 14:24:28,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:28,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153450889] [2022-12-13 14:24:28,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:28,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:28,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:28,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:24:28,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:24:28,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153450889] [2022-12-13 14:24:28,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153450889] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:28,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:28,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 14:24:28,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160668717] [2022-12-13 14:24:28,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:28,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 14:24:28,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:24:28,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 14:24:28,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 14:24:28,519 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 248 [2022-12-13 14:24:28,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:28,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:28,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 248 [2022-12-13 14:24:28,522 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:28,780 INFO L130 PetriNetUnfolder]: 1093/1658 cut-off events. [2022-12-13 14:24:28,780 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 14:24:28,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3335 conditions, 1658 events. 1093/1658 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7864 event pairs, 1093 based on Foata normal form. 0/1365 useless extension candidates. Maximal degree in co-relation 3324. Up to 1623 conditions per place. [2022-12-13 14:24:28,789 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 21 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2022-12-13 14:24:28,789 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 99 flow [2022-12-13 14:24:28,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 14:24:28,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 14:24:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 251 transitions. [2022-12-13 14:24:28,799 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5060483870967742 [2022-12-13 14:24:28,799 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 251 transitions. [2022-12-13 14:24:28,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 251 transitions. [2022-12-13 14:24:28,800 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:28,802 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 251 transitions. [2022-12-13 14:24:28,804 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.5) internal successors, (251), 2 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:28,807 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:28,808 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:28,809 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 69 flow. Second operand 2 states and 251 transitions. [2022-12-13 14:24:28,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 99 flow [2022-12-13 14:24:28,812 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 14:24:28,813 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2022-12-13 14:24:28,814 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2022-12-13 14:24:28,816 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2022-12-13 14:24:28,817 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2022-12-13 14:24:28,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 112.5) internal successors, (225), 2 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:28,817 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:28,817 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 14:24:28,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 14:24:28,817 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:28,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:28,818 INFO L85 PathProgramCache]: Analyzing trace with hash 511599720, now seen corresponding path program 1 times [2022-12-13 14:24:28,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:28,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689131236] [2022-12-13 14:24:28,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:28,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:28,995 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 14:24:28,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:24:28,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689131236] [2022-12-13 14:24:28,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689131236] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:28,996 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:28,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 14:24:28,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763004154] [2022-12-13 14:24:28,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:28,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:24:28,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:24:28,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:24:28,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:24:29,002 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 248 [2022-12-13 14:24:29,003 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:29,003 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:29,003 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 248 [2022-12-13 14:24:29,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:29,282 INFO L130 PetriNetUnfolder]: 855/1345 cut-off events. [2022-12-13 14:24:29,282 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:24:29,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2670 conditions, 1345 events. 855/1345 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 6483 event pairs, 237 based on Foata normal form. 0/1212 useless extension candidates. Maximal degree in co-relation 2667. Up to 1027 conditions per place. [2022-12-13 14:24:29,291 INFO L137 encePairwiseOnDemand]: 245/248 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2022-12-13 14:24:29,291 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 146 flow [2022-12-13 14:24:29,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:24:29,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 14:24:29,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 367 transitions. [2022-12-13 14:24:29,295 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4932795698924731 [2022-12-13 14:24:29,295 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 367 transitions. [2022-12-13 14:24:29,295 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 367 transitions. [2022-12-13 14:24:29,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:29,296 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 367 transitions. [2022-12-13 14:24:29,298 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 122.33333333333333) internal successors, (367), 3 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:29,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:29,303 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 248.0) internal successors, (992), 4 states have internal predecessors, (992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:29,303 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 367 transitions. [2022-12-13 14:24:29,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 146 flow [2022-12-13 14:24:29,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 14:24:29,305 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2022-12-13 14:24:29,305 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-13 14:24:29,306 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2022-12-13 14:24:29,306 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2022-12-13 14:24:29,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:29,306 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:29,307 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:24:29,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 14:24:29,307 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:29,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:29,307 INFO L85 PathProgramCache]: Analyzing trace with hash 979177796, now seen corresponding path program 1 times [2022-12-13 14:24:29,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:29,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707693410] [2022-12-13 14:24:29,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:29,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:29,698 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 14:24:29,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:24:29,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707693410] [2022-12-13 14:24:29,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707693410] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:29,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:29,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:24:29,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266089662] [2022-12-13 14:24:29,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:29,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:24:29,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:24:29,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:24:29,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:24:29,735 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 248 [2022-12-13 14:24:29,736 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:29,736 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:29,736 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 248 [2022-12-13 14:24:29,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:30,028 INFO L130 PetriNetUnfolder]: 935/1428 cut-off events. [2022-12-13 14:24:30,029 INFO L131 PetriNetUnfolder]: For 117/117 co-relation queries the response was YES. [2022-12-13 14:24:30,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3019 conditions, 1428 events. 935/1428 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 6471 event pairs, 183 based on Foata normal form. 0/1359 useless extension candidates. Maximal degree in co-relation 3015. Up to 1057 conditions per place. [2022-12-13 14:24:30,040 INFO L137 encePairwiseOnDemand]: 239/248 looper letters, 30 selfloop transitions, 8 changer transitions 0/40 dead transitions. [2022-12-13 14:24:30,040 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 40 transitions, 170 flow [2022-12-13 14:24:30,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:24:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 14:24:30,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 455 transitions. [2022-12-13 14:24:30,043 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4586693548387097 [2022-12-13 14:24:30,043 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 455 transitions. [2022-12-13 14:24:30,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 455 transitions. [2022-12-13 14:24:30,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:30,044 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 455 transitions. [2022-12-13 14:24:30,046 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:30,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:30,051 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:30,051 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 4 states and 455 transitions. [2022-12-13 14:24:30,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 40 transitions, 170 flow [2022-12-13 14:24:30,052 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 40 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 14:24:30,053 INFO L231 Difference]: Finished difference. Result has 36 places, 28 transitions, 108 flow [2022-12-13 14:24:30,054 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=108, PETRI_PLACES=36, PETRI_TRANSITIONS=28} [2022-12-13 14:24:30,054 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2022-12-13 14:24:30,055 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 28 transitions, 108 flow [2022-12-13 14:24:30,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.25) internal successors, (425), 4 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:30,055 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:30,055 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:24:30,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 14:24:30,056 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:30,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash 979177813, now seen corresponding path program 1 times [2022-12-13 14:24:30,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:30,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783268836] [2022-12-13 14:24:30,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:30,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:30,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:24:30,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:24:30,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783268836] [2022-12-13 14:24:30,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783268836] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:30,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:30,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:24:30,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127601021] [2022-12-13 14:24:30,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:30,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:24:30,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:24:30,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:24:30,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:24:30,436 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 248 [2022-12-13 14:24:30,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 28 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:30,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:30,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 248 [2022-12-13 14:24:30,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:30,668 INFO L130 PetriNetUnfolder]: 798/1279 cut-off events. [2022-12-13 14:24:30,668 INFO L131 PetriNetUnfolder]: For 578/594 co-relation queries the response was YES. [2022-12-13 14:24:30,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3414 conditions, 1279 events. 798/1279 cut-off events. For 578/594 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6291 event pairs, 56 based on Foata normal form. 16/1283 useless extension candidates. Maximal degree in co-relation 3408. Up to 995 conditions per place. [2022-12-13 14:24:30,673 INFO L137 encePairwiseOnDemand]: 243/248 looper letters, 36 selfloop transitions, 4 changer transitions 0/44 dead transitions. [2022-12-13 14:24:30,673 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 44 transitions, 232 flow [2022-12-13 14:24:30,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:24:30,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 14:24:30,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 527 transitions. [2022-12-13 14:24:30,676 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.425 [2022-12-13 14:24:30,676 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 527 transitions. [2022-12-13 14:24:30,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 527 transitions. [2022-12-13 14:24:30,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:30,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 527 transitions. [2022-12-13 14:24:30,679 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 105.4) internal successors, (527), 5 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 14:24:30,681 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:30,682 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:30,682 INFO L175 Difference]: Start difference. First operand has 36 places, 28 transitions, 108 flow. Second operand 5 states and 527 transitions. [2022-12-13 14:24:30,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 44 transitions, 232 flow [2022-12-13 14:24:30,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 44 transitions, 222 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 14:24:30,684 INFO L231 Difference]: Finished difference. Result has 38 places, 27 transitions, 102 flow [2022-12-13 14:24:30,684 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=102, PETRI_PLACES=38, PETRI_TRANSITIONS=27} [2022-12-13 14:24:30,684 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2022-12-13 14:24:30,684 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 27 transitions, 102 flow [2022-12-13 14:24:30,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.8) internal successors, (499), 5 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:30,685 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:30,685 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:24:30,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 14:24:30,685 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:30,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:30,685 INFO L85 PathProgramCache]: Analyzing trace with hash 289739500, now seen corresponding path program 1 times [2022-12-13 14:24:30,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:30,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073428592] [2022-12-13 14:24:30,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:30,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:30,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:31,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:24:31,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:24:31,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073428592] [2022-12-13 14:24:31,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073428592] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:31,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:31,019 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:24:31,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063726415] [2022-12-13 14:24:31,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:31,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:24:31,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:24:31,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:24:31,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:24:31,103 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 248 [2022-12-13 14:24:31,103 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 27 transitions, 102 flow. Second operand has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:31,103 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:31,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 248 [2022-12-13 14:24:31,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:31,292 INFO L130 PetriNetUnfolder]: 635/977 cut-off events. [2022-12-13 14:24:31,292 INFO L131 PetriNetUnfolder]: For 549/589 co-relation queries the response was YES. [2022-12-13 14:24:31,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2593 conditions, 977 events. 635/977 cut-off events. For 549/589 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 4260 event pairs, 298 based on Foata normal form. 74/1013 useless extension candidates. Maximal degree in co-relation 2586. Up to 908 conditions per place. [2022-12-13 14:24:31,298 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 24 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2022-12-13 14:24:31,298 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 30 transitions, 152 flow [2022-12-13 14:24:31,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:24:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 14:24:31,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2022-12-13 14:24:31,300 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4137096774193548 [2022-12-13 14:24:31,300 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 513 transitions. [2022-12-13 14:24:31,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 513 transitions. [2022-12-13 14:24:31,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:31,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 513 transitions. [2022-12-13 14:24:31,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:31,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:31,303 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:31,303 INFO L175 Difference]: Start difference. First operand has 38 places, 27 transitions, 102 flow. Second operand 5 states and 513 transitions. [2022-12-13 14:24:31,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 30 transitions, 152 flow [2022-12-13 14:24:31,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 30 transitions, 142 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-12-13 14:24:31,305 INFO L231 Difference]: Finished difference. Result has 35 places, 21 transitions, 68 flow [2022-12-13 14:24:31,305 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=62, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=68, PETRI_PLACES=35, PETRI_TRANSITIONS=21} [2022-12-13 14:24:31,306 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -5 predicate places. [2022-12-13 14:24:31,306 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 21 transitions, 68 flow [2022-12-13 14:24:31,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 99.0) internal successors, (495), 5 states have internal predecessors, (495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:31,306 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:31,306 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:24:31,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 14:24:31,307 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:31,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:31,307 INFO L85 PathProgramCache]: Analyzing trace with hash 289692053, now seen corresponding path program 1 times [2022-12-13 14:24:31,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:31,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969652044] [2022-12-13 14:24:31,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:31,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:31,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:31,692 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 14:24:31,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:24:31,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969652044] [2022-12-13 14:24:31,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969652044] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:31,693 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:31,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:24:31,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085873260] [2022-12-13 14:24:31,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:31,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:24:31,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:24:31,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:24:31,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:24:31,725 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 248 [2022-12-13 14:24:31,726 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 21 transitions, 68 flow. Second operand has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:31,726 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:31,726 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 248 [2022-12-13 14:24:31,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:31,950 INFO L130 PetriNetUnfolder]: 869/1390 cut-off events. [2022-12-13 14:24:31,950 INFO L131 PetriNetUnfolder]: For 402/402 co-relation queries the response was YES. [2022-12-13 14:24:31,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3388 conditions, 1390 events. 869/1390 cut-off events. For 402/402 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6505 event pairs, 150 based on Foata normal form. 12/1402 useless extension candidates. Maximal degree in co-relation 3382. Up to 1202 conditions per place. [2022-12-13 14:24:31,954 INFO L137 encePairwiseOnDemand]: 239/248 looper letters, 36 selfloop transitions, 9 changer transitions 0/46 dead transitions. [2022-12-13 14:24:31,954 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 46 transitions, 240 flow [2022-12-13 14:24:31,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:24:31,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 14:24:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 459 transitions. [2022-12-13 14:24:31,956 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4627016129032258 [2022-12-13 14:24:31,956 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 459 transitions. [2022-12-13 14:24:31,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 459 transitions. [2022-12-13 14:24:31,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:31,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 459 transitions. [2022-12-13 14:24:31,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 114.75) internal successors, (459), 4 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:31,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:31,958 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:31,958 INFO L175 Difference]: Start difference. First operand has 35 places, 21 transitions, 68 flow. Second operand 4 states and 459 transitions. [2022-12-13 14:24:31,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 46 transitions, 240 flow [2022-12-13 14:24:31,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 229 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 14:24:31,960 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 136 flow [2022-12-13 14:24:31,960 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=63, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=136, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2022-12-13 14:24:31,960 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-12-13 14:24:31,960 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 136 flow [2022-12-13 14:24:31,960 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:31,961 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:31,961 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:24:31,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 14:24:31,961 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:31,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:31,961 INFO L85 PathProgramCache]: Analyzing trace with hash 390517589, now seen corresponding path program 1 times [2022-12-13 14:24:31,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:31,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955530908] [2022-12-13 14:24:31,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:31,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:31,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:32,430 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 14:24:32,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:24:32,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955530908] [2022-12-13 14:24:32,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955530908] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:32,431 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:32,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:24:32,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813298975] [2022-12-13 14:24:32,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:32,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:24:32,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:24:32,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:24:32,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:24:32,487 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 248 [2022-12-13 14:24:32,487 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 136 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:32,487 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:32,487 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 248 [2022-12-13 14:24:32,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:32,875 INFO L130 PetriNetUnfolder]: 984/1552 cut-off events. [2022-12-13 14:24:32,875 INFO L131 PetriNetUnfolder]: For 1326/1326 co-relation queries the response was YES. [2022-12-13 14:24:32,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4752 conditions, 1552 events. 984/1552 cut-off events. For 1326/1326 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7436 event pairs, 144 based on Foata normal form. 12/1564 useless extension candidates. Maximal degree in co-relation 4744. Up to 1238 conditions per place. [2022-12-13 14:24:32,881 INFO L137 encePairwiseOnDemand]: 238/248 looper letters, 44 selfloop transitions, 26 changer transitions 0/71 dead transitions. [2022-12-13 14:24:32,881 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 71 transitions, 442 flow [2022-12-13 14:24:32,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:24:32,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 14:24:32,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 679 transitions. [2022-12-13 14:24:32,883 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45631720430107525 [2022-12-13 14:24:32,883 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 679 transitions. [2022-12-13 14:24:32,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 679 transitions. [2022-12-13 14:24:32,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:32,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 679 transitions. [2022-12-13 14:24:32,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 113.16666666666667) internal successors, (679), 6 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:32,886 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:32,886 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:32,886 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 136 flow. Second operand 6 states and 679 transitions. [2022-12-13 14:24:32,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 71 transitions, 442 flow [2022-12-13 14:24:32,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 71 transitions, 434 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-13 14:24:32,888 INFO L231 Difference]: Finished difference. Result has 45 places, 48 transitions, 332 flow [2022-12-13 14:24:32,888 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=332, PETRI_PLACES=45, PETRI_TRANSITIONS=48} [2022-12-13 14:24:32,889 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2022-12-13 14:24:32,889 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 48 transitions, 332 flow [2022-12-13 14:24:32,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:32,889 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:32,889 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:24:32,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 14:24:32,890 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:32,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:32,890 INFO L85 PathProgramCache]: Analyzing trace with hash 391977689, now seen corresponding path program 2 times [2022-12-13 14:24:32,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:32,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390109786] [2022-12-13 14:24:32,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:32,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:32,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:33,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:24:33,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:24:33,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390109786] [2022-12-13 14:24:33,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390109786] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:33,548 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:33,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:24:33,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381446907] [2022-12-13 14:24:33,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:33,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:24:33,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:24:33,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:24:33,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:24:33,594 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 248 [2022-12-13 14:24:33,595 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 48 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:33,595 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:33,595 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 248 [2022-12-13 14:24:33,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:33,916 INFO L130 PetriNetUnfolder]: 995/1572 cut-off events. [2022-12-13 14:24:33,916 INFO L131 PetriNetUnfolder]: For 3671/3671 co-relation queries the response was YES. [2022-12-13 14:24:33,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6117 conditions, 1572 events. 995/1572 cut-off events. For 3671/3671 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 7576 event pairs, 144 based on Foata normal form. 16/1588 useless extension candidates. Maximal degree in co-relation 6105. Up to 1219 conditions per place. [2022-12-13 14:24:33,924 INFO L137 encePairwiseOnDemand]: 238/248 looper letters, 47 selfloop transitions, 30 changer transitions 0/78 dead transitions. [2022-12-13 14:24:33,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 78 transitions, 629 flow [2022-12-13 14:24:33,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:24:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 14:24:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-12-13 14:24:33,926 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4588709677419355 [2022-12-13 14:24:33,926 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 569 transitions. [2022-12-13 14:24:33,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 569 transitions. [2022-12-13 14:24:33,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:33,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 569 transitions. [2022-12-13 14:24:33,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.8) internal successors, (569), 5 states have internal predecessors, (569), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:33,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:33,930 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:33,931 INFO L175 Difference]: Start difference. First operand has 45 places, 48 transitions, 332 flow. Second operand 5 states and 569 transitions. [2022-12-13 14:24:33,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 78 transitions, 629 flow [2022-12-13 14:24:33,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 78 transitions, 600 flow, removed 13 selfloop flow, removed 1 redundant places. [2022-12-13 14:24:33,938 INFO L231 Difference]: Finished difference. Result has 50 places, 56 transitions, 469 flow [2022-12-13 14:24:33,938 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=469, PETRI_PLACES=50, PETRI_TRANSITIONS=56} [2022-12-13 14:24:33,939 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 10 predicate places. [2022-12-13 14:24:33,939 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 56 transitions, 469 flow [2022-12-13 14:24:33,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.83333333333333) internal successors, (623), 6 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:33,939 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:33,939 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:24:33,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 14:24:33,940 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:33,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:33,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1960478622, now seen corresponding path program 1 times [2022-12-13 14:24:33,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:33,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490017032] [2022-12-13 14:24:33,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:33,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:34,217 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 14:24:34,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:24:34,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490017032] [2022-12-13 14:24:34,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1490017032] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:34,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:34,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:24:34,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756564563] [2022-12-13 14:24:34,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:34,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:24:34,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:24:34,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:24:34,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:24:34,249 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 248 [2022-12-13 14:24:34,250 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 56 transitions, 469 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:34,250 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:34,250 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 248 [2022-12-13 14:24:34,250 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:34,538 INFO L130 PetriNetUnfolder]: 1540/2313 cut-off events. [2022-12-13 14:24:34,539 INFO L131 PetriNetUnfolder]: For 9554/9649 co-relation queries the response was YES. [2022-12-13 14:24:34,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10133 conditions, 2313 events. 1540/2313 cut-off events. For 9554/9649 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 10881 event pairs, 252 based on Foata normal form. 174/2484 useless extension candidates. Maximal degree in co-relation 10118. Up to 919 conditions per place. [2022-12-13 14:24:34,551 INFO L137 encePairwiseOnDemand]: 244/248 looper letters, 58 selfloop transitions, 6 changer transitions 35/104 dead transitions. [2022-12-13 14:24:34,551 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 104 transitions, 1056 flow [2022-12-13 14:24:34,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:24:34,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 14:24:34,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2022-12-13 14:24:34,552 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45463709677419356 [2022-12-13 14:24:34,552 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 451 transitions. [2022-12-13 14:24:34,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 451 transitions. [2022-12-13 14:24:34,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:34,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 451 transitions. [2022-12-13 14:24:34,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 112.75) internal successors, (451), 4 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:34,554 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:34,554 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 248.0) internal successors, (1240), 5 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:34,554 INFO L175 Difference]: Start difference. First operand has 50 places, 56 transitions, 469 flow. Second operand 4 states and 451 transitions. [2022-12-13 14:24:34,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 104 transitions, 1056 flow [2022-12-13 14:24:34,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 104 transitions, 986 flow, removed 27 selfloop flow, removed 2 redundant places. [2022-12-13 14:24:34,560 INFO L231 Difference]: Finished difference. Result has 53 places, 48 transitions, 384 flow [2022-12-13 14:24:34,560 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=436, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=384, PETRI_PLACES=53, PETRI_TRANSITIONS=48} [2022-12-13 14:24:34,561 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2022-12-13 14:24:34,561 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 48 transitions, 384 flow [2022-12-13 14:24:34,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:34,561 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:34,561 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:24:34,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 14:24:34,561 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:34,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:34,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1268688966, now seen corresponding path program 1 times [2022-12-13 14:24:34,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:34,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278245905] [2022-12-13 14:24:34,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:34,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:34,679 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 14:24:34,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:24:34,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278245905] [2022-12-13 14:24:34,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278245905] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:34,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:34,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:24:34,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799809427] [2022-12-13 14:24:34,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:34,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:24:34,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:24:34,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:24:34,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:24:34,689 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 248 [2022-12-13 14:24:34,690 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 48 transitions, 384 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:34,690 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:34,690 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 248 [2022-12-13 14:24:34,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:34,892 INFO L130 PetriNetUnfolder]: 478/810 cut-off events. [2022-12-13 14:24:34,892 INFO L131 PetriNetUnfolder]: For 3157/3266 co-relation queries the response was YES. [2022-12-13 14:24:34,893 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3477 conditions, 810 events. 478/810 cut-off events. For 3157/3266 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 3569 event pairs, 115 based on Foata normal form. 120/911 useless extension candidates. Maximal degree in co-relation 3460. Up to 431 conditions per place. [2022-12-13 14:24:34,896 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 48 selfloop transitions, 6 changer transitions 22/83 dead transitions. [2022-12-13 14:24:34,896 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 83 transitions, 746 flow [2022-12-13 14:24:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:24:34,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 14:24:34,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 587 transitions. [2022-12-13 14:24:34,898 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47338709677419355 [2022-12-13 14:24:34,898 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 587 transitions. [2022-12-13 14:24:34,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 587 transitions. [2022-12-13 14:24:34,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:34,898 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 587 transitions. [2022-12-13 14:24:34,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 117.4) internal successors, (587), 5 states have internal predecessors, (587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:34,901 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:34,901 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:34,901 INFO L175 Difference]: Start difference. First operand has 53 places, 48 transitions, 384 flow. Second operand 5 states and 587 transitions. [2022-12-13 14:24:34,901 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 83 transitions, 746 flow [2022-12-13 14:24:34,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 83 transitions, 698 flow, removed 8 selfloop flow, removed 5 redundant places. [2022-12-13 14:24:34,904 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 316 flow [2022-12-13 14:24:34,904 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=316, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2022-12-13 14:24:34,904 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2022-12-13 14:24:34,905 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 316 flow [2022-12-13 14:24:34,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:34,905 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:34,905 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:24:34,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 14:24:34,905 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:34,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:34,905 INFO L85 PathProgramCache]: Analyzing trace with hash -2053498726, now seen corresponding path program 1 times [2022-12-13 14:24:34,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:34,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479546500] [2022-12-13 14:24:34,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:34,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:34,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:35,009 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 14:24:35,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:24:35,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479546500] [2022-12-13 14:24:35,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479546500] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:35,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:35,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:24:35,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757328789] [2022-12-13 14:24:35,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:35,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:24:35,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:24:35,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:24:35,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:24:35,020 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 248 [2022-12-13 14:24:35,021 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 316 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:35,021 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:35,021 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 248 [2022-12-13 14:24:35,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:35,185 INFO L130 PetriNetUnfolder]: 324/586 cut-off events. [2022-12-13 14:24:35,185 INFO L131 PetriNetUnfolder]: For 2229/2317 co-relation queries the response was YES. [2022-12-13 14:24:35,186 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2651 conditions, 586 events. 324/586 cut-off events. For 2229/2317 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2606 event pairs, 45 based on Foata normal form. 75/651 useless extension candidates. Maximal degree in co-relation 2633. Up to 190 conditions per place. [2022-12-13 14:24:35,187 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 61 selfloop transitions, 12 changer transitions 20/100 dead transitions. [2022-12-13 14:24:35,187 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 100 transitions, 893 flow [2022-12-13 14:24:35,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:24:35,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 14:24:35,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 818 transitions. [2022-12-13 14:24:35,189 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47119815668202764 [2022-12-13 14:24:35,189 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 818 transitions. [2022-12-13 14:24:35,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 818 transitions. [2022-12-13 14:24:35,189 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:35,189 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 818 transitions. [2022-12-13 14:24:35,190 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 116.85714285714286) internal successors, (818), 7 states have internal predecessors, (818), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:35,192 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:35,192 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 248.0) internal successors, (1984), 8 states have internal predecessors, (1984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:35,192 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 316 flow. Second operand 7 states and 818 transitions. [2022-12-13 14:24:35,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 100 transitions, 893 flow [2022-12-13 14:24:35,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 100 transitions, 893 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 14:24:35,195 INFO L231 Difference]: Finished difference. Result has 64 places, 49 transitions, 397 flow [2022-12-13 14:24:35,195 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=316, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=397, PETRI_PLACES=64, PETRI_TRANSITIONS=49} [2022-12-13 14:24:35,195 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2022-12-13 14:24:35,196 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 49 transitions, 397 flow [2022-12-13 14:24:35,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:35,196 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:35,196 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 14:24:35,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 14:24:35,196 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:35,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash 829495104, now seen corresponding path program 1 times [2022-12-13 14:24:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:35,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645739887] [2022-12-13 14:24:35,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:35,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:35,314 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 14:24:35,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:24:35,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645739887] [2022-12-13 14:24:35,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645739887] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:35,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:35,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:24:35,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057084475] [2022-12-13 14:24:35,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:35,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:24:35,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:24:35,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:24:35,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:24:35,327 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 248 [2022-12-13 14:24:35,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 49 transitions, 397 flow. Second operand has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:35,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:35,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 248 [2022-12-13 14:24:35,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:35,491 INFO L130 PetriNetUnfolder]: 291/531 cut-off events. [2022-12-13 14:24:35,491 INFO L131 PetriNetUnfolder]: For 2144/2216 co-relation queries the response was YES. [2022-12-13 14:24:35,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2609 conditions, 531 events. 291/531 cut-off events. For 2144/2216 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2394 event pairs, 40 based on Foata normal form. 46/568 useless extension candidates. Maximal degree in co-relation 2587. Up to 160 conditions per place. [2022-12-13 14:24:35,494 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 58 selfloop transitions, 16 changer transitions 19/100 dead transitions. [2022-12-13 14:24:35,494 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 100 transitions, 952 flow [2022-12-13 14:24:35,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-13 14:24:35,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-13 14:24:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1032 transitions. [2022-12-13 14:24:35,496 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46236559139784944 [2022-12-13 14:24:35,496 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1032 transitions. [2022-12-13 14:24:35,496 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1032 transitions. [2022-12-13 14:24:35,496 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:35,496 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1032 transitions. [2022-12-13 14:24:35,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 114.66666666666667) internal successors, (1032), 9 states have internal predecessors, (1032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:35,499 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:35,499 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 248.0) internal successors, (2480), 10 states have internal predecessors, (2480), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:35,499 INFO L175 Difference]: Start difference. First operand has 64 places, 49 transitions, 397 flow. Second operand 9 states and 1032 transitions. [2022-12-13 14:24:35,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 100 transitions, 952 flow [2022-12-13 14:24:35,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 100 transitions, 900 flow, removed 17 selfloop flow, removed 3 redundant places. [2022-12-13 14:24:35,505 INFO L231 Difference]: Finished difference. Result has 72 places, 50 transitions, 408 flow [2022-12-13 14:24:35,505 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=408, PETRI_PLACES=72, PETRI_TRANSITIONS=50} [2022-12-13 14:24:35,505 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 32 predicate places. [2022-12-13 14:24:35,505 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 50 transitions, 408 flow [2022-12-13 14:24:35,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.5) internal successors, (657), 6 states have internal predecessors, (657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:35,505 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:35,505 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 14:24:35,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 14:24:35,506 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:35,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:35,506 INFO L85 PathProgramCache]: Analyzing trace with hash -397805147, now seen corresponding path program 1 times [2022-12-13 14:24:35,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:35,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512499374] [2022-12-13 14:24:35,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:35,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:35,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:35,776 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 14:24:35,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:24:35,776 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512499374] [2022-12-13 14:24:35,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1512499374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:35,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:35,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:24:35,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793761905] [2022-12-13 14:24:35,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:35,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:24:35,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:24:35,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:24:35,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:24:35,820 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 248 [2022-12-13 14:24:35,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 50 transitions, 408 flow. Second operand has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:35,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:35,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 248 [2022-12-13 14:24:35,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:36,049 INFO L130 PetriNetUnfolder]: 396/752 cut-off events. [2022-12-13 14:24:36,050 INFO L131 PetriNetUnfolder]: For 2827/2827 co-relation queries the response was YES. [2022-12-13 14:24:36,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3731 conditions, 752 events. 396/752 cut-off events. For 2827/2827 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 3632 event pairs, 45 based on Foata normal form. 1/751 useless extension candidates. Maximal degree in co-relation 3706. Up to 399 conditions per place. [2022-12-13 14:24:36,052 INFO L137 encePairwiseOnDemand]: 242/248 looper letters, 39 selfloop transitions, 3 changer transitions 62/107 dead transitions. [2022-12-13 14:24:36,052 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 107 transitions, 1062 flow [2022-12-13 14:24:36,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:24:36,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 14:24:36,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 663 transitions. [2022-12-13 14:24:36,054 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.44556451612903225 [2022-12-13 14:24:36,054 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 663 transitions. [2022-12-13 14:24:36,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 663 transitions. [2022-12-13 14:24:36,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:36,054 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 663 transitions. [2022-12-13 14:24:36,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:36,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:36,056 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:36,056 INFO L175 Difference]: Start difference. First operand has 72 places, 50 transitions, 408 flow. Second operand 6 states and 663 transitions. [2022-12-13 14:24:36,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 107 transitions, 1062 flow [2022-12-13 14:24:36,064 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 107 transitions, 915 flow, removed 28 selfloop flow, removed 10 redundant places. [2022-12-13 14:24:36,065 INFO L231 Difference]: Finished difference. Result has 68 places, 35 transitions, 231 flow [2022-12-13 14:24:36,065 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=68, PETRI_TRANSITIONS=35} [2022-12-13 14:24:36,066 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 28 predicate places. [2022-12-13 14:24:36,066 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 35 transitions, 231 flow [2022-12-13 14:24:36,066 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.8) internal successors, (529), 5 states have internal predecessors, (529), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:36,066 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:36,066 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:24:36,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 14:24:36,067 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:36,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:36,067 INFO L85 PathProgramCache]: Analyzing trace with hash -115103241, now seen corresponding path program 2 times [2022-12-13 14:24:36,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:36,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116830159] [2022-12-13 14:24:36,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:36,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:36,822 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 14:24:36,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:24:36,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116830159] [2022-12-13 14:24:36,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116830159] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:36,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:36,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:24:36,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874760368] [2022-12-13 14:24:36,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:36,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-12-13 14:24:36,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:24:36,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-12-13 14:24:36,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-13 14:24:36,905 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 248 [2022-12-13 14:24:36,906 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 35 transitions, 231 flow. Second operand has 7 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:36,906 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:36,906 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 248 [2022-12-13 14:24:36,907 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:37,141 INFO L130 PetriNetUnfolder]: 135/275 cut-off events. [2022-12-13 14:24:37,141 INFO L131 PetriNetUnfolder]: For 666/666 co-relation queries the response was YES. [2022-12-13 14:24:37,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1248 conditions, 275 events. 135/275 cut-off events. For 666/666 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 973 event pairs, 14 based on Foata normal form. 1/276 useless extension candidates. Maximal degree in co-relation 1226. Up to 152 conditions per place. [2022-12-13 14:24:37,142 INFO L137 encePairwiseOnDemand]: 241/248 looper letters, 37 selfloop transitions, 10 changer transitions 9/57 dead transitions. [2022-12-13 14:24:37,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 57 transitions, 479 flow [2022-12-13 14:24:37,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:24:37,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 14:24:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 645 transitions. [2022-12-13 14:24:37,144 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4334677419354839 [2022-12-13 14:24:37,144 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 645 transitions. [2022-12-13 14:24:37,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 645 transitions. [2022-12-13 14:24:37,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:37,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 645 transitions. [2022-12-13 14:24:37,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:37,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:37,148 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 248.0) internal successors, (1736), 7 states have internal predecessors, (1736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:37,148 INFO L175 Difference]: Start difference. First operand has 68 places, 35 transitions, 231 flow. Second operand 6 states and 645 transitions. [2022-12-13 14:24:37,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 57 transitions, 479 flow [2022-12-13 14:24:37,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 57 transitions, 426 flow, removed 20 selfloop flow, removed 10 redundant places. [2022-12-13 14:24:37,152 INFO L231 Difference]: Finished difference. Result has 55 places, 37 transitions, 245 flow [2022-12-13 14:24:37,152 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=245, PETRI_PLACES=55, PETRI_TRANSITIONS=37} [2022-12-13 14:24:37,153 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 15 predicate places. [2022-12-13 14:24:37,153 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 37 transitions, 245 flow [2022-12-13 14:24:37,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 103.85714285714286) internal successors, (727), 7 states have internal predecessors, (727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:37,153 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:37,153 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 14:24:37,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 14:24:37,154 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:37,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:37,154 INFO L85 PathProgramCache]: Analyzing trace with hash -35145129, now seen corresponding path program 3 times [2022-12-13 14:24:37,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:37,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150702920] [2022-12-13 14:24:37,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:37,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:37,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 14:24:37,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 14:24:37,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150702920] [2022-12-13 14:24:37,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150702920] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:37,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:37,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:24:37,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068816647] [2022-12-13 14:24:37,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:37,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 14:24:37,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 14:24:37,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:24:37,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:24:37,828 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 248 [2022-12-13 14:24:37,829 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 37 transitions, 245 flow. Second operand has 9 states, 9 states have (on average 109.11111111111111) internal successors, (982), 9 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:37,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:37,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 248 [2022-12-13 14:24:37,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:37,960 INFO L130 PetriNetUnfolder]: 142/296 cut-off events. [2022-12-13 14:24:37,960 INFO L131 PetriNetUnfolder]: For 878/878 co-relation queries the response was YES. [2022-12-13 14:24:37,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1333 conditions, 296 events. 142/296 cut-off events. For 878/878 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1116 event pairs, 34 based on Foata normal form. 1/297 useless extension candidates. Maximal degree in co-relation 1317. Up to 128 conditions per place. [2022-12-13 14:24:37,961 INFO L137 encePairwiseOnDemand]: 243/248 looper letters, 34 selfloop transitions, 5 changer transitions 21/62 dead transitions. [2022-12-13 14:24:37,961 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 62 transitions, 511 flow [2022-12-13 14:24:37,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:24:37,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 14:24:37,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 574 transitions. [2022-12-13 14:24:37,963 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4629032258064516 [2022-12-13 14:24:37,963 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 574 transitions. [2022-12-13 14:24:37,963 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 574 transitions. [2022-12-13 14:24:37,963 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:37,963 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 574 transitions. [2022-12-13 14:24:37,964 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 114.8) internal successors, (574), 5 states have internal predecessors, (574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:37,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:37,965 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 248.0) internal successors, (1488), 6 states have internal predecessors, (1488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:37,965 INFO L175 Difference]: Start difference. First operand has 55 places, 37 transitions, 245 flow. Second operand 5 states and 574 transitions. [2022-12-13 14:24:37,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 62 transitions, 511 flow [2022-12-13 14:24:37,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 62 transitions, 499 flow, removed 3 selfloop flow, removed 3 redundant places. [2022-12-13 14:24:37,967 INFO L231 Difference]: Finished difference. Result has 58 places, 34 transitions, 231 flow [2022-12-13 14:24:37,967 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=248, PETRI_DIFFERENCE_MINUEND_FLOW=235, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=231, PETRI_PLACES=58, PETRI_TRANSITIONS=34} [2022-12-13 14:24:37,968 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 18 predicate places. [2022-12-13 14:24:37,968 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 34 transitions, 231 flow [2022-12-13 14:24:37,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.11111111111111) internal successors, (982), 9 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:37,968 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:37,968 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 14:24:37,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 14:24:37,968 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:37,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:37,969 INFO L85 PathProgramCache]: Analyzing trace with hash 297150041, now seen corresponding path program 4 times [2022-12-13 14:24:37,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 14:24:37,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811598625] [2022-12-13 14:24:37,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:37,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 14:24:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:24:38,007 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:24:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:24:38,068 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 14:24:38,068 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 14:24:38,069 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-13 14:24:38,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-13 14:24:38,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-13 14:24:38,071 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-13 14:24:38,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-13 14:24:38,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-13 14:24:38,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-13 14:24:38,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-13 14:24:38,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-13 14:24:38,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-13 14:24:38,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-13 14:24:38,072 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-13 14:24:38,073 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-13 14:24:38,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 14:24:38,073 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:24:38,078 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 14:24:38,079 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 14:24:38,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:24:38 BasicIcfg [2022-12-13 14:24:38,128 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 14:24:38,129 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 14:24:38,129 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 14:24:38,129 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 14:24:38,129 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:24:23" (3/4) ... [2022-12-13 14:24:38,132 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 14:24:38,132 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 14:24:38,132 INFO L158 Benchmark]: Toolchain (without parser) took 16018.30ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 130.9MB in the beginning and 166.5MB in the end (delta: -35.6MB). Peak memory consumption was 91.4MB. Max. memory is 16.1GB. [2022-12-13 14:24:38,133 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 115.3MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:24:38,133 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.28ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 104.8MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-12-13 14:24:38,133 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.60ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 102.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 14:24:38,133 INFO L158 Benchmark]: Boogie Preprocessor took 29.70ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 100.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:24:38,134 INFO L158 Benchmark]: RCFGBuilder took 566.19ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 125.4MB in the end (delta: -25.3MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. [2022-12-13 14:24:38,134 INFO L158 Benchmark]: TraceAbstraction took 15012.23ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 125.4MB in the beginning and 166.5MB in the end (delta: -41.1MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2022-12-13 14:24:38,134 INFO L158 Benchmark]: Witness Printer took 3.32ms. Allocated memory is still 293.6MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:24:38,136 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.10ms. Allocated memory is still 115.3MB. Free memory is still 88.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.28ms. Allocated memory is still 167.8MB. Free memory was 130.9MB in the beginning and 104.8MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.60ms. Allocated memory is still 167.8MB. Free memory was 104.8MB in the beginning and 102.2MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.70ms. Allocated memory is still 167.8MB. Free memory was 102.2MB in the beginning and 100.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 566.19ms. Allocated memory is still 167.8MB. Free memory was 100.1MB in the beginning and 125.4MB in the end (delta: -25.3MB). Peak memory consumption was 32.2MB. Max. memory is 16.1GB. * TraceAbstraction took 15012.23ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 125.4MB in the beginning and 166.5MB in the end (delta: -41.1MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. * Witness Printer took 3.32ms. Allocated memory is still 293.6MB. Free memory is still 166.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.1s, 130 PlacesBefore, 40 PlacesAfterwards, 122 TransitionsBefore, 30 TransitionsAfterwards, 2302 CoEnabledTransitionPairs, 7 FixpointIterations, 50 TrivialSequentialCompositions, 64 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 123 TotalNumberOfCompositions, 6397 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2952, independent: 2762, independent conditional: 0, independent unconditional: 2762, dependent: 190, dependent conditional: 0, dependent unconditional: 190, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1269, independent: 1224, independent conditional: 0, independent unconditional: 1224, dependent: 45, dependent conditional: 0, dependent unconditional: 45, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2952, independent: 1538, independent conditional: 0, independent unconditional: 1538, dependent: 145, dependent conditional: 0, dependent unconditional: 145, unknown: 1269, unknown conditional: 0, unknown unconditional: 1269] , Statistics on independence cache: Total cache size (in pairs): 99, Positive cache size: 84, Positive conditional cache size: 0, Positive unconditional cache size: 84, Negative cache size: 15, Negative conditional cache size: 0, Negative unconditional cache size: 15, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t2284; [L821] FCALL, FORK 0 pthread_create(&t2284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2284, ((void *)0), P0, ((void *)0))=-2, t2284={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2285; [L823] FCALL, FORK 0 pthread_create(&t2285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2285, ((void *)0), P1, ((void *)0))=-1, t2284={5:0}, t2285={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t2286; [L825] FCALL, FORK 0 pthread_create(&t2286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2286, ((void *)0), P2, ((void *)0))=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2284={5:0}, t2285={6:0}, t2286={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=1, \old(expression)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 152 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.9s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 858 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 637 mSDsluCounter, 293 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 237 mSDsCounter, 191 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1692 IncrementalHoareTripleChecker+Invalid, 1883 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 191 mSolverCounterUnsat, 56 mSDtfsCounter, 1692 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 62 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=469occurred in iteration=8, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 206 NumberOfCodeBlocks, 206 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 170 ConstructedInterpolants, 0 QuantifiedInterpolants, 2569 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 14:24:38,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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_8a0e78ed-dad9-476b-88c6-0009a4370867/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 10a668ec1ea7995e15ba3bf7e664e16993ba1d6d90153ec7cf305acc426b53b6 --- 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 14:24:39,767 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 14:24:39,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 14:24:39,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 14:24:39,787 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 14:24:39,788 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 14:24:39,789 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 14:24:39,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 14:24:39,792 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 14:24:39,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 14:24:39,794 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 14:24:39,795 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 14:24:39,795 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 14:24:39,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 14:24:39,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 14:24:39,798 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 14:24:39,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 14:24:39,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 14:24:39,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 14:24:39,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 14:24:39,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 14:24:39,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 14:24:39,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 14:24:39,806 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 14:24:39,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 14:24:39,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 14:24:39,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 14:24:39,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 14:24:39,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 14:24:39,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 14:24:39,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 14:24:39,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 14:24:39,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 14:24:39,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 14:24:39,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 14:24:39,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 14:24:39,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 14:24:39,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 14:24:39,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 14:24:39,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 14:24:39,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 14:24:39,825 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-12-13 14:24:39,848 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 14:24:39,848 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 14:24:39,848 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 14:24:39,848 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 14:24:39,849 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 14:24:39,849 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 14:24:39,850 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 14:24:39,850 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 14:24:39,850 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 14:24:39,850 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 14:24:39,851 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 14:24:39,851 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 14:24:39,851 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 14:24:39,851 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 14:24:39,851 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 14:24:39,852 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-13 14:24:39,852 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-13 14:24:39,852 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-13 14:24:39,852 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 14:24:39,852 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-13 14:24:39,852 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-12-13 14:24:39,853 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-12-13 14:24:39,853 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 14:24:39,853 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 14:24:39,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 14:24:39,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 14:24:39,854 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 14:24:39,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:24:39,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 14:24:39,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 14:24:39,854 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-12-13 14:24:39,855 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-12-13 14:24:39,855 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 14:24:39,855 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 14:24:39,855 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 14:24:39,855 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-12-13 14:24:39,855 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 14:24:39,856 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_8a0e78ed-dad9-476b-88c6-0009a4370867/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_8a0e78ed-dad9-476b-88c6-0009a4370867/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 -> 10a668ec1ea7995e15ba3bf7e664e16993ba1d6d90153ec7cf305acc426b53b6 [2022-12-13 14:24:40,088 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 14:24:40,104 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 14:24:40,106 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 14:24:40,107 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 14:24:40,107 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 14:24:40,108 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i [2022-12-13 14:24:42,684 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 14:24:42,898 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 14:24:42,899 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i [2022-12-13 14:24:42,911 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/data/71a229220/54f99da101a64d23a61f292e2158c0c2/FLAG780eb6840 [2022-12-13 14:24:42,926 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/data/71a229220/54f99da101a64d23a61f292e2158c0c2 [2022-12-13 14:24:42,928 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 14:24:42,930 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 14:24:42,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 14:24:42,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 14:24:42,934 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 14:24:42,935 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:24:42" (1/1) ... [2022-12-13 14:24:42,936 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18077ae1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:42, skipping insertion in model container [2022-12-13 14:24:42,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 02:24:42" (1/1) ... [2022-12-13 14:24:42,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 14:24:42,977 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 14:24:43,138 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_8a0e78ed-dad9-476b-88c6-0009a4370867/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i[959,972] [2022-12-13 14:24:43,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,295 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,296 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,299 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,300 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,302 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,303 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,305 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,306 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,311 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,312 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,313 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,315 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,316 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,322 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,323 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,325 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,326 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,332 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:24:43,346 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 14:24:43,358 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_8a0e78ed-dad9-476b-88c6-0009a4370867/sv-benchmarks/c/pthread-wmm/safe021_power.opt_pso.opt.i[959,972] [2022-12-13 14:24:43,376 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,377 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,379 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,380 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,381 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,382 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,384 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,385 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,386 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,387 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,388 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,391 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,392 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,393 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,394 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-12-13 14:24:43,397 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-12-13 14:24:43,398 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 14:24:43,433 INFO L208 MainTranslator]: Completed translation [2022-12-13 14:24:43,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:43 WrapperNode [2022-12-13 14:24:43,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 14:24:43,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 14:24:43,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 14:24:43,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 14:24:43,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:43" (1/1) ... [2022-12-13 14:24:43,458 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:43" (1/1) ... [2022-12-13 14:24:43,480 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 144 [2022-12-13 14:24:43,481 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 14:24:43,481 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 14:24:43,482 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 14:24:43,482 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 14:24:43,491 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:43" (1/1) ... [2022-12-13 14:24:43,491 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:43" (1/1) ... [2022-12-13 14:24:43,494 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:43" (1/1) ... [2022-12-13 14:24:43,494 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:43" (1/1) ... [2022-12-13 14:24:43,502 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:43" (1/1) ... [2022-12-13 14:24:43,504 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:43" (1/1) ... [2022-12-13 14:24:43,506 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:43" (1/1) ... [2022-12-13 14:24:43,508 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:43" (1/1) ... [2022-12-13 14:24:43,511 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 14:24:43,512 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 14:24:43,512 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 14:24:43,512 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 14:24:43,513 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:43" (1/1) ... [2022-12-13 14:24:43,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 14:24:43,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 14:24:43,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 14:24:43,541 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 14:24:43,579 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-12-13 14:24:43,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 14:24:43,579 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-13 14:24:43,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-13 14:24:43,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-12-13 14:24:43,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-12-13 14:24:43,580 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-12-13 14:24:43,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-12-13 14:24:43,580 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-12-13 14:24:43,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-12-13 14:24:43,580 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-12-13 14:24:43,580 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-12-13 14:24:43,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-12-13 14:24:43,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 14:24:43,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 14:24:43,582 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 14:24:43,706 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 14:24:43,709 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 14:24:44,013 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 14:24:44,089 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 14:24:44,089 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 14:24:44,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:24:44 BoogieIcfgContainer [2022-12-13 14:24:44,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 14:24:44,092 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 14:24:44,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 14:24:44,095 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 14:24:44,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 02:24:42" (1/3) ... [2022-12-13 14:24:44,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539b9bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:24:44, skipping insertion in model container [2022-12-13 14:24:44,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 02:24:43" (2/3) ... [2022-12-13 14:24:44,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539b9bbc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 02:24:44, skipping insertion in model container [2022-12-13 14:24:44,096 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:24:44" (3/3) ... [2022-12-13 14:24:44,097 INFO L112 eAbstractionObserver]: Analyzing ICFG safe021_power.opt_pso.opt.i [2022-12-13 14:24:44,110 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 14:24:44,110 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-12-13 14:24:44,111 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-13 14:24:44,151 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-12-13 14:24:44,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 134 places, 126 transitions, 267 flow [2022-12-13 14:24:44,217 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-13 14:24:44,217 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:24:44,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-12-13 14:24:44,222 INFO L82 GeneralOperation]: Start removeDead. Operand has 134 places, 126 transitions, 267 flow [2022-12-13 14:24:44,225 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 131 places, 123 transitions, 255 flow [2022-12-13 14:24:44,228 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2022-12-13 14:24:44,236 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 131 places, 123 transitions, 255 flow [2022-12-13 14:24:44,238 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 131 places, 123 transitions, 255 flow [2022-12-13 14:24:44,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 255 flow [2022-12-13 14:24:44,258 INFO L130 PetriNetUnfolder]: 2/123 cut-off events. [2022-12-13 14:24:44,258 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:24:44,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 133 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 80 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 80. Up to 2 conditions per place. [2022-12-13 14:24:44,259 INFO L119 LiptonReduction]: Number of co-enabled transitions 2302 [2022-12-13 14:24:52,194 INFO L134 LiptonReduction]: Checked pairs total: 5968 [2022-12-13 14:24:52,194 INFO L136 LiptonReduction]: Total number of compositions: 128 [2022-12-13 14:24:52,208 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 14:24:52,214 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;@37c285ed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 14:24:52,214 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-12-13 14:24:52,215 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-12-13 14:24:52,215 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:24:52,216 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:52,216 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-12-13 14:24:52,217 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:52,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:52,222 INFO L85 PathProgramCache]: Analyzing trace with hash 545, now seen corresponding path program 1 times [2022-12-13 14:24:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:24:52,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659846479] [2022-12-13 14:24:52,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:52,237 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 14:24:52,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:24:52,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:52,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:52,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-12-13 14:24:52,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:24:52,288 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 14:24:52,288 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:24:52,288 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:24:52,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659846479] [2022-12-13 14:24:52,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659846479] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:52,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:52,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-12-13 14:24:52,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052739911] [2022-12-13 14:24:52,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:52,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-12-13 14:24:52,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:24:52,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-12-13 14:24:52,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-12-13 14:24:52,314 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 254 [2022-12-13 14:24:52,315 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 30 transitions, 69 flow. Second operand has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:52,316 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:52,316 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 254 [2022-12-13 14:24:52,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:52,696 INFO L130 PetriNetUnfolder]: 1093/1642 cut-off events. [2022-12-13 14:24:52,697 INFO L131 PetriNetUnfolder]: For 9/9 co-relation queries the response was YES. [2022-12-13 14:24:52,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3319 conditions, 1642 events. 1093/1642 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 7710 event pairs, 1093 based on Foata normal form. 0/1353 useless extension candidates. Maximal degree in co-relation 3308. Up to 1623 conditions per place. [2022-12-13 14:24:52,705 INFO L137 encePairwiseOnDemand]: 248/254 looper letters, 21 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2022-12-13 14:24:52,705 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 99 flow [2022-12-13 14:24:52,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-12-13 14:24:52,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-12-13 14:24:52,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 253 transitions. [2022-12-13 14:24:52,715 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49803149606299213 [2022-12-13 14:24:52,716 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 253 transitions. [2022-12-13 14:24:52,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 253 transitions. [2022-12-13 14:24:52,717 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:52,719 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 253 transitions. [2022-12-13 14:24:52,720 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 126.5) internal successors, (253), 2 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:52,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:52,724 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 254.0) internal successors, (762), 3 states have internal predecessors, (762), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:52,726 INFO L175 Difference]: Start difference. First operand has 40 places, 30 transitions, 69 flow. Second operand 2 states and 253 transitions. [2022-12-13 14:24:52,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 99 flow [2022-12-13 14:24:52,728 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-12-13 14:24:52,729 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2022-12-13 14:24:52,730 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=54, PETRI_PLACES=32, PETRI_TRANSITIONS=24} [2022-12-13 14:24:52,733 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2022-12-13 14:24:52,733 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2022-12-13 14:24:52,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 113.5) internal successors, (227), 2 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:52,734 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:52,734 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2022-12-13 14:24:52,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:52,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:52,935 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:52,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:52,936 INFO L85 PathProgramCache]: Analyzing trace with hash 517197609, now seen corresponding path program 1 times [2022-12-13 14:24:52,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:24:52,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452820567] [2022-12-13 14:24:52,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:52,938 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 14:24:52,938 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:24:52,939 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:52,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:53,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 14:24:53,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:24:53,097 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 14:24:53,097 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:24:53,097 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:24:53,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452820567] [2022-12-13 14:24:53,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452820567] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:53,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:53,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-13 14:24:53,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962253968] [2022-12-13 14:24:53,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:53,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 14:24:53,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:24:53,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 14:24:53,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 14:24:53,103 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 254 [2022-12-13 14:24:53,104 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:53,104 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:53,104 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 254 [2022-12-13 14:24:53,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:53,407 INFO L130 PetriNetUnfolder]: 855/1341 cut-off events. [2022-12-13 14:24:53,408 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-12-13 14:24:53,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 1341 events. 855/1341 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 6448 event pairs, 237 based on Foata normal form. 0/1208 useless extension candidates. Maximal degree in co-relation 2663. Up to 1027 conditions per place. [2022-12-13 14:24:53,415 INFO L137 encePairwiseOnDemand]: 251/254 looper letters, 29 selfloop transitions, 2 changer transitions 2/36 dead transitions. [2022-12-13 14:24:53,415 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 36 transitions, 146 flow [2022-12-13 14:24:53,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 14:24:53,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-12-13 14:24:53,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2022-12-13 14:24:53,418 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48556430446194226 [2022-12-13 14:24:53,418 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2022-12-13 14:24:53,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2022-12-13 14:24:53,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:53,419 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2022-12-13 14:24:53,420 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:53,422 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:53,423 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 254.0) internal successors, (1016), 4 states have internal predecessors, (1016), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:53,423 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 370 transitions. [2022-12-13 14:24:53,423 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 36 transitions, 146 flow [2022-12-13 14:24:53,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 36 transitions, 146 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-12-13 14:24:53,424 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2022-12-13 14:24:53,425 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=52, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=33, PETRI_TRANSITIONS=22} [2022-12-13 14:24:53,425 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2022-12-13 14:24:53,426 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2022-12-13 14:24:53,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:53,426 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:53,426 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:24:53,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:53,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:53,627 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:53,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:53,627 INFO L85 PathProgramCache]: Analyzing trace with hash -387794643, now seen corresponding path program 1 times [2022-12-13 14:24:53,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:24:53,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092405918] [2022-12-13 14:24:53,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:53,628 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 14:24:53,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:24:53,629 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:53,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:53,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 5 conjunts are in the unsatisfiable core [2022-12-13 14:24:53,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:24:53,744 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 14:24:53,744 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:24:53,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:24:53,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092405918] [2022-12-13 14:24:53,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092405918] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:53,745 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:53,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:24:53,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810285131] [2022-12-13 14:24:53,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:53,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:24:53,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:24:53,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:24:53,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:24:53,762 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 254 [2022-12-13 14:24:53,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:53,763 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:53,763 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 254 [2022-12-13 14:24:53,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:53,985 INFO L130 PetriNetUnfolder]: 494/827 cut-off events. [2022-12-13 14:24:53,985 INFO L131 PetriNetUnfolder]: For 65/65 co-relation queries the response was YES. [2022-12-13 14:24:53,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1753 conditions, 827 events. 494/827 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 3864 event pairs, 102 based on Foata normal form. 64/850 useless extension candidates. Maximal degree in co-relation 1749. Up to 533 conditions per place. [2022-12-13 14:24:53,988 INFO L137 encePairwiseOnDemand]: 248/254 looper letters, 28 selfloop transitions, 4 changer transitions 19/54 dead transitions. [2022-12-13 14:24:53,988 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 54 transitions, 230 flow [2022-12-13 14:24:53,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:24:53,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 14:24:53,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 593 transitions. [2022-12-13 14:24:53,990 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.46692913385826773 [2022-12-13 14:24:53,991 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 593 transitions. [2022-12-13 14:24:53,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 593 transitions. [2022-12-13 14:24:53,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:53,991 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 593 transitions. [2022-12-13 14:24:53,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 118.6) internal successors, (593), 5 states have internal predecessors, (593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:53,995 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:53,995 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:53,995 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 593 transitions. [2022-12-13 14:24:53,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 54 transitions, 230 flow [2022-12-13 14:24:53,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 14:24:53,997 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 86 flow [2022-12-13 14:24:53,997 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=86, PETRI_PLACES=37, PETRI_TRANSITIONS=25} [2022-12-13 14:24:53,997 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-12-13 14:24:53,998 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 86 flow [2022-12-13 14:24:53,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.25) internal successors, (441), 4 states have internal predecessors, (441), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:53,998 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:53,998 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 14:24:54,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:54,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:54,199 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:54,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:54,200 INFO L85 PathProgramCache]: Analyzing trace with hash -1353686055, now seen corresponding path program 1 times [2022-12-13 14:24:54,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:24:54,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039987727] [2022-12-13 14:24:54,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:54,202 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 14:24:54,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:24:54,204 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:54,206 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:54,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 14:24:54,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:24:54,348 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 14:24:54,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:24:54,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:24:54,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039987727] [2022-12-13 14:24:54,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039987727] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:54,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:54,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-13 14:24:54,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406116913] [2022-12-13 14:24:54,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:54,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:24:54,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:24:54,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:24:54,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:24:54,368 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 254 [2022-12-13 14:24:54,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:54,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:54,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 254 [2022-12-13 14:24:54,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:54,591 INFO L130 PetriNetUnfolder]: 224/419 cut-off events. [2022-12-13 14:24:54,591 INFO L131 PetriNetUnfolder]: For 139/139 co-relation queries the response was YES. [2022-12-13 14:24:54,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1130 conditions, 419 events. 224/419 cut-off events. For 139/139 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1805 event pairs, 60 based on Foata normal form. 37/441 useless extension candidates. Maximal degree in co-relation 1123. Up to 137 conditions per place. [2022-12-13 14:24:54,593 INFO L137 encePairwiseOnDemand]: 248/254 looper letters, 36 selfloop transitions, 7 changer transitions 19/65 dead transitions. [2022-12-13 14:24:54,593 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 65 transitions, 334 flow [2022-12-13 14:24:54,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-13 14:24:54,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-13 14:24:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2022-12-13 14:24:54,596 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4671916010498688 [2022-12-13 14:24:54,596 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 712 transitions. [2022-12-13 14:24:54,596 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 712 transitions. [2022-12-13 14:24:54,597 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:54,597 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 712 transitions. [2022-12-13 14:24:54,599 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 118.66666666666667) internal successors, (712), 6 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:54,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:54,603 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 254.0) internal successors, (1778), 7 states have internal predecessors, (1778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:54,603 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 86 flow. Second operand 6 states and 712 transitions. [2022-12-13 14:24:54,604 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 65 transitions, 334 flow [2022-12-13 14:24:54,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 65 transitions, 328 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-12-13 14:24:54,606 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 136 flow [2022-12-13 14:24:54,606 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=136, PETRI_PLACES=41, PETRI_TRANSITIONS=28} [2022-12-13 14:24:54,607 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2022-12-13 14:24:54,607 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 136 flow [2022-12-13 14:24:54,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 110.4) internal successors, (552), 5 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:54,608 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:54,608 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 14:24:54,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:54,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:54,809 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:54,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:54,809 INFO L85 PathProgramCache]: Analyzing trace with hash -459907916, now seen corresponding path program 1 times [2022-12-13 14:24:54,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:24:54,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [87902301] [2022-12-13 14:24:54,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:54,810 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 14:24:54,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:24:54,811 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:54,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:55,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-13 14:24:55,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:24:55,052 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 14:24:55,053 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:24:55,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:24:55,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [87902301] [2022-12-13 14:24:55,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [87902301] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:55,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:55,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 14:24:55,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880675927] [2022-12-13 14:24:55,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:55,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-13 14:24:55,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:24:55,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-13 14:24:55,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-13 14:24:55,075 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 254 [2022-12-13 14:24:55,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:55,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:55,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 254 [2022-12-13 14:24:55,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:55,314 INFO L130 PetriNetUnfolder]: 143/275 cut-off events. [2022-12-13 14:24:55,315 INFO L131 PetriNetUnfolder]: For 272/272 co-relation queries the response was YES. [2022-12-13 14:24:55,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 275 events. 143/275 cut-off events. For 272/272 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1063 event pairs, 56 based on Foata normal form. 10/279 useless extension candidates. Maximal degree in co-relation 798. Up to 108 conditions per place. [2022-12-13 14:24:55,316 INFO L137 encePairwiseOnDemand]: 248/254 looper letters, 33 selfloop transitions, 10 changer transitions 10/56 dead transitions. [2022-12-13 14:24:55,316 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 56 transitions, 332 flow [2022-12-13 14:24:55,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-13 14:24:55,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-13 14:24:55,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 811 transitions. [2022-12-13 14:24:55,318 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4561304836895388 [2022-12-13 14:24:55,318 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 811 transitions. [2022-12-13 14:24:55,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 811 transitions. [2022-12-13 14:24:55,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:55,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 811 transitions. [2022-12-13 14:24:55,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 115.85714285714286) internal successors, (811), 7 states have internal predecessors, (811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:55,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:55,325 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 254.0) internal successors, (2032), 8 states have internal predecessors, (2032), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:55,325 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 136 flow. Second operand 7 states and 811 transitions. [2022-12-13 14:24:55,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 56 transitions, 332 flow [2022-12-13 14:24:55,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 56 transitions, 296 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-12-13 14:24:55,329 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 138 flow [2022-12-13 14:24:55,329 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=138, PETRI_PLACES=44, PETRI_TRANSITIONS=28} [2022-12-13 14:24:55,330 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2022-12-13 14:24:55,330 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 138 flow [2022-12-13 14:24:55,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:55,330 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:55,331 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 14:24:55,338 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:55,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:55,531 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:55,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:55,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1430470494, now seen corresponding path program 1 times [2022-12-13 14:24:55,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:24:55,532 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831906342] [2022-12-13 14:24:55,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:55,532 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 14:24:55,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:24:55,533 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:55,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:55,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:55,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 14:24:55,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:24:55,640 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 14:24:55,640 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:24:55,640 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:24:55,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831906342] [2022-12-13 14:24:55,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831906342] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:55,640 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:55,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:24:55,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356809776] [2022-12-13 14:24:55,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:55,641 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:24:55,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:24:55,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:24:55,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:24:55,645 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 254 [2022-12-13 14:24:55,646 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 138 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:55,646 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:55,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 254 [2022-12-13 14:24:55,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:55,790 INFO L130 PetriNetUnfolder]: 198/379 cut-off events. [2022-12-13 14:24:55,790 INFO L131 PetriNetUnfolder]: For 397/397 co-relation queries the response was YES. [2022-12-13 14:24:55,791 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1102 conditions, 379 events. 198/379 cut-off events. For 397/397 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1605 event pairs, 38 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 1092. Up to 223 conditions per place. [2022-12-13 14:24:55,793 INFO L137 encePairwiseOnDemand]: 251/254 looper letters, 53 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2022-12-13 14:24:55,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 404 flow [2022-12-13 14:24:55,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:24:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 14:24:55,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2022-12-13 14:24:55,795 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4704724409448819 [2022-12-13 14:24:55,795 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 478 transitions. [2022-12-13 14:24:55,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 478 transitions. [2022-12-13 14:24:55,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:55,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 478 transitions. [2022-12-13 14:24:55,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 119.5) internal successors, (478), 4 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:55,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:55,797 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:55,797 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 138 flow. Second operand 4 states and 478 transitions. [2022-12-13 14:24:55,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 404 flow [2022-12-13 14:24:55,801 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 57 transitions, 324 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-12-13 14:24:55,802 INFO L231 Difference]: Finished difference. Result has 41 places, 29 transitions, 113 flow [2022-12-13 14:24:55,802 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=113, PETRI_PLACES=41, PETRI_TRANSITIONS=29} [2022-12-13 14:24:55,803 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2022-12-13 14:24:55,803 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 29 transitions, 113 flow [2022-12-13 14:24:55,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:55,804 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:55,804 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 14:24:55,812 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:56,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:56,010 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:56,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:56,011 INFO L85 PathProgramCache]: Analyzing trace with hash 577054126, now seen corresponding path program 2 times [2022-12-13 14:24:56,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:24:56,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378503866] [2022-12-13 14:24:56,013 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 14:24:56,014 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 14:24:56,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:24:56,017 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:56,020 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:56,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-12-13 14:24:56,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:24:56,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-13 14:24:56,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:24:56,153 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 14:24:56,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:24:56,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:24:56,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378503866] [2022-12-13 14:24:56,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378503866] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:56,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:56,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 14:24:56,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425105704] [2022-12-13 14:24:56,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:56,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-13 14:24:56,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:24:56,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-13 14:24:56,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-13 14:24:56,161 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 254 [2022-12-13 14:24:56,161 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 29 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:56,161 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:56,162 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 254 [2022-12-13 14:24:56,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:56,302 INFO L130 PetriNetUnfolder]: 298/574 cut-off events. [2022-12-13 14:24:56,302 INFO L131 PetriNetUnfolder]: For 467/467 co-relation queries the response was YES. [2022-12-13 14:24:56,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 574 events. 298/574 cut-off events. For 467/467 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 2777 event pairs, 87 based on Foata normal form. 1/572 useless extension candidates. Maximal degree in co-relation 1608. Up to 246 conditions per place. [2022-12-13 14:24:56,305 INFO L137 encePairwiseOnDemand]: 250/254 looper letters, 49 selfloop transitions, 3 changer transitions 0/55 dead transitions. [2022-12-13 14:24:56,305 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 55 transitions, 329 flow [2022-12-13 14:24:56,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-13 14:24:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-13 14:24:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 475 transitions. [2022-12-13 14:24:56,307 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4675196850393701 [2022-12-13 14:24:56,307 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 475 transitions. [2022-12-13 14:24:56,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 475 transitions. [2022-12-13 14:24:56,308 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:56,308 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 475 transitions. [2022-12-13 14:24:56,309 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.75) internal successors, (475), 4 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:56,310 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:56,311 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 254.0) internal successors, (1270), 5 states have internal predecessors, (1270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:56,311 INFO L175 Difference]: Start difference. First operand has 41 places, 29 transitions, 113 flow. Second operand 4 states and 475 transitions. [2022-12-13 14:24:56,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 55 transitions, 329 flow [2022-12-13 14:24:56,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 55 transitions, 326 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-12-13 14:24:56,314 INFO L231 Difference]: Finished difference. Result has 44 places, 30 transitions, 126 flow [2022-12-13 14:24:56,315 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=126, PETRI_PLACES=44, PETRI_TRANSITIONS=30} [2022-12-13 14:24:56,315 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2022-12-13 14:24:56,315 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 30 transitions, 126 flow [2022-12-13 14:24:56,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.75) internal successors, (455), 4 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:56,316 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:56,316 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 14:24:56,328 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-12-13 14:24:56,516 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:56,516 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:56,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:56,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1440029738, now seen corresponding path program 1 times [2022-12-13 14:24:56,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:24:56,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1354878261] [2022-12-13 14:24:56,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 14:24:56,518 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 14:24:56,518 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:24:56,519 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:56,519 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 14:24:56,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-13 14:24:56,643 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:24:56,937 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 14:24:56,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:24:56,937 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:24:56,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1354878261] [2022-12-13 14:24:56,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1354878261] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:56,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:56,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 14:24:56,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070333721] [2022-12-13 14:24:56,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:56,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 14:24:56,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:24:56,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 14:24:56,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 14:24:57,191 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 254 [2022-12-13 14:24:57,192 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 30 transitions, 126 flow. Second operand has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:57,192 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:57,192 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 254 [2022-12-13 14:24:57,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:57,409 INFO L130 PetriNetUnfolder]: 251/493 cut-off events. [2022-12-13 14:24:57,409 INFO L131 PetriNetUnfolder]: For 327/327 co-relation queries the response was YES. [2022-12-13 14:24:57,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1441 conditions, 493 events. 251/493 cut-off events. For 327/327 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2316 event pairs, 101 based on Foata normal form. 4/494 useless extension candidates. Maximal degree in co-relation 1431. Up to 424 conditions per place. [2022-12-13 14:24:57,411 INFO L137 encePairwiseOnDemand]: 250/254 looper letters, 24 selfloop transitions, 3 changer transitions 10/40 dead transitions. [2022-12-13 14:24:57,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 40 transitions, 242 flow [2022-12-13 14:24:57,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:24:57,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 14:24:57,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 513 transitions. [2022-12-13 14:24:57,417 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.40393700787401576 [2022-12-13 14:24:57,417 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 513 transitions. [2022-12-13 14:24:57,417 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 513 transitions. [2022-12-13 14:24:57,417 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:57,417 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 513 transitions. [2022-12-13 14:24:57,418 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 102.6) internal successors, (513), 5 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:57,419 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:57,419 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:57,419 INFO L175 Difference]: Start difference. First operand has 44 places, 30 transitions, 126 flow. Second operand 5 states and 513 transitions. [2022-12-13 14:24:57,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 40 transitions, 242 flow [2022-12-13 14:24:57,421 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 40 transitions, 238 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-12-13 14:24:57,422 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 116 flow [2022-12-13 14:24:57,422 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=116, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2022-12-13 14:24:57,423 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2022-12-13 14:24:57,423 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 116 flow [2022-12-13 14:24:57,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 100.6) internal successors, (503), 5 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:57,423 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:57,423 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 14:24:57,431 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:57,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:57,625 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:57,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:57,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1282562484, now seen corresponding path program 3 times [2022-12-13 14:24:57,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:24:57,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370183708] [2022-12-13 14:24:57,629 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 14:24:57,630 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 14:24:57,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:24:57,633 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:57,636 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:57,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-12-13 14:24:57,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 14:24:57,762 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 14:24:57,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 14:24:58,059 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 14:24:58,059 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-13 14:24:58,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-12-13 14:24:58,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370183708] [2022-12-13 14:24:58,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370183708] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 14:24:58,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 14:24:58,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-12-13 14:24:58,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780180243] [2022-12-13 14:24:58,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 14:24:58,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-12-13 14:24:58,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-12-13 14:24:58,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-12-13 14:24:58,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-13 14:24:58,127 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 254 [2022-12-13 14:24:58,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 27 transitions, 116 flow. Second operand has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:58,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-13 14:24:58,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 254 [2022-12-13 14:24:58,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-13 14:24:58,300 INFO L130 PetriNetUnfolder]: 193/384 cut-off events. [2022-12-13 14:24:58,300 INFO L131 PetriNetUnfolder]: For 283/283 co-relation queries the response was YES. [2022-12-13 14:24:58,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1156 conditions, 384 events. 193/384 cut-off events. For 283/283 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1614 event pairs, 42 based on Foata normal form. 1/384 useless extension candidates. Maximal degree in co-relation 1146. Up to 178 conditions per place. [2022-12-13 14:24:58,301 INFO L137 encePairwiseOnDemand]: 249/254 looper letters, 30 selfloop transitions, 3 changer transitions 22/57 dead transitions. [2022-12-13 14:24:58,301 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 57 transitions, 356 flow [2022-12-13 14:24:58,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 14:24:58,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-13 14:24:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 582 transitions. [2022-12-13 14:24:58,303 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4582677165354331 [2022-12-13 14:24:58,303 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 582 transitions. [2022-12-13 14:24:58,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 582 transitions. [2022-12-13 14:24:58,303 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 14:24:58,303 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 582 transitions. [2022-12-13 14:24:58,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:58,305 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:58,305 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:58,305 INFO L175 Difference]: Start difference. First operand has 45 places, 27 transitions, 116 flow. Second operand 5 states and 582 transitions. [2022-12-13 14:24:58,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 57 transitions, 356 flow [2022-12-13 14:24:58,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 339 flow, removed 2 selfloop flow, removed 5 redundant places. [2022-12-13 14:24:58,307 INFO L231 Difference]: Finished difference. Result has 45 places, 27 transitions, 118 flow [2022-12-13 14:24:58,307 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=254, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=118, PETRI_PLACES=45, PETRI_TRANSITIONS=27} [2022-12-13 14:24:58,307 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2022-12-13 14:24:58,307 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 27 transitions, 118 flow [2022-12-13 14:24:58,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.11111111111111) internal successors, (991), 9 states have internal predecessors, (991), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 14:24:58,308 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-12-13 14:24:58,308 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 14:24:58,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:58,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:58,509 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-12-13 14:24:58,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 14:24:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1965768818, now seen corresponding path program 4 times [2022-12-13 14:24:58,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-12-13 14:24:58,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491499982] [2022-12-13 14:24:58,512 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 14:24:58,512 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-12-13 14:24:58,512 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/mathsat [2022-12-13 14:24:58,515 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:58,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:58,630 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 14:24:58,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-12-13 14:24:58,631 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 14:24:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 14:24:58,738 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-12-13 14:24:58,738 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-13 14:24:58,739 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-12-13 14:24:58,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-12-13 14:24:58,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-12-13 14:24:58,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-12-13 14:24:58,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-12-13 14:24:58,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-12-13 14:24:58,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-12-13 14:24:58,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-12-13 14:24:58,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-12-13 14:24:58,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-12-13 14:24:58,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-12-13 14:24:58,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-12-13 14:24:58,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-12-13 14:24:58,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:58,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/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 14:24:58,944 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1] [2022-12-13 14:24:58,963 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-13 14:24:58,964 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 14:24:59,042 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 02:24:59 BasicIcfg [2022-12-13 14:24:59,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 14:24:59,043 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 14:24:59,043 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 14:24:59,043 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 14:24:59,044 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 02:24:44" (3/4) ... [2022-12-13 14:24:59,046 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-12-13 14:24:59,046 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 14:24:59,047 INFO L158 Benchmark]: Toolchain (without parser) took 16116.87ms. Allocated memory was 73.4MB in the beginning and 159.4MB in the end (delta: 86.0MB). Free memory was 50.9MB in the beginning and 74.1MB in the end (delta: -23.2MB). Peak memory consumption was 61.8MB. Max. memory is 16.1GB. [2022-12-13 14:24:59,047 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory is still 35.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:24:59,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 503.33ms. Allocated memory is still 73.4MB. Free memory was 50.7MB in the beginning and 40.7MB in the end (delta: 10.0MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. [2022-12-13 14:24:59,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.08ms. Allocated memory is still 73.4MB. Free memory was 40.7MB in the beginning and 37.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:24:59,048 INFO L158 Benchmark]: Boogie Preprocessor took 30.00ms. Allocated memory is still 73.4MB. Free memory was 37.9MB in the beginning and 35.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 14:24:59,048 INFO L158 Benchmark]: RCFGBuilder took 578.92ms. Allocated memory is still 73.4MB. Free memory was 35.8MB in the beginning and 35.6MB in the end (delta: 166.3kB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. [2022-12-13 14:24:59,049 INFO L158 Benchmark]: TraceAbstraction took 14950.28ms. Allocated memory was 73.4MB in the beginning and 159.4MB in the end (delta: 86.0MB). Free memory was 35.1MB in the beginning and 74.1MB in the end (delta: -38.9MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2022-12-13 14:24:59,049 INFO L158 Benchmark]: Witness Printer took 2.91ms. Allocated memory is still 159.4MB. Free memory is still 74.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 14:24:59,051 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.16ms. Allocated memory is still 56.6MB. Free memory is still 35.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 503.33ms. Allocated memory is still 73.4MB. Free memory was 50.7MB in the beginning and 40.7MB in the end (delta: 10.0MB). Peak memory consumption was 16.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.08ms. Allocated memory is still 73.4MB. Free memory was 40.7MB in the beginning and 37.9MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.00ms. Allocated memory is still 73.4MB. Free memory was 37.9MB in the beginning and 35.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 578.92ms. Allocated memory is still 73.4MB. Free memory was 35.8MB in the beginning and 35.6MB in the end (delta: 166.3kB). Peak memory consumption was 10.9MB. Max. memory is 16.1GB. * TraceAbstraction took 14950.28ms. Allocated memory was 73.4MB in the beginning and 159.4MB in the end (delta: 86.0MB). Free memory was 35.1MB in the beginning and 74.1MB in the end (delta: -38.9MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. * Witness Printer took 2.91ms. Allocated memory is still 159.4MB. Free memory is still 74.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: 8.0s, 131 PlacesBefore, 40 PlacesAfterwards, 123 TransitionsBefore, 30 TransitionsAfterwards, 2302 CoEnabledTransitionPairs, 6 FixpointIterations, 53 TrivialSequentialCompositions, 66 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 2 ChoiceCompositions, 128 TotalNumberOfCompositions, 5968 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2821, independent: 2657, independent conditional: 0, independent unconditional: 2657, dependent: 164, dependent conditional: 0, dependent unconditional: 164, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1288, independent: 1233, independent conditional: 0, independent unconditional: 1233, dependent: 55, dependent conditional: 0, dependent unconditional: 55, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2821, independent: 1424, independent conditional: 0, independent unconditional: 1424, dependent: 109, dependent conditional: 0, dependent unconditional: 109, unknown: 1288, unknown conditional: 0, unknown unconditional: 1288] , Statistics on independence cache: Total cache size (in pairs): 106, Positive cache size: 86, Positive conditional cache size: 0, Positive unconditional cache size: 86, Negative cache size: 20, Negative conditional cache size: 0, Negative unconditional cache size: 20, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L718] 0 _Bool x$flush_delayed; [L719] 0 int x$mem_tmp; [L720] 0 _Bool x$r_buff0_thd0; [L721] 0 _Bool x$r_buff0_thd1; [L722] 0 _Bool x$r_buff0_thd2; [L723] 0 _Bool x$r_buff0_thd3; [L724] 0 _Bool x$r_buff1_thd0; [L725] 0 _Bool x$r_buff1_thd1; [L726] 0 _Bool x$r_buff1_thd2; [L727] 0 _Bool x$r_buff1_thd3; [L728] 0 _Bool x$read_delayed; [L729] 0 int *x$read_delayed_var; [L730] 0 int x$w_buff0; [L731] 0 _Bool x$w_buff0_used; [L732] 0 int x$w_buff1; [L733] 0 _Bool x$w_buff1_used; [L735] 0 int y = 0; [L737] 0 int z = 0; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L820] 0 pthread_t t2284; [L821] FCALL, FORK 0 pthread_create(&t2284, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2284, ((void *)0), P0, ((void *)0))=0, t2284={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L822] 0 pthread_t t2285; [L823] FCALL, FORK 0 pthread_create(&t2285, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2285, ((void *)0), P1, ((void *)0))=1, t2284={3:0}, t2285={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L824] 0 pthread_t t2286; [L825] FCALL, FORK 0 pthread_create(&t2286, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2286, ((void *)0), P2, ((void *)0))=2, t2284={3:0}, t2285={7:0}, t2286={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L763] 2 x$w_buff1 = x$w_buff0 [L764] 2 x$w_buff0 = 2 [L765] 2 x$w_buff1_used = x$w_buff0_used [L766] 2 x$w_buff0_used = (_Bool)1 [L767] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L767] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L792] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L795] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L749] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L750] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L751] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L752] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L753] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L798] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L799] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L800] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L801] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L802] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L779] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L780] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L781] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L782] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L807] 3 return 0; [L827] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L829] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L829] RET 0 assume_abort_if_not(main$tmp_guard0) [L831] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L832] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L833] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L834] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L835] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2284={3:0}, t2285={7:0}, t2286={11:0}, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L838] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L839] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L840] 0 x$flush_delayed = weak$$choice2 [L841] 0 x$mem_tmp = x [L842] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L843] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L844] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L845] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L846] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L847] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L848] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L849] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L850] 0 x = x$flush_delayed ? x$mem_tmp : x [L851] 0 x$flush_delayed = (_Bool)0 [L853] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 823]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 825]: 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: 821]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 153 locations, 13 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 14.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 352 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 269 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 87 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1011 IncrementalHoareTripleChecker+Invalid, 1097 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 51 mSDtfsCounter, 1011 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=138occurred in iteration=5, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 150 NumberOfCodeBlocks, 150 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 120 ConstructedInterpolants, 15 QuantifiedInterpolants, 1243 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1139 ConjunctsInSsa, 70 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-12-13 14:24:59,068 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a0e78ed-dad9-476b-88c6-0009a4370867/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample