./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:56:23,092 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:56:23,094 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:56:23,116 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:56:23,116 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:56:23,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:56:23,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:56:23,121 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:56:23,124 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:56:23,125 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:56:23,126 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:56:23,128 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:56:23,128 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:56:23,130 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:56:23,131 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:56:23,132 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:56:23,133 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:56:23,134 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:56:23,136 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:56:23,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:56:23,140 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:56:23,142 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:56:23,143 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:56:23,144 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:56:23,148 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:56:23,149 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:56:23,149 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:56:23,150 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:56:23,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:56:23,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:56:23,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:56:23,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:56:23,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:56:23,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:56:23,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:56:23,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:56:23,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:56:23,158 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:56:23,158 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:56:23,159 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:56:23,160 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:56:23,167 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-11-25 16:56:23,200 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:56:23,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:56:23,202 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:56:23,202 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:56:23,203 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:56:23,203 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:56:23,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:56:23,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:56:23,204 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:56:23,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:56:23,205 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:56:23,206 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:56:23,206 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:56:23,206 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:56:23,206 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:56:23,206 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 16:56:23,207 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 16:56:23,207 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 16:56:23,207 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:56:23,207 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 16:56:23,207 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:56:23,207 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:56:23,208 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:56:23,208 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:56:23,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:56:23,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:56:23,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:56:23,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:56:23,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:56:23,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:56:23,210 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:56:23,210 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:56:23,210 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:56:23,210 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_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2022-11-25 16:56:23,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:56:23,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:56:23,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:56:23,604 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:56:23,605 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:56:23,607 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-11-25 16:56:26,884 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:56:27,295 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:56:27,296 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-11-25 16:56:27,318 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/data/9332ec424/71fd16b67e3d46ebbbdc2b2554b39278/FLAG604406b39 [2022-11-25 16:56:27,341 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/data/9332ec424/71fd16b67e3d46ebbbdc2b2554b39278 [2022-11-25 16:56:27,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:56:27,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:56:27,354 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:56:27,354 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:56:27,359 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:56:27,360 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:56:27" (1/1) ... [2022-11-25 16:56:27,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39838278 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:56:27, skipping insertion in model container [2022-11-25 16:56:27,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:56:27" (1/1) ... [2022-11-25 16:56:27,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:56:27,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:56:27,696 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_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-25 16:56:27,935 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:27,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:27,936 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:27,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:27,937 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:27,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:27,938 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:27,939 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:27,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:27,940 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:27,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:27,941 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:27,942 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:27,946 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:27,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:27,947 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:27,948 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:27,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:27,951 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:27,952 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:27,953 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:27,964 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:27,965 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:27,966 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:27,981 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:27,985 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:27,990 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:27,993 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:27,994 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,009 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:56:28,029 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:56:28,047 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_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-25 16:56:28,095 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,099 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,107 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,108 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,109 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,122 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,127 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,130 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,131 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,134 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,138 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,139 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,145 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,148 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,150 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,154 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:56:28,160 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:56:28,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:56:28,204 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:56:28,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:56:28 WrapperNode [2022-11-25 16:56:28,205 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:56:28,206 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:56:28,206 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:56:28,206 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:56:28,214 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:56:28" (1/1) ... [2022-11-25 16:56:28,229 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:56:28" (1/1) ... [2022-11-25 16:56:28,257 INFO L138 Inliner]: procedures = 176, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2022-11-25 16:56:28,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:56:28,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:56:28,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:56:28,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:56:28,271 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:56:28" (1/1) ... [2022-11-25 16:56:28,272 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:56:28" (1/1) ... [2022-11-25 16:56:28,280 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:56:28" (1/1) ... [2022-11-25 16:56:28,281 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:56:28" (1/1) ... [2022-11-25 16:56:28,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:56:28" (1/1) ... [2022-11-25 16:56:28,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:56:28" (1/1) ... [2022-11-25 16:56:28,299 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:56:28" (1/1) ... [2022-11-25 16:56:28,300 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:56:28" (1/1) ... [2022-11-25 16:56:28,303 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:56:28,305 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:56:28,305 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:56:28,305 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:56:28,306 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:56:28" (1/1) ... [2022-11-25 16:56:28,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:56:28,333 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:56:28,346 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:56:28,370 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:56:28,385 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:56:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 16:56:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:56:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:56:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:56:28,386 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 16:56:28,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 16:56:28,387 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 16:56:28,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 16:56:28,387 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 16:56:28,387 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 16:56:28,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:56:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 16:56:28,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:56:28,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:56:28,390 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 16:56:28,566 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:56:28,568 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:56:29,008 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:56:29,214 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:56:29,215 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:56:29,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:56:29 BoogieIcfgContainer [2022-11-25 16:56:29,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:56:29,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:56:29,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:56:29,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:56:29,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:56:27" (1/3) ... [2022-11-25 16:56:29,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe5bcea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:56:29, skipping insertion in model container [2022-11-25 16:56:29,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:56:28" (2/3) ... [2022-11-25 16:56:29,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fe5bcea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:56:29, skipping insertion in model container [2022-11-25 16:56:29,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:56:29" (3/3) ... [2022-11-25 16:56:29,231 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2022-11-25 16:56:29,251 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:56:29,251 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-25 16:56:29,252 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:56:29,322 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:56:29,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 130 places, 122 transitions, 259 flow [2022-11-25 16:56:29,473 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2022-11-25 16:56:29,474 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:56:29,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-11-25 16:56:29,481 INFO L82 GeneralOperation]: Start removeDead. Operand has 130 places, 122 transitions, 259 flow [2022-11-25 16:56:29,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 119 transitions, 247 flow [2022-11-25 16:56:29,496 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:56:29,521 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 127 places, 119 transitions, 247 flow [2022-11-25 16:56:29,526 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 127 places, 119 transitions, 247 flow [2022-11-25 16:56:29,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 119 transitions, 247 flow [2022-11-25 16:56:29,593 INFO L130 PetriNetUnfolder]: 2/119 cut-off events. [2022-11-25 16:56:29,593 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:56:29,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129 conditions, 119 events. 2/119 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-11-25 16:56:29,598 INFO L119 LiptonReduction]: Number of co-enabled transitions 2146 [2022-11-25 16:56:35,209 INFO L134 LiptonReduction]: Checked pairs total: 5255 [2022-11-25 16:56:35,209 INFO L136 LiptonReduction]: Total number of compositions: 116 [2022-11-25 16:56:35,229 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:56:35,236 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;@7ab3f5e6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:56:35,237 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-25 16:56:35,238 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2022-11-25 16:56:35,239 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:56:35,239 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:35,240 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 16:56:35,241 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:35,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:35,247 INFO L85 PathProgramCache]: Analyzing trace with hash 518, now seen corresponding path program 1 times [2022-11-25 16:56:35,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:35,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390378215] [2022-11-25 16:56:35,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:35,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:35,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:35,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:35,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:35,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390378215] [2022-11-25 16:56:35,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390378215] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:35,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:35,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 16:56:35,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209113558] [2022-11-25 16:56:35,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:35,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 16:56:35,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:35,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:56:35,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:56:35,435 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 238 [2022-11-25 16:56:35,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:35,438 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:35,438 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 238 [2022-11-25 16:56:35,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:35,831 INFO L130 PetriNetUnfolder]: 910/1375 cut-off events. [2022-11-25 16:56:35,832 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-25 16:56:35,836 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2773 conditions, 1375 events. 910/1375 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6391 event pairs, 910 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 2762. Up to 1362 conditions per place. [2022-11-25 16:56:35,846 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 21 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2022-11-25 16:56:35,846 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 99 flow [2022-11-25 16:56:35,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:56:35,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 16:56:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 248 transitions. [2022-11-25 16:56:35,869 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5210084033613446 [2022-11-25 16:56:35,870 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 248 transitions. [2022-11-25 16:56:35,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 248 transitions. [2022-11-25 16:56:35,873 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:35,876 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 248 transitions. [2022-11-25 16:56:35,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 124.0) internal successors, (248), 2 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:35,889 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:35,890 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:35,892 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 248 transitions. [2022-11-25 16:56:35,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 99 flow [2022-11-25 16:56:35,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 16:56:35,899 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2022-11-25 16:56:35,902 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, 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-11-25 16:56:35,907 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2022-11-25 16:56:35,907 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2022-11-25 16:56:35,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 110.5) internal successors, (221), 2 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:35,908 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:35,908 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:35,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:56:35,909 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:35,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:35,910 INFO L85 PathProgramCache]: Analyzing trace with hash -845326631, now seen corresponding path program 1 times [2022-11-25 16:56:35,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:35,910 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170900806] [2022-11-25 16:56:35,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:35,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:35,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:36,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:36,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170900806] [2022-11-25 16:56:36,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170900806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:36,415 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:36,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:56:36,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43544014] [2022-11-25 16:56:36,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:36,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:56:36,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:36,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:56:36,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:56:36,426 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 238 [2022-11-25 16:56:36,427 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 24 transitions, 54 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:36,427 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:36,427 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 238 [2022-11-25 16:56:36,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:36,690 INFO L130 PetriNetUnfolder]: 719/1175 cut-off events. [2022-11-25 16:56:36,691 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:56:36,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 1175 events. 719/1175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6046 event pairs, 146 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 2293. Up to 826 conditions per place. [2022-11-25 16:56:36,700 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 27 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2022-11-25 16:56:36,701 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 136 flow [2022-11-25 16:56:36,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:56:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:56:36,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2022-11-25 16:56:36,707 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5028011204481793 [2022-11-25 16:56:36,707 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2022-11-25 16:56:36,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2022-11-25 16:56:36,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:36,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2022-11-25 16:56:36,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:36,714 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:36,715 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:36,715 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 359 transitions. [2022-11-25 16:56:36,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 136 flow [2022-11-25 16:56:36,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 16:56:36,717 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2022-11-25 16:56:36,718 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, 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-11-25 16:56:36,718 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2022-11-25 16:56:36,719 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2022-11-25 16:56:36,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:36,720 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:36,720 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:36,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:56:36,722 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:36,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:36,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1729509683, now seen corresponding path program 1 times [2022-11-25 16:56:36,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:36,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118158603] [2022-11-25 16:56:36,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:36,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:37,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-11-25 16:56:37,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:37,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118158603] [2022-11-25 16:56:37,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118158603] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:37,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:37,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:56:37,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426039890] [2022-11-25 16:56:37,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:37,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:56:37,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:37,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:56:37,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:56:37,575 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 238 [2022-11-25 16:56:37,576 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:37,576 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:37,576 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 238 [2022-11-25 16:56:37,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:37,862 INFO L130 PetriNetUnfolder]: 511/797 cut-off events. [2022-11-25 16:56:37,863 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-11-25 16:56:37,865 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 797 events. 511/797 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3473 event pairs, 148 based on Foata normal form. 0/785 useless extension candidates. Maximal degree in co-relation 1672. Up to 753 conditions per place. [2022-11-25 16:56:37,870 INFO L137 encePairwiseOnDemand]: 234/238 looper letters, 22 selfloop transitions, 3 changer transitions 0/28 dead transitions. [2022-11-25 16:56:37,871 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 28 transitions, 116 flow [2022-11-25 16:56:37,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:56:37,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:56:37,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 501 transitions. [2022-11-25 16:56:37,880 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.42100840336134454 [2022-11-25 16:56:37,880 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 501 transitions. [2022-11-25 16:56:37,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 501 transitions. [2022-11-25 16:56:37,881 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:37,881 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 501 transitions. [2022-11-25 16:56:37,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 100.2) internal successors, (501), 5 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:37,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:37,888 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:37,889 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 501 transitions. [2022-11-25 16:56:37,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 28 transitions, 116 flow [2022-11-25 16:56:37,892 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 28 transitions, 112 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:56:37,893 INFO L231 Difference]: Finished difference. Result has 33 places, 21 transitions, 54 flow [2022-11-25 16:56:37,893 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=48, PETRI_DIFFERENCE_MINUEND_PLACES=29, 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=54, PETRI_PLACES=33, PETRI_TRANSITIONS=21} [2022-11-25 16:56:37,895 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2022-11-25 16:56:37,895 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 21 transitions, 54 flow [2022-11-25 16:56:37,896 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 97.0) internal successors, (485), 5 states have internal predecessors, (485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:37,896 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:37,896 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:37,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:56:37,897 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:37,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:37,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1729509720, now seen corresponding path program 1 times [2022-11-25 16:56:37,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:37,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214093394] [2022-11-25 16:56:37,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:37,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:38,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:38,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:38,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214093394] [2022-11-25 16:56:38,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214093394] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:38,928 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:38,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:56:38,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200158933] [2022-11-25 16:56:38,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:38,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:56:38,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:38,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:56:38,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:56:39,005 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 238 [2022-11-25 16:56:39,006 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 21 transitions, 54 flow. Second operand has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:39,006 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:39,006 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 238 [2022-11-25 16:56:39,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:39,771 INFO L130 PetriNetUnfolder]: 1453/2258 cut-off events. [2022-11-25 16:56:39,771 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2022-11-25 16:56:39,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4578 conditions, 2258 events. 1453/2258 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 11417 event pairs, 241 based on Foata normal form. 123/2380 useless extension candidates. Maximal degree in co-relation 4574. Up to 1275 conditions per place. [2022-11-25 16:56:39,784 INFO L137 encePairwiseOnDemand]: 227/238 looper letters, 38 selfloop transitions, 11 changer transitions 28/78 dead transitions. [2022-11-25 16:56:39,785 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 78 transitions, 338 flow [2022-11-25 16:56:39,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:56:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:56:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 773 transitions. [2022-11-25 16:56:39,788 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4639855942376951 [2022-11-25 16:56:39,788 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 773 transitions. [2022-11-25 16:56:39,789 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 773 transitions. [2022-11-25 16:56:39,789 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:39,790 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 773 transitions. [2022-11-25 16:56:39,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 110.42857142857143) internal successors, (773), 7 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:39,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:39,796 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:39,797 INFO L175 Difference]: Start difference. First operand has 33 places, 21 transitions, 54 flow. Second operand 7 states and 773 transitions. [2022-11-25 16:56:39,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 78 transitions, 338 flow [2022-11-25 16:56:39,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 78 transitions, 327 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 16:56:39,799 INFO L231 Difference]: Finished difference. Result has 42 places, 31 transitions, 149 flow [2022-11-25 16:56:39,799 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=149, PETRI_PLACES=42, PETRI_TRANSITIONS=31} [2022-11-25 16:56:39,800 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 2 predicate places. [2022-11-25 16:56:39,800 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 31 transitions, 149 flow [2022-11-25 16:56:39,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.0) internal successors, (505), 5 states have internal predecessors, (505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:39,801 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:39,801 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:39,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:56:39,802 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:39,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:39,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2075217596, now seen corresponding path program 1 times [2022-11-25 16:56:39,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:39,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524867618] [2022-11-25 16:56:39,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:39,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:39,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:40,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:40,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:40,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524867618] [2022-11-25 16:56:40,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524867618] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:40,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:40,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:56:40,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031816577] [2022-11-25 16:56:40,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:40,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:56:40,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:40,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:56:40,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:56:40,028 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2022-11-25 16:56:40,029 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 31 transitions, 149 flow. Second operand has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:40,029 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:40,029 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2022-11-25 16:56:40,029 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:40,447 INFO L130 PetriNetUnfolder]: 1231/2032 cut-off events. [2022-11-25 16:56:40,448 INFO L131 PetriNetUnfolder]: For 2676/2688 co-relation queries the response was YES. [2022-11-25 16:56:40,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6442 conditions, 2032 events. 1231/2032 cut-off events. For 2676/2688 co-relation queries the response was YES. Maximal size of possible extension queue 132. Compared 11029 event pairs, 304 based on Foata normal form. 120/2120 useless extension candidates. Maximal degree in co-relation 6433. Up to 1584 conditions per place. [2022-11-25 16:56:40,463 INFO L137 encePairwiseOnDemand]: 233/238 looper letters, 40 selfloop transitions, 5 changer transitions 24/73 dead transitions. [2022-11-25 16:56:40,464 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 73 transitions, 496 flow [2022-11-25 16:56:40,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:56:40,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:56:40,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 579 transitions. [2022-11-25 16:56:40,466 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4865546218487395 [2022-11-25 16:56:40,466 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 579 transitions. [2022-11-25 16:56:40,467 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 579 transitions. [2022-11-25 16:56:40,467 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:40,467 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 579 transitions. [2022-11-25 16:56:40,469 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 115.8) internal successors, (579), 5 states have internal predecessors, (579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:40,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:40,472 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:40,473 INFO L175 Difference]: Start difference. First operand has 42 places, 31 transitions, 149 flow. Second operand 5 states and 579 transitions. [2022-11-25 16:56:40,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 73 transitions, 496 flow [2022-11-25 16:56:40,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 73 transitions, 494 flow, removed 1 selfloop flow, removed 1 redundant places. [2022-11-25 16:56:40,484 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 208 flow [2022-11-25 16:56:40,486 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2022-11-25 16:56:40,489 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 5 predicate places. [2022-11-25 16:56:40,489 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 208 flow [2022-11-25 16:56:40,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.75) internal successors, (435), 4 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:40,491 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:40,491 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:40,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:56:40,491 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:40,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:40,493 INFO L85 PathProgramCache]: Analyzing trace with hash 1215579552, now seen corresponding path program 1 times [2022-11-25 16:56:40,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:40,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468558956] [2022-11-25 16:56:40,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:40,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:41,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:41,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468558956] [2022-11-25 16:56:41,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468558956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:41,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:41,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:56:41,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737053273] [2022-11-25 16:56:41,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:41,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:56:41,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:41,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:56:41,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:56:41,368 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 238 [2022-11-25 16:56:41,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 35 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:41,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:41,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 238 [2022-11-25 16:56:41,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:42,138 INFO L130 PetriNetUnfolder]: 1502/2393 cut-off events. [2022-11-25 16:56:42,138 INFO L131 PetriNetUnfolder]: For 3925/3925 co-relation queries the response was YES. [2022-11-25 16:56:42,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8278 conditions, 2393 events. 1502/2393 cut-off events. For 3925/3925 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 12733 event pairs, 408 based on Foata normal form. 84/2477 useless extension candidates. Maximal degree in co-relation 8266. Up to 1037 conditions per place. [2022-11-25 16:56:42,160 INFO L137 encePairwiseOnDemand]: 227/238 looper letters, 45 selfloop transitions, 18 changer transitions 23/87 dead transitions. [2022-11-25 16:56:42,161 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 87 transitions, 627 flow [2022-11-25 16:56:42,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:56:42,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:56:42,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 766 transitions. [2022-11-25 16:56:42,165 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4597839135654262 [2022-11-25 16:56:42,165 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 766 transitions. [2022-11-25 16:56:42,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 766 transitions. [2022-11-25 16:56:42,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:42,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 766 transitions. [2022-11-25 16:56:42,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 109.42857142857143) internal successors, (766), 7 states have internal predecessors, (766), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:42,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:42,172 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:42,173 INFO L175 Difference]: Start difference. First operand has 45 places, 35 transitions, 208 flow. Second operand 7 states and 766 transitions. [2022-11-25 16:56:42,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 87 transitions, 627 flow [2022-11-25 16:56:42,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 87 transitions, 605 flow, removed 8 selfloop flow, removed 2 redundant places. [2022-11-25 16:56:42,186 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 345 flow [2022-11-25 16:56:42,186 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=195, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=345, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2022-11-25 16:56:42,189 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 13 predicate places. [2022-11-25 16:56:42,189 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 345 flow [2022-11-25 16:56:42,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.4) internal successors, (507), 5 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:42,190 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:42,190 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:42,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:56:42,191 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:42,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:42,192 INFO L85 PathProgramCache]: Analyzing trace with hash 163419764, now seen corresponding path program 1 times [2022-11-25 16:56:42,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:42,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52176825] [2022-11-25 16:56:42,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:42,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:42,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:42,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:42,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52176825] [2022-11-25 16:56:42,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52176825] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:42,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:42,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:56:42,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327318788] [2022-11-25 16:56:42,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:42,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:56:42,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:42,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:56:42,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:56:42,982 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 238 [2022-11-25 16:56:42,983 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 345 flow. Second operand has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:42,984 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:42,984 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 238 [2022-11-25 16:56:42,984 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:43,623 INFO L130 PetriNetUnfolder]: 1641/2672 cut-off events. [2022-11-25 16:56:43,624 INFO L131 PetriNetUnfolder]: For 10470/10563 co-relation queries the response was YES. [2022-11-25 16:56:43,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10549 conditions, 2672 events. 1641/2672 cut-off events. For 10470/10563 co-relation queries the response was YES. Maximal size of possible extension queue 163. Compared 14493 event pairs, 492 based on Foata normal form. 189/2838 useless extension candidates. Maximal degree in co-relation 10533. Up to 1905 conditions per place. [2022-11-25 16:56:43,652 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 54 selfloop transitions, 9 changer transitions 25/96 dead transitions. [2022-11-25 16:56:43,652 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 96 transitions, 866 flow [2022-11-25 16:56:43,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:56:43,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:56:43,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 804 transitions. [2022-11-25 16:56:43,656 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48259303721488594 [2022-11-25 16:56:43,656 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 804 transitions. [2022-11-25 16:56:43,656 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 804 transitions. [2022-11-25 16:56:43,657 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:43,657 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 804 transitions. [2022-11-25 16:56:43,659 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.85714285714286) internal successors, (804), 7 states have internal predecessors, (804), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:43,662 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:43,663 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:43,663 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 345 flow. Second operand 7 states and 804 transitions. [2022-11-25 16:56:43,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 96 transitions, 866 flow [2022-11-25 16:56:43,686 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 96 transitions, 844 flow, removed 11 selfloop flow, removed 2 redundant places. [2022-11-25 16:56:43,688 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 437 flow [2022-11-25 16:56:43,688 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=437, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2022-11-25 16:56:43,689 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 19 predicate places. [2022-11-25 16:56:43,690 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 437 flow [2022-11-25 16:56:43,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.4) internal successors, (547), 5 states have internal predecessors, (547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:43,690 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:43,691 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:43,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:56:43,691 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:43,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1594443074, now seen corresponding path program 1 times [2022-11-25 16:56:43,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:43,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516137443] [2022-11-25 16:56:43,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:43,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:44,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:44,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:44,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516137443] [2022-11-25 16:56:44,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516137443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:44,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:44,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:56:44,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400743483] [2022-11-25 16:56:44,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:44,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:56:44,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:44,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:56:44,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:56:44,210 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 238 [2022-11-25 16:56:44,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 437 flow. Second operand has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:44,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:44,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 238 [2022-11-25 16:56:44,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:44,769 INFO L130 PetriNetUnfolder]: 1539/2509 cut-off events. [2022-11-25 16:56:44,770 INFO L131 PetriNetUnfolder]: For 12676/12743 co-relation queries the response was YES. [2022-11-25 16:56:44,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11043 conditions, 2509 events. 1539/2509 cut-off events. For 12676/12743 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 13503 event pairs, 244 based on Foata normal form. 123/2614 useless extension candidates. Maximal degree in co-relation 11023. Up to 1736 conditions per place. [2022-11-25 16:56:44,794 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 52 selfloop transitions, 11 changer transitions 20/91 dead transitions. [2022-11-25 16:56:44,794 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 91 transitions, 912 flow [2022-11-25 16:56:44,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:56:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:56:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 800 transitions. [2022-11-25 16:56:44,797 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4801920768307323 [2022-11-25 16:56:44,798 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 800 transitions. [2022-11-25 16:56:44,798 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 800 transitions. [2022-11-25 16:56:44,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:44,799 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 800 transitions. [2022-11-25 16:56:44,800 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 114.28571428571429) internal successors, (800), 7 states have internal predecessors, (800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:44,803 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:44,804 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:44,804 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 437 flow. Second operand 7 states and 800 transitions. [2022-11-25 16:56:44,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 91 transitions, 912 flow [2022-11-25 16:56:44,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 91 transitions, 872 flow, removed 3 selfloop flow, removed 2 redundant places. [2022-11-25 16:56:44,824 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 492 flow [2022-11-25 16:56:44,824 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=492, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2022-11-25 16:56:44,825 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 24 predicate places. [2022-11-25 16:56:44,825 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 492 flow [2022-11-25 16:56:44,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.6) internal successors, (548), 5 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:44,826 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:44,826 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:44,826 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:56:44,826 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:44,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:44,827 INFO L85 PathProgramCache]: Analyzing trace with hash 2077830287, now seen corresponding path program 1 times [2022-11-25 16:56:44,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:44,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149286802] [2022-11-25 16:56:44,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:44,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:45,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:45,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:45,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149286802] [2022-11-25 16:56:45,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149286802] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:45,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:45,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:56:45,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916866020] [2022-11-25 16:56:45,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:45,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:56:45,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:45,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:56:45,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:56:45,602 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2022-11-25 16:56:45,603 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 492 flow. Second operand has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:45,603 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:45,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2022-11-25 16:56:45,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:46,338 INFO L130 PetriNetUnfolder]: 1775/2865 cut-off events. [2022-11-25 16:56:46,338 INFO L131 PetriNetUnfolder]: For 19317/19546 co-relation queries the response was YES. [2022-11-25 16:56:46,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13423 conditions, 2865 events. 1775/2865 cut-off events. For 19317/19546 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 15818 event pairs, 212 based on Foata normal form. 261/3106 useless extension candidates. Maximal degree in co-relation 13399. Up to 1793 conditions per place. [2022-11-25 16:56:46,378 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 60 selfloop transitions, 14 changer transitions 27/109 dead transitions. [2022-11-25 16:56:46,379 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 1102 flow [2022-11-25 16:56:46,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 16:56:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-25 16:56:46,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 908 transitions. [2022-11-25 16:56:46,382 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.47689075630252103 [2022-11-25 16:56:46,382 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 908 transitions. [2022-11-25 16:56:46,383 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 908 transitions. [2022-11-25 16:56:46,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:46,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 908 transitions. [2022-11-25 16:56:46,387 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 113.5) internal successors, (908), 8 states have internal predecessors, (908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:46,391 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:46,392 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 238.0) internal successors, (2142), 9 states have internal predecessors, (2142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:46,392 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 492 flow. Second operand 8 states and 908 transitions. [2022-11-25 16:56:46,392 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 1102 flow [2022-11-25 16:56:46,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 109 transitions, 1066 flow, removed 13 selfloop flow, removed 3 redundant places. [2022-11-25 16:56:46,431 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 593 flow [2022-11-25 16:56:46,431 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=462, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=593, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2022-11-25 16:56:46,433 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 30 predicate places. [2022-11-25 16:56:46,433 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 593 flow [2022-11-25 16:56:46,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 108.0) internal successors, (756), 7 states have internal predecessors, (756), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:46,436 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:46,436 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:46,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:56:46,438 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:46,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:46,439 INFO L85 PathProgramCache]: Analyzing trace with hash -823336457, now seen corresponding path program 1 times [2022-11-25 16:56:46,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:46,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146311193] [2022-11-25 16:56:46,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:46,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:46,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:46,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146311193] [2022-11-25 16:56:46,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146311193] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:46,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:46,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:56:46,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467318121] [2022-11-25 16:56:46,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:46,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:56:46,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:46,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:56:46,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:56:46,842 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 238 [2022-11-25 16:56:46,843 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 593 flow. Second operand has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:46,843 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:46,843 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 238 [2022-11-25 16:56:46,843 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:47,606 INFO L130 PetriNetUnfolder]: 1868/3022 cut-off events. [2022-11-25 16:56:47,606 INFO L131 PetriNetUnfolder]: For 27260/27474 co-relation queries the response was YES. [2022-11-25 16:56:47,631 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15552 conditions, 3022 events. 1868/3022 cut-off events. For 27260/27474 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 16961 event pairs, 320 based on Foata normal form. 244/3257 useless extension candidates. Maximal degree in co-relation 15525. Up to 1962 conditions per place. [2022-11-25 16:56:47,647 INFO L137 encePairwiseOnDemand]: 230/238 looper letters, 59 selfloop transitions, 25 changer transitions 19/111 dead transitions. [2022-11-25 16:56:47,648 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 111 transitions, 1279 flow [2022-11-25 16:56:47,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:56:47,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:56:47,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 786 transitions. [2022-11-25 16:56:47,651 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4717887154861945 [2022-11-25 16:56:47,651 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 786 transitions. [2022-11-25 16:56:47,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 786 transitions. [2022-11-25 16:56:47,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:47,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 786 transitions. [2022-11-25 16:56:47,655 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:47,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:47,659 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:47,659 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 593 flow. Second operand 7 states and 786 transitions. [2022-11-25 16:56:47,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 111 transitions, 1279 flow [2022-11-25 16:56:47,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 111 transitions, 1198 flow, removed 31 selfloop flow, removed 5 redundant places. [2022-11-25 16:56:47,747 INFO L231 Difference]: Finished difference. Result has 71 places, 71 transitions, 781 flow [2022-11-25 16:56:47,747 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=781, PETRI_PLACES=71, PETRI_TRANSITIONS=71} [2022-11-25 16:56:47,748 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 31 predicate places. [2022-11-25 16:56:47,748 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 71 transitions, 781 flow [2022-11-25 16:56:47,749 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.33333333333333) internal successors, (644), 6 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:47,749 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:47,749 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:47,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:56:47,749 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:47,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:47,750 INFO L85 PathProgramCache]: Analyzing trace with hash -783464567, now seen corresponding path program 2 times [2022-11-25 16:56:47,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:47,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542021777] [2022-11-25 16:56:47,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:47,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:48,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:48,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:48,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542021777] [2022-11-25 16:56:48,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542021777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:48,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:48,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:56:48,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480202724] [2022-11-25 16:56:48,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:48,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:56:48,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:48,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:56:48,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:56:48,813 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 238 [2022-11-25 16:56:48,815 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 71 transitions, 781 flow. Second operand has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:48,815 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:48,815 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 238 [2022-11-25 16:56:48,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:49,881 INFO L130 PetriNetUnfolder]: 2077/3318 cut-off events. [2022-11-25 16:56:49,882 INFO L131 PetriNetUnfolder]: For 24124/24124 co-relation queries the response was YES. [2022-11-25 16:56:49,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17295 conditions, 3318 events. 2077/3318 cut-off events. For 24124/24124 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 17907 event pairs, 120 based on Foata normal form. 118/3436 useless extension candidates. Maximal degree in co-relation 17268. Up to 1356 conditions per place. [2022-11-25 16:56:49,921 INFO L137 encePairwiseOnDemand]: 227/238 looper letters, 71 selfloop transitions, 55 changer transitions 50/176 dead transitions. [2022-11-25 16:56:49,922 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 176 transitions, 2097 flow [2022-11-25 16:56:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-25 16:56:49,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-25 16:56:49,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1179 transitions. [2022-11-25 16:56:49,926 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45034377387318564 [2022-11-25 16:56:49,927 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1179 transitions. [2022-11-25 16:56:49,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1179 transitions. [2022-11-25 16:56:49,928 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:49,928 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1179 transitions. [2022-11-25 16:56:49,931 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 107.18181818181819) internal successors, (1179), 11 states have internal predecessors, (1179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:49,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 238.0) internal successors, (2856), 12 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:49,937 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 238.0) internal successors, (2856), 12 states have internal predecessors, (2856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:49,937 INFO L175 Difference]: Start difference. First operand has 71 places, 71 transitions, 781 flow. Second operand 11 states and 1179 transitions. [2022-11-25 16:56:49,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 176 transitions, 2097 flow [2022-11-25 16:56:50,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 176 transitions, 1992 flow, removed 52 selfloop flow, removed 5 redundant places. [2022-11-25 16:56:50,013 INFO L231 Difference]: Finished difference. Result has 83 places, 91 transitions, 1210 flow [2022-11-25 16:56:50,013 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=740, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1210, PETRI_PLACES=83, PETRI_TRANSITIONS=91} [2022-11-25 16:56:50,014 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 43 predicate places. [2022-11-25 16:56:50,014 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 91 transitions, 1210 flow [2022-11-25 16:56:50,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 100.0) internal successors, (700), 7 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:50,015 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:50,015 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:50,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:56:50,015 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:50,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:50,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1455098058, now seen corresponding path program 1 times [2022-11-25 16:56:50,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:50,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420574570] [2022-11-25 16:56:50,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:50,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:50,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:50,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420574570] [2022-11-25 16:56:50,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420574570] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:50,853 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:50,854 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:56:50,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883092691] [2022-11-25 16:56:50,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:50,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:56:50,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:50,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:56:50,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:56:50,919 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 238 [2022-11-25 16:56:50,920 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 91 transitions, 1210 flow. Second operand has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:50,920 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:50,920 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 238 [2022-11-25 16:56:50,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:52,066 INFO L130 PetriNetUnfolder]: 2331/3927 cut-off events. [2022-11-25 16:56:52,067 INFO L131 PetriNetUnfolder]: For 35620/35672 co-relation queries the response was YES. [2022-11-25 16:56:52,091 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22330 conditions, 3927 events. 2331/3927 cut-off events. For 35620/35672 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 24201 event pairs, 397 based on Foata normal form. 166/4060 useless extension candidates. Maximal degree in co-relation 22299. Up to 1574 conditions per place. [2022-11-25 16:56:52,103 INFO L137 encePairwiseOnDemand]: 227/238 looper letters, 87 selfloop transitions, 25 changer transitions 41/158 dead transitions. [2022-11-25 16:56:52,103 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 158 transitions, 2309 flow [2022-11-25 16:56:52,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:56:52,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:56:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 762 transitions. [2022-11-25 16:56:52,106 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.45738295318127253 [2022-11-25 16:56:52,107 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 762 transitions. [2022-11-25 16:56:52,107 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 762 transitions. [2022-11-25 16:56:52,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:52,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 762 transitions. [2022-11-25 16:56:52,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 108.85714285714286) internal successors, (762), 7 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-11-25 16:56:52,112 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:52,113 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:52,113 INFO L175 Difference]: Start difference. First operand has 83 places, 91 transitions, 1210 flow. Second operand 7 states and 762 transitions. [2022-11-25 16:56:52,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 158 transitions, 2309 flow [2022-11-25 16:56:52,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 158 transitions, 2193 flow, removed 38 selfloop flow, removed 6 redundant places. [2022-11-25 16:56:52,201 INFO L231 Difference]: Finished difference. Result has 86 places, 89 transitions, 1247 flow [2022-11-25 16:56:52,201 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=1142, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1247, PETRI_PLACES=86, PETRI_TRANSITIONS=89} [2022-11-25 16:56:52,202 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 46 predicate places. [2022-11-25 16:56:52,202 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 89 transitions, 1247 flow [2022-11-25 16:56:52,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 101.8) internal successors, (509), 5 states have internal predecessors, (509), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:52,202 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:52,203 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:52,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:56:52,203 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:52,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:52,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1566679952, now seen corresponding path program 1 times [2022-11-25 16:56:52,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:52,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408355752] [2022-11-25 16:56:52,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:52,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:52,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:52,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408355752] [2022-11-25 16:56:52,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408355752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:52,827 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:52,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:56:52,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848522221] [2022-11-25 16:56:52,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:52,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 16:56:52,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:52,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 16:56:52,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-11-25 16:56:52,866 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 238 [2022-11-25 16:56:52,867 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 89 transitions, 1247 flow. Second operand has 7 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:52,867 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:52,867 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 238 [2022-11-25 16:56:52,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:53,650 INFO L130 PetriNetUnfolder]: 1935/3398 cut-off events. [2022-11-25 16:56:53,651 INFO L131 PetriNetUnfolder]: For 35683/35920 co-relation queries the response was YES. [2022-11-25 16:56:53,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19566 conditions, 3398 events. 1935/3398 cut-off events. For 35683/35920 co-relation queries the response was YES. Maximal size of possible extension queue 236. Compared 21566 event pairs, 678 based on Foata normal form. 203/3568 useless extension candidates. Maximal degree in co-relation 19532. Up to 2555 conditions per place. [2022-11-25 16:56:53,693 INFO L137 encePairwiseOnDemand]: 230/238 looper letters, 90 selfloop transitions, 18 changer transitions 15/133 dead transitions. [2022-11-25 16:56:53,693 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 133 transitions, 1963 flow [2022-11-25 16:56:53,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:56:53,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:56:53,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 786 transitions. [2022-11-25 16:56:53,696 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4717887154861945 [2022-11-25 16:56:53,696 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 786 transitions. [2022-11-25 16:56:53,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 786 transitions. [2022-11-25 16:56:53,697 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:53,697 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 786 transitions. [2022-11-25 16:56:53,699 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 112.28571428571429) internal successors, (786), 7 states have internal predecessors, (786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:53,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:53,703 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:53,703 INFO L175 Difference]: Start difference. First operand has 86 places, 89 transitions, 1247 flow. Second operand 7 states and 786 transitions. [2022-11-25 16:56:53,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 133 transitions, 1963 flow [2022-11-25 16:56:53,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 83 places, 133 transitions, 1902 flow, removed 10 selfloop flow, removed 6 redundant places. [2022-11-25 16:56:53,836 INFO L231 Difference]: Finished difference. Result has 86 places, 94 transitions, 1348 flow [2022-11-25 16:56:53,837 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=1198, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1348, PETRI_PLACES=86, PETRI_TRANSITIONS=94} [2022-11-25 16:56:53,838 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 46 predicate places. [2022-11-25 16:56:53,839 INFO L495 AbstractCegarLoop]: Abstraction has has 86 places, 94 transitions, 1348 flow [2022-11-25 16:56:53,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 107.14285714285714) internal successors, (750), 7 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:53,839 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:53,840 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:53,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:56:53,840 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:53,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:53,841 INFO L85 PathProgramCache]: Analyzing trace with hash -518923964, now seen corresponding path program 2 times [2022-11-25 16:56:53,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:53,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424889043] [2022-11-25 16:56:53,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:53,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:53,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:55,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:55,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:55,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424889043] [2022-11-25 16:56:55,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424889043] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:55,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:55,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:56:55,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944744509] [2022-11-25 16:56:55,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:55,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:56:55,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:55,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:56:55,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:56:55,250 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 238 [2022-11-25 16:56:55,252 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 94 transitions, 1348 flow. Second operand has 8 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:55,252 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:55,252 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 238 [2022-11-25 16:56:55,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:56,212 INFO L130 PetriNetUnfolder]: 2082/3547 cut-off events. [2022-11-25 16:56:56,213 INFO L131 PetriNetUnfolder]: For 31616/31616 co-relation queries the response was YES. [2022-11-25 16:56:56,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19676 conditions, 3547 events. 2082/3547 cut-off events. For 31616/31616 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 21371 event pairs, 342 based on Foata normal form. 86/3633 useless extension candidates. Maximal degree in co-relation 19643. Up to 1368 conditions per place. [2022-11-25 16:56:56,243 INFO L137 encePairwiseOnDemand]: 228/238 looper letters, 69 selfloop transitions, 38 changer transitions 47/154 dead transitions. [2022-11-25 16:56:56,244 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 154 transitions, 2296 flow [2022-11-25 16:56:56,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 16:56:56,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-25 16:56:56,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 920 transitions. [2022-11-25 16:56:56,247 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4295051353874883 [2022-11-25 16:56:56,247 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 920 transitions. [2022-11-25 16:56:56,248 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 920 transitions. [2022-11-25 16:56:56,248 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:56,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 920 transitions. [2022-11-25 16:56:56,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 102.22222222222223) internal successors, (920), 9 states have internal predecessors, (920), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:56,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 238.0) internal successors, (2380), 10 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:56,254 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 238.0) internal successors, (2380), 10 states have internal predecessors, (2380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:56,255 INFO L175 Difference]: Start difference. First operand has 86 places, 94 transitions, 1348 flow. Second operand 9 states and 920 transitions. [2022-11-25 16:56:56,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 154 transitions, 2296 flow [2022-11-25 16:56:56,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 154 transitions, 2210 flow, removed 28 selfloop flow, removed 5 redundant places. [2022-11-25 16:56:56,365 INFO L231 Difference]: Finished difference. Result has 94 places, 85 transitions, 1308 flow [2022-11-25 16:56:56,366 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=1280, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1308, PETRI_PLACES=94, PETRI_TRANSITIONS=85} [2022-11-25 16:56:56,366 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 54 predicate places. [2022-11-25 16:56:56,366 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 85 transitions, 1308 flow [2022-11-25 16:56:56,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 95.875) internal successors, (767), 8 states have internal predecessors, (767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:56,367 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:56,367 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:56,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 16:56:56,367 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:56,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:56,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1058561462, now seen corresponding path program 1 times [2022-11-25 16:56:56,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:56,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488145882] [2022-11-25 16:56:56,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:56,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:56,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:56,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:56,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488145882] [2022-11-25 16:56:56,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488145882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:56,514 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:56,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:56:56,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169140423] [2022-11-25 16:56:56,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:56,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:56:56,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:56,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:56:56,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:56:56,521 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2022-11-25 16:56:56,522 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 85 transitions, 1308 flow. Second operand has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:56,522 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:56,522 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2022-11-25 16:56:56,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:56,715 INFO L130 PetriNetUnfolder]: 411/769 cut-off events. [2022-11-25 16:56:56,715 INFO L131 PetriNetUnfolder]: For 11140/11202 co-relation queries the response was YES. [2022-11-25 16:56:56,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4923 conditions, 769 events. 411/769 cut-off events. For 11140/11202 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 3821 event pairs, 96 based on Foata normal form. 92/856 useless extension candidates. Maximal degree in co-relation 4886. Up to 632 conditions per place. [2022-11-25 16:56:56,724 INFO L137 encePairwiseOnDemand]: 233/238 looper letters, 81 selfloop transitions, 4 changer transitions 2/98 dead transitions. [2022-11-25 16:56:56,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 98 transitions, 1681 flow [2022-11-25 16:56:56,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:56:56,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:56:56,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2022-11-25 16:56:56,727 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48599439775910364 [2022-11-25 16:56:56,727 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2022-11-25 16:56:56,727 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2022-11-25 16:56:56,727 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:56,727 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2022-11-25 16:56:56,728 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:56,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:56,730 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:56,731 INFO L175 Difference]: Start difference. First operand has 94 places, 85 transitions, 1308 flow. Second operand 3 states and 347 transitions. [2022-11-25 16:56:56,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 98 transitions, 1681 flow [2022-11-25 16:56:56,750 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 98 transitions, 1433 flow, removed 34 selfloop flow, removed 17 redundant places. [2022-11-25 16:56:56,752 INFO L231 Difference]: Finished difference. Result has 77 places, 75 transitions, 946 flow [2022-11-25 16:56:56,753 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=920, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=946, PETRI_PLACES=77, PETRI_TRANSITIONS=75} [2022-11-25 16:56:56,753 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 37 predicate places. [2022-11-25 16:56:56,753 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 75 transitions, 946 flow [2022-11-25 16:56:56,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.66666666666667) internal successors, (332), 3 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:56,754 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:56,754 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:56,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 16:56:56,754 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:56,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:56,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1756307494, now seen corresponding path program 1 times [2022-11-25 16:56:56,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:56,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246828102] [2022-11-25 16:56:56,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:56,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:56,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:56,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:56,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246828102] [2022-11-25 16:56:56,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246828102] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:56,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:56,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:56:56,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893526416] [2022-11-25 16:56:56,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:56,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:56:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:56,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:56:56,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:56:56,913 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2022-11-25 16:56:56,913 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 75 transitions, 946 flow. Second operand has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:56,914 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:56,914 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2022-11-25 16:56:56,914 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:57,058 INFO L130 PetriNetUnfolder]: 164/357 cut-off events. [2022-11-25 16:56:57,058 INFO L131 PetriNetUnfolder]: For 2955/2985 co-relation queries the response was YES. [2022-11-25 16:56:57,060 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2209 conditions, 357 events. 164/357 cut-off events. For 2955/2985 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1558 event pairs, 14 based on Foata normal form. 64/419 useless extension candidates. Maximal degree in co-relation 2181. Up to 160 conditions per place. [2022-11-25 16:56:57,061 INFO L137 encePairwiseOnDemand]: 233/238 looper letters, 76 selfloop transitions, 7 changer transitions 8/100 dead transitions. [2022-11-25 16:56:57,062 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 100 transitions, 1471 flow [2022-11-25 16:56:57,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:56:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-11-25 16:56:57,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 460 transitions. [2022-11-25 16:56:57,064 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4831932773109244 [2022-11-25 16:56:57,064 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 460 transitions. [2022-11-25 16:56:57,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 460 transitions. [2022-11-25 16:56:57,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:57,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 460 transitions. [2022-11-25 16:56:57,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 115.0) internal successors, (460), 4 states have internal predecessors, (460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:57,068 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:57,069 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 238.0) internal successors, (1190), 5 states have internal predecessors, (1190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:57,069 INFO L175 Difference]: Start difference. First operand has 77 places, 75 transitions, 946 flow. Second operand 4 states and 460 transitions. [2022-11-25 16:56:57,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 100 transitions, 1471 flow [2022-11-25 16:56:57,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 100 transitions, 1440 flow, removed 6 selfloop flow, removed 5 redundant places. [2022-11-25 16:56:57,082 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 773 flow [2022-11-25 16:56:57,082 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=797, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=773, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2022-11-25 16:56:57,083 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 36 predicate places. [2022-11-25 16:56:57,083 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 773 flow [2022-11-25 16:56:57,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.75) internal successors, (439), 4 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:57,083 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56:57,084 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:57,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 16:56:57,084 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:57,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:57,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1083141719, now seen corresponding path program 1 times [2022-11-25 16:56:57,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:57,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841962774] [2022-11-25 16:56:57,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:57,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:57,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:56:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:56:57,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:56:57,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841962774] [2022-11-25 16:56:57,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841962774] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:56:57,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:56:57,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:56:57,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109516258] [2022-11-25 16:56:57,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:56:57,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:56:57,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:56:57,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:56:57,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:56:57,272 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2022-11-25 16:56:57,273 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 773 flow. Second operand has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:57,273 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:56:57,273 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2022-11-25 16:56:57,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:56:57,399 INFO L130 PetriNetUnfolder]: 104/226 cut-off events. [2022-11-25 16:56:57,399 INFO L131 PetriNetUnfolder]: For 1891/1925 co-relation queries the response was YES. [2022-11-25 16:56:57,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1510 conditions, 226 events. 104/226 cut-off events. For 1891/1925 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 878 event pairs, 4 based on Foata normal form. 38/262 useless extension candidates. Maximal degree in co-relation 1483. Up to 92 conditions per place. [2022-11-25 16:56:57,401 INFO L137 encePairwiseOnDemand]: 233/238 looper letters, 37 selfloop transitions, 10 changer transitions 37/89 dead transitions. [2022-11-25 16:56:57,402 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 89 transitions, 1280 flow [2022-11-25 16:56:57,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:56:57,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:56:57,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 566 transitions. [2022-11-25 16:56:57,405 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4756302521008403 [2022-11-25 16:56:57,405 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 566 transitions. [2022-11-25 16:56:57,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 566 transitions. [2022-11-25 16:56:57,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:56:57,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 566 transitions. [2022-11-25 16:56:57,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 113.2) internal successors, (566), 5 states have internal predecessors, (566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:57,410 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:57,410 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:57,411 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 773 flow. Second operand 5 states and 566 transitions. [2022-11-25 16:56:57,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 89 transitions, 1280 flow [2022-11-25 16:56:57,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 89 transitions, 1140 flow, removed 37 selfloop flow, removed 7 redundant places. [2022-11-25 16:56:57,421 INFO L231 Difference]: Finished difference. Result has 74 places, 37 transitions, 357 flow [2022-11-25 16:56:57,421 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=357, PETRI_PLACES=74, PETRI_TRANSITIONS=37} [2022-11-25 16:56:57,422 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 34 predicate places. [2022-11-25 16:56:57,422 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 37 transitions, 357 flow [2022-11-25 16:56:57,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 109.2) internal successors, (546), 5 states have internal predecessors, (546), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:56:57,423 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:56: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-11-25 16:56:57,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 16:56:57,423 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:56:57,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:56:57,424 INFO L85 PathProgramCache]: Analyzing trace with hash 463059680, now seen corresponding path program 1 times [2022-11-25 16:56:57,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:56:57,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155356345] [2022-11-25 16:56:57,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:56:57,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:56:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:56:57,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:56:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:56:57,582 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 16:56:57,582 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:56:57,583 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-25 16:56:57,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-25 16:56:57,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-25 16:56:57,585 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-25 16:56:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-25 16:56:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-25 16:56:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-25 16:56:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-25 16:56:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-25 16:56:57,586 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-25 16:56:57,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-25 16:56:57,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-25 16:56:57,587 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-25 16:56:57,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 16:56:57,588 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:56:57,594 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 16:56:57,595 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:56:57,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:56:57 BasicIcfg [2022-11-25 16:56:57,668 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:56:57,669 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:56:57,669 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:56:57,669 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:56:57,670 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:56:29" (3/4) ... [2022-11-25 16:56:57,673 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 16:56:57,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:56:57,674 INFO L158 Benchmark]: Toolchain (without parser) took 30324.47ms. Allocated memory was 142.6MB in the beginning and 597.7MB in the end (delta: 455.1MB). Free memory was 109.3MB in the beginning and 258.3MB in the end (delta: -149.0MB). Peak memory consumption was 306.8MB. Max. memory is 16.1GB. [2022-11-25 16:56:57,674 INFO L158 Benchmark]: CDTParser took 1.00ms. Allocated memory is still 113.2MB. Free memory was 65.0MB in the beginning and 64.7MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:56:57,674 INFO L158 Benchmark]: CACSL2BoogieTranslator took 851.50ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 83.0MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-25 16:56:57,675 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.70ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 80.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:56:57,675 INFO L158 Benchmark]: Boogie Preprocessor took 45.54ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 78.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:56:57,675 INFO L158 Benchmark]: RCFGBuilder took 913.21ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 78.6MB in the beginning and 142.2MB in the end (delta: -63.6MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. [2022-11-25 16:56:57,676 INFO L158 Benchmark]: TraceAbstraction took 28447.58ms. Allocated memory was 176.2MB in the beginning and 597.7MB in the end (delta: 421.5MB). Free memory was 142.2MB in the beginning and 259.4MB in the end (delta: -117.2MB). Peak memory consumption was 305.4MB. Max. memory is 16.1GB. [2022-11-25 16:56:57,676 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 597.7MB. Free memory was 259.4MB in the beginning and 258.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:56:57,678 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.00ms. Allocated memory is still 113.2MB. Free memory was 65.0MB in the beginning and 64.7MB in the end (delta: 241.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 851.50ms. Allocated memory is still 142.6MB. Free memory was 108.7MB in the beginning and 83.0MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.70ms. Allocated memory is still 142.6MB. Free memory was 83.0MB in the beginning and 80.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.54ms. Allocated memory is still 142.6MB. Free memory was 80.7MB in the beginning and 78.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 913.21ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 78.6MB in the beginning and 142.2MB in the end (delta: -63.6MB). Peak memory consumption was 39.2MB. Max. memory is 16.1GB. * TraceAbstraction took 28447.58ms. Allocated memory was 176.2MB in the beginning and 597.7MB in the end (delta: 421.5MB). Free memory was 142.2MB in the beginning and 259.4MB in the end (delta: -117.2MB). Peak memory consumption was 305.4MB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 597.7MB. Free memory was 259.4MB in the beginning and 258.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.7s, 127 PlacesBefore, 40 PlacesAfterwards, 119 TransitionsBefore, 31 TransitionsAfterwards, 2146 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 59 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 116 TotalNumberOfCompositions, 5255 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2786, independent: 2636, independent conditional: 0, independent unconditional: 2636, dependent: 150, dependent conditional: 0, dependent unconditional: 150, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1553, independent: 1513, independent conditional: 0, independent unconditional: 1513, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1553, independent: 1493, independent conditional: 0, independent unconditional: 1493, dependent: 60, dependent conditional: 0, dependent unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, independent: 20, independent conditional: 0, independent unconditional: 20, dependent: 40, dependent conditional: 0, dependent unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 443, independent: 44, independent conditional: 0, independent unconditional: 44, dependent: 399, dependent conditional: 0, dependent unconditional: 399, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2786, independent: 1123, independent conditional: 0, independent unconditional: 1123, dependent: 110, dependent conditional: 0, dependent unconditional: 110, unknown: 1553, unknown conditional: 0, unknown unconditional: 1553] , Statistics on independence cache: Total cache size (in pairs): 159, Positive cache size: 136, Positive conditional cache size: 0, Positive unconditional cache size: 136, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23, 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-3, t2492={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=-2, t2492={5:0}, t2493={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=-1, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={5:0}, t2493={6:0}, t2494={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L844] 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, 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, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 812]: 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: 814]: 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: 816]: 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, 148 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: 28.2s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.9s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 927 SdHoareTripleChecker+Valid, 3.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 696 mSDsluCounter, 601 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 398 mSDsCounter, 215 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2059 IncrementalHoareTripleChecker+Invalid, 2274 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 215 mSolverCounterUnsat, 203 mSDtfsCounter, 2059 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1348occurred in iteration=13, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 232 NumberOfCodeBlocks, 232 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 194 ConstructedInterpolants, 0 QuantifiedInterpolants, 1811 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 16:56:57,700 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 16:57:00,323 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:57:00,325 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:57:00,366 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:57:00,367 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:57:00,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:57:00,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:57:00,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:57:00,381 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:57:00,387 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:57:00,388 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:57:00,391 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:57:00,392 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:57:00,394 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:57:00,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:57:00,402 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:57:00,403 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:57:00,405 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:57:00,406 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:57:00,410 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:57:00,413 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:57:00,415 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:57:00,418 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:57:00,419 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:57:00,425 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:57:00,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:57:00,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:57:00,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:57:00,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:57:00,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:57:00,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:57:00,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:57:00,437 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:57:00,447 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:57:00,448 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:57:00,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:57:00,449 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:57:00,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:57:00,450 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:57:00,451 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:57:00,451 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:57:00,457 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-11-25 16:57:00,497 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:57:00,497 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:57:00,499 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:57:00,499 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:57:00,500 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:57:00,500 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:57:00,501 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:57:00,501 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:57:00,502 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:57:00,502 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:57:00,503 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 16:57:00,503 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:57:00,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:57:00,504 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 16:57:00,504 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:57:00,504 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 16:57:00,504 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 16:57:00,505 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 16:57:00,505 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:57:00,505 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 16:57:00,505 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-25 16:57:00,505 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-25 16:57:00,506 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 16:57:00,506 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:57:00,506 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:57:00,506 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:57:00,506 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:57:00,507 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:57:00,507 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:57:00,507 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:57:00,507 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-25 16:57:00,508 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-25 16:57:00,508 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:57:00,508 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:57:00,508 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:57:00,509 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2022-11-25 16:57:00,509 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_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e0191a7c0154db5e6d5798f5b20e5814ce0ff555e18a7acf1f1e5e323a36576 [2022-11-25 16:57:00,942 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:57:00,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:57:00,973 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:57:00,975 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:57:00,976 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:57:00,978 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-11-25 16:57:04,408 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:57:04,635 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:57:04,636 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i [2022-11-25 16:57:04,671 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/data/e7524f54b/a7317d1d223b4d0bae694aafa28fa7ed/FLAGc4b51ade7 [2022-11-25 16:57:04,687 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/data/e7524f54b/a7317d1d223b4d0bae694aafa28fa7ed [2022-11-25 16:57:04,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:57:04,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:57:04,696 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:57:04,696 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:57:04,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:57:04,700 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:57:04" (1/1) ... [2022-11-25 16:57:04,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@606488b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:04, skipping insertion in model container [2022-11-25 16:57:04,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:57:04" (1/1) ... [2022-11-25 16:57:04,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:57:04,749 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:57:04,904 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_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-25 16:57:05,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,100 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,101 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,102 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,103 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,104 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,105 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,106 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,114 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,117 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,119 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,124 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,125 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,126 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,129 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,132 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,133 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,144 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,149 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,152 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,159 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,160 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:57:05,176 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:57:05,187 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_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/sv-benchmarks/c/pthread-wmm/safe030_power.opt_pso.opt_rmo.opt.i[967,980] [2022-11-25 16:57:05,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,209 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,210 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,211 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,212 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,213 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,215 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,216 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,217 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,218 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,219 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,221 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,222 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,226 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,227 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,229 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,230 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_begin [2022-11-25 16:57:05,236 WARN L623 FunctionHandler]: Unknown extern function __VERIFIER_atomic_end [2022-11-25 16:57:05,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:57:05,283 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:57:05,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05 WrapperNode [2022-11-25 16:57:05,284 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:57:05,285 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:57:05,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:57:05,286 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:57:05,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:05,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:05,336 INFO L138 Inliner]: procedures = 179, calls = 54, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 142 [2022-11-25 16:57:05,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:57:05,338 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:57:05,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:57:05,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:57:05,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:05,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:05,352 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:05,358 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:05,368 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:05,384 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:05,386 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:05,388 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:05,391 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:57:05,403 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:57:05,403 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:57:05,403 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:57:05,404 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (1/1) ... [2022-11-25 16:57:05,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:57:05,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:57:05,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:57:05,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:57:05,493 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-25 16:57:05,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:57:05,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:57:05,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:57:05,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-11-25 16:57:05,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-11-25 16:57:05,494 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-25 16:57:05,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-25 16:57:05,494 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-25 16:57:05,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-25 16:57:05,495 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-25 16:57:05,495 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-25 16:57:05,496 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-25 16:57:05,496 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:57:05,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:57:05,498 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-25 16:57:05,743 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:57:05,745 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:57:06,181 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:57:06,411 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:57:06,412 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:57:06,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:57:06 BoogieIcfgContainer [2022-11-25 16:57:06,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:57:06,418 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:57:06,418 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:57:06,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:57:06,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:57:04" (1/3) ... [2022-11-25 16:57:06,423 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b819b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:57:06, skipping insertion in model container [2022-11-25 16:57:06,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:57:05" (2/3) ... [2022-11-25 16:57:06,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23b819b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:57:06, skipping insertion in model container [2022-11-25 16:57:06,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:57:06" (3/3) ... [2022-11-25 16:57:06,428 INFO L112 eAbstractionObserver]: Analyzing ICFG safe030_power.opt_pso.opt_rmo.opt.i [2022-11-25 16:57:06,452 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:57:06,452 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-11-25 16:57:06,453 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-25 16:57:06,547 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-25 16:57:06,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 123 transitions, 261 flow [2022-11-25 16:57:06,715 INFO L130 PetriNetUnfolder]: 2/120 cut-off events. [2022-11-25 16:57:06,715 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:57:06,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-11-25 16:57:06,724 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 123 transitions, 261 flow [2022-11-25 16:57:06,735 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 128 places, 120 transitions, 249 flow [2022-11-25 16:57:06,743 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-25 16:57:06,774 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 128 places, 120 transitions, 249 flow [2022-11-25 16:57:06,779 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 128 places, 120 transitions, 249 flow [2022-11-25 16:57:06,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 128 places, 120 transitions, 249 flow [2022-11-25 16:57:06,823 INFO L130 PetriNetUnfolder]: 2/120 cut-off events. [2022-11-25 16:57:06,823 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:57:06,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 130 conditions, 120 events. 2/120 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 74 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 79. Up to 2 conditions per place. [2022-11-25 16:57:06,827 INFO L119 LiptonReduction]: Number of co-enabled transitions 2146 [2022-11-25 16:57:15,847 INFO L134 LiptonReduction]: Checked pairs total: 5379 [2022-11-25 16:57:15,847 INFO L136 LiptonReduction]: Total number of compositions: 115 [2022-11-25 16:57:15,863 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:57:15,869 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;@3340e8d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:57:15,870 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2022-11-25 16:57:15,872 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2022-11-25 16:57:15,872 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:57:15,872 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:57:15,873 INFO L209 CegarLoopForPetriNet]: trace histogram [1] [2022-11-25 16:57:15,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:57:15,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:15,878 INFO L85 PathProgramCache]: Analyzing trace with hash 517, now seen corresponding path program 1 times [2022-11-25 16:57:15,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:57:15,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865271685] [2022-11-25 16:57:15,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:15,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:15,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:57:15,902 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:57:15,907 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-25 16:57:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:16,022 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 16:57:16,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:16,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:16,030 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:57:16,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:57:16,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865271685] [2022-11-25 16:57:16,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865271685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:16,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:16,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-25 16:57:16,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157452770] [2022-11-25 16:57:16,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:16,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 16:57:16,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:57:16,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 16:57:16,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 16:57:16,076 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 238 [2022-11-25 16:57:16,079 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 71 flow. Second operand has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:16,079 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:57:16,080 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 238 [2022-11-25 16:57:16,081 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:57:16,589 INFO L130 PetriNetUnfolder]: 910/1375 cut-off events. [2022-11-25 16:57:16,589 INFO L131 PetriNetUnfolder]: For 5/5 co-relation queries the response was YES. [2022-11-25 16:57:16,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2773 conditions, 1375 events. 910/1375 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 6414 event pairs, 910 based on Foata normal form. 0/1155 useless extension candidates. Maximal degree in co-relation 2762. Up to 1362 conditions per place. [2022-11-25 16:57:16,606 INFO L137 encePairwiseOnDemand]: 231/238 looper letters, 21 selfloop transitions, 0 changer transitions 0/24 dead transitions. [2022-11-25 16:57:16,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 24 transitions, 99 flow [2022-11-25 16:57:16,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 16:57:16,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-25 16:57:16,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 250 transitions. [2022-11-25 16:57:16,629 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5252100840336135 [2022-11-25 16:57:16,630 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 250 transitions. [2022-11-25 16:57:16,631 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 250 transitions. [2022-11-25 16:57:16,633 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:57:16,636 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 250 transitions. [2022-11-25 16:57:16,644 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 125.0) internal successors, (250), 2 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:16,651 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:16,652 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:16,654 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 71 flow. Second operand 2 states and 250 transitions. [2022-11-25 16:57:16,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 24 transitions, 99 flow [2022-11-25 16:57:16,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 24 transitions, 96 flow, removed 0 selfloop flow, removed 3 redundant places. [2022-11-25 16:57:16,662 INFO L231 Difference]: Finished difference. Result has 32 places, 24 transitions, 54 flow [2022-11-25 16:57:16,664 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, 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-11-25 16:57:16,670 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -8 predicate places. [2022-11-25 16:57:16,670 INFO L495 AbstractCegarLoop]: Abstraction has has 32 places, 24 transitions, 54 flow [2022-11-25 16:57:16,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 111.5) internal successors, (223), 2 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:16,671 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:57:16,671 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:16,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:16,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:16,885 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P2Err0ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:57:16,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:16,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1676431080, now seen corresponding path program 1 times [2022-11-25 16:57:16,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:57:16,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1499462093] [2022-11-25 16:57:16,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:16,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:16,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:57:16,889 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:57:16,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-25 16:57:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:17,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:57:17,031 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:17,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:17,072 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:57:17,073 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:57:17,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1499462093] [2022-11-25 16:57:17,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1499462093] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:17,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:17,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 16:57:17,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189626131] [2022-11-25 16:57:17,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:17,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:57:17,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:57:17,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:57:17,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:57:17,090 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 238 [2022-11-25 16:57:17,090 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.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:17,091 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:57:17,091 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 238 [2022-11-25 16:57:17,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:57:17,429 INFO L130 PetriNetUnfolder]: 719/1175 cut-off events. [2022-11-25 16:57:17,429 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-25 16:57:17,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2296 conditions, 1175 events. 719/1175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 6040 event pairs, 146 based on Foata normal form. 0/1075 useless extension candidates. Maximal degree in co-relation 2293. Up to 826 conditions per place. [2022-11-25 16:57:17,438 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 27 selfloop transitions, 2 changer transitions 2/34 dead transitions. [2022-11-25 16:57:17,438 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 34 transitions, 136 flow [2022-11-25 16:57:17,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:57:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:57:17,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 362 transitions. [2022-11-25 16:57:17,441 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5070028011204482 [2022-11-25 16:57:17,441 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 362 transitions. [2022-11-25 16:57:17,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 362 transitions. [2022-11-25 16:57:17,442 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:57:17,442 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 362 transitions. [2022-11-25 16:57:17,444 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:17,446 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:17,447 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:17,447 INFO L175 Difference]: Start difference. First operand has 32 places, 24 transitions, 54 flow. Second operand 3 states and 362 transitions. [2022-11-25 16:57:17,447 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 34 transitions, 136 flow [2022-11-25 16:57:17,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 34 transitions, 136 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-25 16:57:17,449 INFO L231 Difference]: Finished difference. Result has 33 places, 22 transitions, 54 flow [2022-11-25 16:57:17,449 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, 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-11-25 16:57:17,450 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -7 predicate places. [2022-11-25 16:57:17,450 INFO L495 AbstractCegarLoop]: Abstraction has has 33 places, 22 transitions, 54 flow [2022-11-25 16:57:17,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:17,451 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:57:17,451 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:17,472 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:17,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:17,672 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:57:17,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:17,673 INFO L85 PathProgramCache]: Analyzing trace with hash -437442040, now seen corresponding path program 1 times [2022-11-25 16:57:17,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:57:17,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959988643] [2022-11-25 16:57:17,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:17,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:17,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:57:17,682 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:57:17,740 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-25 16:57:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:17,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:57:17,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:17,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:17,941 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:57:17,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:57:17,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959988643] [2022-11-25 16:57:17,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959988643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:17,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:17,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:57:17,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752050866] [2022-11-25 16:57:17,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:17,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:57:17,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:57:17,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:57:17,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:57:17,973 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2022-11-25 16:57:17,974 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 33 places, 22 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:17,974 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:57:17,974 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2022-11-25 16:57:17,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:57:18,313 INFO L130 PetriNetUnfolder]: 419/706 cut-off events. [2022-11-25 16:57:18,313 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2022-11-25 16:57:18,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 706 events. 419/706 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 3251 event pairs, 84 based on Foata normal form. 48/721 useless extension candidates. Maximal degree in co-relation 1489. Up to 508 conditions per place. [2022-11-25 16:57:18,319 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 27 selfloop transitions, 4 changer transitions 17/51 dead transitions. [2022-11-25 16:57:18,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 51 transitions, 218 flow [2022-11-25 16:57:18,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:57:18,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:57:18,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 580 transitions. [2022-11-25 16:57:18,322 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48739495798319327 [2022-11-25 16:57:18,323 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 580 transitions. [2022-11-25 16:57:18,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 580 transitions. [2022-11-25 16:57:18,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:57:18,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 580 transitions. [2022-11-25 16:57:18,326 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 116.0) internal successors, (580), 5 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:18,332 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:18,333 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:18,334 INFO L175 Difference]: Start difference. First operand has 33 places, 22 transitions, 54 flow. Second operand 5 states and 580 transitions. [2022-11-25 16:57:18,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 51 transitions, 218 flow [2022-11-25 16:57:18,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 51 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2022-11-25 16:57:18,338 INFO L231 Difference]: Finished difference. Result has 37 places, 25 transitions, 86 flow [2022-11-25 16:57:18,339 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, 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-11-25 16:57:18,340 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -3 predicate places. [2022-11-25 16:57:18,341 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 25 transitions, 86 flow [2022-11-25 16:57:18,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 108.25) internal successors, (433), 4 states have internal predecessors, (433), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:18,343 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:57:18,343 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:18,370 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:18,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:18,557 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:57:18,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:18,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1952085169, now seen corresponding path program 1 times [2022-11-25 16:57:18,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:57:18,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [129603679] [2022-11-25 16:57:18,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:18,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:18,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:57:18,562 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:57:18,611 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-25 16:57:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:18,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-25 16:57:18,702 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:18,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:18,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:57:18,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:57:18,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [129603679] [2022-11-25 16:57:18,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [129603679] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:18,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:18,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 16:57:18,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971272092] [2022-11-25 16:57:18,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:18,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 16:57:18,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:57:18,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 16:57:18,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 16:57:18,787 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2022-11-25 16:57:18,788 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 25 transitions, 86 flow. Second operand has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:18,789 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:57:18,789 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2022-11-25 16:57:18,789 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:57:19,088 INFO L130 PetriNetUnfolder]: 176/340 cut-off events. [2022-11-25 16:57:19,088 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2022-11-25 16:57:19,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 938 conditions, 340 events. 176/340 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1378 event pairs, 37 based on Foata normal form. 30/358 useless extension candidates. Maximal degree in co-relation 931. Up to 121 conditions per place. [2022-11-25 16:57:19,091 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 34 selfloop transitions, 7 changer transitions 17/61 dead transitions. [2022-11-25 16:57:19,091 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 61 transitions, 318 flow [2022-11-25 16:57:19,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 16:57:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-11-25 16:57:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 696 transitions. [2022-11-25 16:57:19,095 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48739495798319327 [2022-11-25 16:57:19,095 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 696 transitions. [2022-11-25 16:57:19,095 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 696 transitions. [2022-11-25 16:57:19,096 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:57:19,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 696 transitions. [2022-11-25 16:57:19,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 116.0) internal successors, (696), 6 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:19,101 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:19,102 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 238.0) internal successors, (1666), 7 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:19,102 INFO L175 Difference]: Start difference. First operand has 37 places, 25 transitions, 86 flow. Second operand 6 states and 696 transitions. [2022-11-25 16:57:19,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 61 transitions, 318 flow [2022-11-25 16:57:19,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 61 transitions, 312 flow, removed 1 selfloop flow, removed 2 redundant places. [2022-11-25 16:57:19,106 INFO L231 Difference]: Finished difference. Result has 41 places, 28 transitions, 136 flow [2022-11-25 16:57:19,106 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, 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-11-25 16:57:19,107 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2022-11-25 16:57:19,107 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 28 transitions, 136 flow [2022-11-25 16:57:19,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.2) internal successors, (541), 5 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:19,108 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:57:19,108 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:19,126 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:19,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:19,326 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:57:19,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:19,327 INFO L85 PathProgramCache]: Analyzing trace with hash 215451233, now seen corresponding path program 1 times [2022-11-25 16:57:19,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:57:19,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [765025486] [2022-11-25 16:57:19,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:19,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:19,328 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:57:19,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:57:19,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-25 16:57:19,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:19,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-25 16:57:19,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:19,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:57:19,577 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:57:19,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [765025486] [2022-11-25 16:57:19,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [765025486] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:19,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:19,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 16:57:19,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581242538] [2022-11-25 16:57:19,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:19,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 16:57:19,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:57:19,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 16:57:19,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 16:57:19,626 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2022-11-25 16:57:19,628 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 28 transitions, 136 flow. Second operand has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:19,628 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:57:19,628 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2022-11-25 16:57:19,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:57:20,034 INFO L130 PetriNetUnfolder]: 102/205 cut-off events. [2022-11-25 16:57:20,034 INFO L131 PetriNetUnfolder]: For 234/234 co-relation queries the response was YES. [2022-11-25 16:57:20,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 634 conditions, 205 events. 102/205 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 716 event pairs, 32 based on Foata normal form. 9/210 useless extension candidates. Maximal degree in co-relation 625. Up to 77 conditions per place. [2022-11-25 16:57:20,035 INFO L137 encePairwiseOnDemand]: 232/238 looper letters, 31 selfloop transitions, 10 changer transitions 9/53 dead transitions. [2022-11-25 16:57:20,035 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 53 transitions, 320 flow [2022-11-25 16:57:20,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 16:57:20,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-25 16:57:20,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 794 transitions. [2022-11-25 16:57:20,039 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4765906362545018 [2022-11-25 16:57:20,039 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 794 transitions. [2022-11-25 16:57:20,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 794 transitions. [2022-11-25 16:57:20,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:57:20,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 794 transitions. [2022-11-25 16:57:20,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 113.42857142857143) internal successors, (794), 7 states have internal predecessors, (794), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:20,045 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:20,046 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 238.0) internal successors, (1904), 8 states have internal predecessors, (1904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:20,046 INFO L175 Difference]: Start difference. First operand has 41 places, 28 transitions, 136 flow. Second operand 7 states and 794 transitions. [2022-11-25 16:57:20,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 53 transitions, 320 flow [2022-11-25 16:57:20,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 53 transitions, 284 flow, removed 14 selfloop flow, removed 4 redundant places. [2022-11-25 16:57:20,050 INFO L231 Difference]: Finished difference. Result has 44 places, 28 transitions, 138 flow [2022-11-25 16:57:20,051 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, 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-11-25 16:57:20,052 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 4 predicate places. [2022-11-25 16:57:20,052 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 28 transitions, 138 flow [2022-11-25 16:57:20,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 108.33333333333333) internal successors, (650), 6 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:20,053 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:57:20,053 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:20,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:20,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:20,272 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:57:20,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:20,273 INFO L85 PathProgramCache]: Analyzing trace with hash -779972581, now seen corresponding path program 1 times [2022-11-25 16:57:20,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:57:20,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1695091091] [2022-11-25 16:57:20,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:57:20,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:20,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:57:20,275 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:57:20,319 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-25 16:57:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:57:20,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:57:20,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:20,487 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:57:20,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:57:20,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1695091091] [2022-11-25 16:57:20,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1695091091] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:20,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:20,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:57:20,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738918867] [2022-11-25 16:57:20,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:20,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:57:20,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:57:20,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:57:20,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:57:20,495 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 238 [2022-11-25 16:57:20,496 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 28 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:20,496 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:57:20,496 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 238 [2022-11-25 16:57:20,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:57:20,643 INFO L130 PetriNetUnfolder]: 134/275 cut-off events. [2022-11-25 16:57:20,644 INFO L131 PetriNetUnfolder]: For 420/420 co-relation queries the response was YES. [2022-11-25 16:57:20,644 INFO L83 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 275 events. 134/275 cut-off events. For 420/420 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1114 event pairs, 71 based on Foata normal form. 0/270 useless extension candidates. Maximal degree in co-relation 824. Up to 180 conditions per place. [2022-11-25 16:57:20,646 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 41 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2022-11-25 16:57:20,646 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 45 transitions, 330 flow [2022-11-25 16:57:20,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:57:20,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:57:20,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2022-11-25 16:57:20,649 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.49859943977591037 [2022-11-25 16:57:20,649 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 356 transitions. [2022-11-25 16:57:20,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 356 transitions. [2022-11-25 16:57:20,649 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:57:20,649 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 356 transitions. [2022-11-25 16:57:20,650 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:20,652 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:20,652 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:20,652 INFO L175 Difference]: Start difference. First operand has 44 places, 28 transitions, 138 flow. Second operand 3 states and 356 transitions. [2022-11-25 16:57:20,652 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 45 transitions, 330 flow [2022-11-25 16:57:20,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 45 transitions, 256 flow, removed 24 selfloop flow, removed 6 redundant places. [2022-11-25 16:57:20,656 INFO L231 Difference]: Finished difference. Result has 39 places, 29 transitions, 112 flow [2022-11-25 16:57:20,656 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, 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=3, PETRI_FLOW=112, PETRI_PLACES=39, PETRI_TRANSITIONS=29} [2022-11-25 16:57:20,657 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, -1 predicate places. [2022-11-25 16:57:20,657 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 29 transitions, 112 flow [2022-11-25 16:57:20,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:20,658 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:57:20,658 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:20,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:20,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:20,872 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:57:20,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:20,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1435145063, now seen corresponding path program 2 times [2022-11-25 16:57:20,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:57:20,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1027258936] [2022-11-25 16:57:20,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 16:57:20,873 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:20,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:57:20,874 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:57:20,882 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-11-25 16:57:21,009 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 16:57:21,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:57:21,015 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 16:57:21,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:21,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:21,043 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:57:21,043 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:57:21,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1027258936] [2022-11-25 16:57:21,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1027258936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:21,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:21,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:57:21,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451100256] [2022-11-25 16:57:21,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:21,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:57:21,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:57:21,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:57:21,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:57:21,053 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 238 [2022-11-25 16:57:21,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 29 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:57:21,054 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 238 [2022-11-25 16:57:21,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:57:21,219 INFO L130 PetriNetUnfolder]: 229/461 cut-off events. [2022-11-25 16:57:21,219 INFO L131 PetriNetUnfolder]: For 309/309 co-relation queries the response was YES. [2022-11-25 16:57:21,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 461 events. 229/461 cut-off events. For 309/309 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2203 event pairs, 95 based on Foata normal form. 1/454 useless extension candidates. Maximal degree in co-relation 1322. Up to 262 conditions per place. [2022-11-25 16:57:21,223 INFO L137 encePairwiseOnDemand]: 235/238 looper letters, 46 selfloop transitions, 2 changer transitions 0/50 dead transitions. [2022-11-25 16:57:21,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 290 flow [2022-11-25 16:57:21,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:57:21,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2022-11-25 16:57:21,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 360 transitions. [2022-11-25 16:57:21,225 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5042016806722689 [2022-11-25 16:57:21,225 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 360 transitions. [2022-11-25 16:57:21,226 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 360 transitions. [2022-11-25 16:57:21,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:57:21,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 360 transitions. [2022-11-25 16:57:21,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,229 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,229 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 238.0) internal successors, (952), 4 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,229 INFO L175 Difference]: Start difference. First operand has 39 places, 29 transitions, 112 flow. Second operand 3 states and 360 transitions. [2022-11-25 16:57:21,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 290 flow [2022-11-25 16:57:21,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 288 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:57:21,235 INFO L231 Difference]: Finished difference. Result has 41 places, 30 transitions, 122 flow [2022-11-25 16:57:21,235 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=41, PETRI_TRANSITIONS=30} [2022-11-25 16:57:21,236 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2022-11-25 16:57:21,236 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 30 transitions, 122 flow [2022-11-25 16:57:21,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,237 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:57:21,237 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:21,259 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:21,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:21,446 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:57:21,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:21,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1690785999, now seen corresponding path program 3 times [2022-11-25 16:57:21,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:57:21,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [747057538] [2022-11-25 16:57:21,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 16:57:21,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:21,447 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:57:21,450 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:57:21,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-11-25 16:57:21,583 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-25 16:57:21,583 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 16:57:21,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjunts are in the unsatisfiable core [2022-11-25 16:57:21,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 16:57:21,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:57:21,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 16:57:21,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-25 16:57:21,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [747057538] [2022-11-25 16:57:21,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [747057538] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:57:21,892 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:57:21,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 16:57:21,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35252094] [2022-11-25 16:57:21,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:57:21,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 16:57:21,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-25 16:57:21,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 16:57:21,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 16:57:21,944 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 238 [2022-11-25 16:57:21,945 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 30 transitions, 122 flow. Second operand has 8 states, 8 states have (on average 108.25) internal successors, (866), 8 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:21,945 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-25 16:57:21,945 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 238 [2022-11-25 16:57:21,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-25 16:57:22,159 INFO L130 PetriNetUnfolder]: 278/595 cut-off events. [2022-11-25 16:57:22,159 INFO L131 PetriNetUnfolder]: For 531/532 co-relation queries the response was YES. [2022-11-25 16:57:22,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 595 events. 278/595 cut-off events. For 531/532 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3056 event pairs, 47 based on Foata normal form. 1/595 useless extension candidates. Maximal degree in co-relation 1811. Up to 250 conditions per place. [2022-11-25 16:57:22,163 INFO L137 encePairwiseOnDemand]: 233/238 looper letters, 52 selfloop transitions, 5 changer transitions 0/59 dead transitions. [2022-11-25 16:57:22,163 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 59 transitions, 361 flow [2022-11-25 16:57:22,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 16:57:22,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-11-25 16:57:22,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 569 transitions. [2022-11-25 16:57:22,166 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4781512605042017 [2022-11-25 16:57:22,166 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 569 transitions. [2022-11-25 16:57:22,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 569 transitions. [2022-11-25 16:57:22,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-25 16:57:22,167 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 569 transitions. [2022-11-25 16:57:22,168 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-11-25 16:57:22,170 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:22,171 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 238.0) internal successors, (1428), 6 states have internal predecessors, (1428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:22,171 INFO L175 Difference]: Start difference. First operand has 41 places, 30 transitions, 122 flow. Second operand 5 states and 569 transitions. [2022-11-25 16:57:22,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 59 transitions, 361 flow [2022-11-25 16:57:22,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 59 transitions, 358 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-25 16:57:22,176 INFO L231 Difference]: Finished difference. Result has 46 places, 32 transitions, 144 flow [2022-11-25 16:57:22,177 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=238, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=144, PETRI_PLACES=46, PETRI_TRANSITIONS=32} [2022-11-25 16:57:22,177 INFO L288 CegarLoopForPetriNet]: 40 programPoint places, 6 predicate places. [2022-11-25 16:57:22,178 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 32 transitions, 144 flow [2022-11-25 16:57:22,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 108.25) internal successors, (866), 8 states have internal predecessors, (866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 16:57:22,178 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-25 16:57:22,179 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:57:22,200 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:22,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:22,392 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P2Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2022-11-25 16:57:22,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:57:22,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2083143209, now seen corresponding path program 4 times [2022-11-25 16:57:22,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-25 16:57:22,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1099650173] [2022-11-25 16:57:22,393 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 16:57:22,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:22,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat [2022-11-25 16:57:22,394 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-25 16:57:22,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-11-25 16:57:22,561 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 16:57:22,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 16:57:22,562 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 16:57:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 16:57:22,709 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-25 16:57:22,709 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 16:57:22,711 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2022-11-25 16:57:22,713 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2022-11-25 16:57:22,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2022-11-25 16:57:22,714 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2022-11-25 16:57:22,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2022-11-25 16:57:22,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2022-11-25 16:57:22,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2022-11-25 16:57:22,715 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2022-11-25 16:57:22,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2022-11-25 16:57:22,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2022-11-25 16:57:22,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2022-11-25 16:57:22,716 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2022-11-25 16:57:22,717 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2022-11-25 16:57:22,755 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-11-25 16:57:22,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-25 16:57:22,931 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1] [2022-11-25 16:57:22,937 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-25 16:57:22,938 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:57:23,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:57:23 BasicIcfg [2022-11-25 16:57:23,016 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:57:23,016 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:57:23,016 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:57:23,017 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:57:23,017 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:57:06" (3/4) ... [2022-11-25 16:57:23,021 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-25 16:57:23,021 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:57:23,022 INFO L158 Benchmark]: Toolchain (without parser) took 18328.34ms. Allocated memory was 79.7MB in the beginning and 180.4MB in the end (delta: 100.7MB). Free memory was 59.8MB in the beginning and 133.4MB in the end (delta: -73.5MB). Peak memory consumption was 27.1MB. Max. memory is 16.1GB. [2022-11-25 16:57:23,022 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 79.7MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:57:23,022 INFO L158 Benchmark]: CACSL2BoogieTranslator took 588.84ms. Allocated memory is still 79.7MB. Free memory was 59.6MB in the beginning and 57.4MB in the end (delta: 2.1MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. [2022-11-25 16:57:23,023 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.72ms. Allocated memory is still 79.7MB. Free memory was 57.4MB in the beginning and 54.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:57:23,025 INFO L158 Benchmark]: Boogie Preprocessor took 64.73ms. Allocated memory is still 79.7MB. Free memory was 54.9MB in the beginning and 52.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:57:23,025 INFO L158 Benchmark]: RCFGBuilder took 1012.13ms. Allocated memory was 79.7MB in the beginning and 102.8MB in the end (delta: 23.1MB). Free memory was 52.9MB in the beginning and 62.0MB in the end (delta: -9.2MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2022-11-25 16:57:23,026 INFO L158 Benchmark]: TraceAbstraction took 16598.20ms. Allocated memory was 102.8MB in the beginning and 180.4MB in the end (delta: 77.6MB). Free memory was 61.4MB in the beginning and 133.4MB in the end (delta: -72.0MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. [2022-11-25 16:57:23,026 INFO L158 Benchmark]: Witness Printer took 4.67ms. Allocated memory is still 180.4MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:57:23,029 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.32ms. Allocated memory is still 79.7MB. Free memory is still 57.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 588.84ms. Allocated memory is still 79.7MB. Free memory was 59.6MB in the beginning and 57.4MB in the end (delta: 2.1MB). Peak memory consumption was 30.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.72ms. Allocated memory is still 79.7MB. Free memory was 57.4MB in the beginning and 54.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.73ms. Allocated memory is still 79.7MB. Free memory was 54.9MB in the beginning and 52.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1012.13ms. Allocated memory was 79.7MB in the beginning and 102.8MB in the end (delta: 23.1MB). Free memory was 52.9MB in the beginning and 62.0MB in the end (delta: -9.2MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * TraceAbstraction took 16598.20ms. Allocated memory was 102.8MB in the beginning and 180.4MB in the end (delta: 77.6MB). Free memory was 61.4MB in the beginning and 133.4MB in the end (delta: -72.0MB). Peak memory consumption was 6.5MB. Max. memory is 16.1GB. * Witness Printer took 4.67ms. Allocated memory is still 180.4MB. Free memory is still 133.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 9.1s, 128 PlacesBefore, 40 PlacesAfterwards, 120 TransitionsBefore, 31 TransitionsAfterwards, 2146 CoEnabledTransitionPairs, 7 FixpointIterations, 47 TrivialSequentialCompositions, 60 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 115 TotalNumberOfCompositions, 5379 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2910, independent: 2747, independent conditional: 0, independent unconditional: 2747, dependent: 163, dependent conditional: 0, dependent unconditional: 163, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1598, independent: 1546, independent conditional: 0, independent unconditional: 1546, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1598, independent: 1517, independent conditional: 0, independent unconditional: 1517, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 29, independent conditional: 0, independent unconditional: 29, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 518, independent: 53, independent conditional: 0, independent unconditional: 53, dependent: 465, dependent conditional: 0, dependent unconditional: 465, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2910, independent: 1201, independent conditional: 0, independent unconditional: 1201, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 1598, unknown conditional: 0, unknown unconditional: 1598] , Statistics on independence cache: Total cache size (in pairs): 161, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 17, Negative conditional cache size: 0, Negative unconditional cache size: 17, 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; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2492, ((void *)0), P0, ((void *)0))=-1, t2492={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2493, ((void *)0), P1, ((void *)0))=0, t2492={3:0}, t2493={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2494, ((void *)0), P2, ((void *)0))=1, t2492={3:0}, t2493={7:0}, t2494={11:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L778] CALL 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 3 !(!expression) [L778] RET 3 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L757] 2 y = 1 VAL [__unbuffered_cnt=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L760] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=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, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L789] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=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, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L820] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L820] RET 0 assume_abort_if_not(main$tmp_guard0) [L822] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2492={3:0}, t2493={7:0}, t2494={11:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L834] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L835] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L836] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L837] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L838] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L839] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L844] 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, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 809]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 812]: 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: 814]: 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: 816]: 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, 149 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: 16.3s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 9.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 207 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 177 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 734 IncrementalHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 8 mSDtfsCounter, 734 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 100 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=8, InterpolantAutomatonStates: 34, 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.7s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 97 ConstructedInterpolants, 0 QuantifiedInterpolants, 418 SizeOfPredicates, 12 NumberOfNonLiveVariables, 945 ConjunctsInSsa, 50 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-25 16:57:23,053 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6541f0eb-81dc-4cd5-b6d8-0208946b28bc/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample