./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 95135695b4ab9cb9c416390540cae35b9fbb32e4 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 07:07:14,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 07:07:14,165 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 07:07:14,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 07:07:14,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 07:07:14,203 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 07:07:14,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 07:07:14,208 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 07:07:14,210 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 07:07:14,211 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 07:07:14,213 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 07:07:14,214 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 07:07:14,215 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 07:07:14,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 07:07:14,218 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 07:07:14,220 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 07:07:14,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 07:07:14,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 07:07:14,226 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 07:07:14,228 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 07:07:14,231 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 07:07:14,232 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 07:07:14,234 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 07:07:14,235 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 07:07:14,240 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 07:07:14,245 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 07:07:14,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 07:07:14,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 07:07:14,248 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 07:07:14,249 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 07:07:14,249 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 07:07:14,250 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 07:07:14,251 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 07:07:14,252 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 07:07:14,253 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 07:07:14,253 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 07:07:14,254 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 07:07:14,255 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 07:07:14,255 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 07:07:14,257 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 07:07:14,258 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 07:07:14,259 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-10-13 07:07:14,287 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 07:07:14,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 07:07:14,289 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 07:07:14,289 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 07:07:14,289 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 07:07:14,289 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 07:07:14,290 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 07:07:14,290 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 07:07:14,290 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 07:07:14,290 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 07:07:14,291 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 07:07:14,291 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 07:07:14,291 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 07:07:14,291 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 07:07:14,292 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 07:07:14,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 07:07:14,293 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 07:07:14,293 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 07:07:14,293 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 07:07:14,294 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 07:07:14,294 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 07:07:14,294 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 07:07:14,294 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 07:07:14,295 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 07:07:14,295 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 07:07:14,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 07:07:14,295 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 07:07:14,296 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 07:07:14,296 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 07:07:14,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 07:07:14,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 07:07:14,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:07:14,297 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 07:07:14,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 07:07:14,297 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 07:07:14,298 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 07:07:14,298 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 07:07:14,298 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 07:07:14,298 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/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_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 95135695b4ab9cb9c416390540cae35b9fbb32e4 [2021-10-13 07:07:14,577 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 07:07:14,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 07:07:14,609 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 07:07:14,611 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 07:07:14,611 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 07:07:14,612 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/forester-heap/sll-token-1.i [2021-10-13 07:07:14,700 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/data/ce5627842/ab77cde15d574fbc94b7a56cbc097fd6/FLAGef400701b [2021-10-13 07:07:15,314 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 07:07:15,314 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/sv-benchmarks/c/forester-heap/sll-token-1.i [2021-10-13 07:07:15,335 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/data/ce5627842/ab77cde15d574fbc94b7a56cbc097fd6/FLAGef400701b [2021-10-13 07:07:15,568 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/data/ce5627842/ab77cde15d574fbc94b7a56cbc097fd6 [2021-10-13 07:07:15,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 07:07:15,574 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 07:07:15,579 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 07:07:15,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 07:07:15,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 07:07:15,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:07:15" (1/1) ... [2021-10-13 07:07:15,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14a62e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:07:15, skipping insertion in model container [2021-10-13 07:07:15,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:07:15" (1/1) ... [2021-10-13 07:07:15,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 07:07:15,642 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 07:07:16,026 WARN L228 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_9878c6b6-37ee-4d25-b57c-732033acaf04/sv-benchmarks/c/forester-heap/sll-token-1.i[22162,22175] [2021-10-13 07:07:16,032 WARN L228 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_9878c6b6-37ee-4d25-b57c-732033acaf04/sv-benchmarks/c/forester-heap/sll-token-1.i[22311,22324] [2021-10-13 07:07:16,034 WARN L228 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_9878c6b6-37ee-4d25-b57c-732033acaf04/sv-benchmarks/c/forester-heap/sll-token-1.i[22402,22415] [2021-10-13 07:07:16,035 WARN L228 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_9878c6b6-37ee-4d25-b57c-732033acaf04/sv-benchmarks/c/forester-heap/sll-token-1.i[22484,22497] [2021-10-13 07:07:16,037 WARN L228 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_9878c6b6-37ee-4d25-b57c-732033acaf04/sv-benchmarks/c/forester-heap/sll-token-1.i[22562,22575] [2021-10-13 07:07:16,040 WARN L228 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_9878c6b6-37ee-4d25-b57c-732033acaf04/sv-benchmarks/c/forester-heap/sll-token-1.i[22708,22721] [2021-10-13 07:07:16,043 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:07:16,053 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 07:07:16,126 WARN L228 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_9878c6b6-37ee-4d25-b57c-732033acaf04/sv-benchmarks/c/forester-heap/sll-token-1.i[22162,22175] [2021-10-13 07:07:16,128 WARN L228 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_9878c6b6-37ee-4d25-b57c-732033acaf04/sv-benchmarks/c/forester-heap/sll-token-1.i[22311,22324] [2021-10-13 07:07:16,131 WARN L228 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_9878c6b6-37ee-4d25-b57c-732033acaf04/sv-benchmarks/c/forester-heap/sll-token-1.i[22402,22415] [2021-10-13 07:07:16,134 WARN L228 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_9878c6b6-37ee-4d25-b57c-732033acaf04/sv-benchmarks/c/forester-heap/sll-token-1.i[22484,22497] [2021-10-13 07:07:16,136 WARN L228 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_9878c6b6-37ee-4d25-b57c-732033acaf04/sv-benchmarks/c/forester-heap/sll-token-1.i[22562,22575] [2021-10-13 07:07:16,141 WARN L228 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_9878c6b6-37ee-4d25-b57c-732033acaf04/sv-benchmarks/c/forester-heap/sll-token-1.i[22708,22721] [2021-10-13 07:07:16,146 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 07:07:16,183 INFO L208 MainTranslator]: Completed translation [2021-10-13 07:07:16,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:07:16 WrapperNode [2021-10-13 07:07:16,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 07:07:16,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 07:07:16,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 07:07:16,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 07:07:16,195 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:07:16" (1/1) ... [2021-10-13 07:07:16,224 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:07:16" (1/1) ... [2021-10-13 07:07:16,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 07:07:16,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 07:07:16,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 07:07:16,279 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 07:07:16,294 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:07:16" (1/1) ... [2021-10-13 07:07:16,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:07:16" (1/1) ... [2021-10-13 07:07:16,311 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:07:16" (1/1) ... [2021-10-13 07:07:16,314 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:07:16" (1/1) ... [2021-10-13 07:07:16,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:07:16" (1/1) ... [2021-10-13 07:07:16,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:07:16" (1/1) ... [2021-10-13 07:07:16,350 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:07:16" (1/1) ... [2021-10-13 07:07:16,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 07:07:16,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 07:07:16,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 07:07:16,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 07:07:16,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:07:16" (1/1) ... [2021-10-13 07:07:16,382 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 07:07:16,397 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 07:07:16,412 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 07:07:16,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 07:07:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 07:07:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 07:07:16,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 07:07:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 07:07:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 07:07:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 07:07:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 07:07:16,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 07:07:16,474 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 07:07:16,474 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 07:07:17,166 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 07:07:17,167 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-10-13 07:07:17,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:07:17 BoogieIcfgContainer [2021-10-13 07:07:17,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 07:07:17,171 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 07:07:17,172 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 07:07:17,175 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 07:07:17,175 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:07:15" (1/3) ... [2021-10-13 07:07:17,176 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343069b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:07:17, skipping insertion in model container [2021-10-13 07:07:17,176 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:07:16" (2/3) ... [2021-10-13 07:07:17,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@343069b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:07:17, skipping insertion in model container [2021-10-13 07:07:17,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:07:17" (3/3) ... [2021-10-13 07:07:17,178 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-token-1.i [2021-10-13 07:07:17,184 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 07:07:17,184 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2021-10-13 07:07:17,264 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 07:07:17,270 INFO L339 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, mConcurrency=FINITE_AUTOMATA, 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, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 07:07:17,271 INFO L340 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2021-10-13 07:07:17,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 53 states have (on average 2.4716981132075473) internal successors, (131), 107 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:17,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 07:07:17,294 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:07:17,295 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 07:07:17,295 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-13 07:07:17,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:07:17,301 INFO L82 PathProgramCache]: Analyzing trace with hash 8405, now seen corresponding path program 1 times [2021-10-13 07:07:17,310 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:07:17,311 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945706975] [2021-10-13 07:07:17,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:07:17,312 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:07:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:07:17,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:07:17,473 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:07:17,474 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945706975] [2021-10-13 07:07:17,475 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945706975] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:07:17,475 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:07:17,475 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 07:07:17,477 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422061288] [2021-10-13 07:07:17,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:07:17,482 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:07:17,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:07:17,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:07:17,499 INFO L87 Difference]: Start difference. First operand has 108 states, 53 states have (on average 2.4716981132075473) internal successors, (131), 107 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:17,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:07:17,621 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2021-10-13 07:07:17,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:07:17,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-13 07:07:17,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:07:17,632 INFO L225 Difference]: With dead ends: 126 [2021-10-13 07:07:17,632 INFO L226 Difference]: Without dead ends: 125 [2021-10-13 07:07:17,634 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:07:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-10-13 07:07:17,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2021-10-13 07:07:17,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 53 states have (on average 2.018867924528302) internal successors, (107), 104 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:17,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2021-10-13 07:07:17,701 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 2 [2021-10-13 07:07:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:07:17,702 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2021-10-13 07:07:17,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:17,703 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2021-10-13 07:07:17,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-13 07:07:17,704 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:07:17,704 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-13 07:07:17,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 07:07:17,705 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-13 07:07:17,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:07:17,712 INFO L82 PathProgramCache]: Analyzing trace with hash 8406, now seen corresponding path program 1 times [2021-10-13 07:07:17,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:07:17,715 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336564695] [2021-10-13 07:07:17,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:07:17,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:07:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:07:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:07:17,808 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:07:17,809 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336564695] [2021-10-13 07:07:17,809 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336564695] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:07:17,810 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:07:17,810 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 07:07:17,810 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228729456] [2021-10-13 07:07:17,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 07:07:17,811 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:07:17,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 07:07:17,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:07:17,813 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:17,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:07:17,898 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2021-10-13 07:07:17,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 07:07:17,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-13 07:07:17,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:07:17,900 INFO L225 Difference]: With dead ends: 131 [2021-10-13 07:07:17,901 INFO L226 Difference]: Without dead ends: 131 [2021-10-13 07:07:17,901 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 07:07:17,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-10-13 07:07:17,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 103. [2021-10-13 07:07:17,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 102 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:17,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2021-10-13 07:07:17,912 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 2 [2021-10-13 07:07:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:07:17,912 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2021-10-13 07:07:17,913 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:17,913 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2021-10-13 07:07:17,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 07:07:17,913 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:07:17,914 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 07:07:17,914 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 07:07:17,914 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-13 07:07:17,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:07:17,915 INFO L82 PathProgramCache]: Analyzing trace with hash -821381070, now seen corresponding path program 1 times [2021-10-13 07:07:17,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:07:17,916 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785555085] [2021-10-13 07:07:17,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:07:17,916 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:07:17,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:07:17,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:07:17,996 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:07:17,997 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785555085] [2021-10-13 07:07:17,997 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785555085] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:07:17,999 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:07:17,999 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:07:17,999 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779063296] [2021-10-13 07:07:18,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:07:18,000 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:07:18,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:07:18,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:07:18,002 INFO L87 Difference]: Start difference. First operand 103 states and 105 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:18,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:07:18,159 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2021-10-13 07:07:18,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:07:18,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-13 07:07:18,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:07:18,161 INFO L225 Difference]: With dead ends: 109 [2021-10-13 07:07:18,162 INFO L226 Difference]: Without dead ends: 109 [2021-10-13 07:07:18,162 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:07:18,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-10-13 07:07:18,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 92. [2021-10-13 07:07:18,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 91 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:18,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2021-10-13 07:07:18,186 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 6 [2021-10-13 07:07:18,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:07:18,186 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2021-10-13 07:07:18,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:18,187 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2021-10-13 07:07:18,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 07:07:18,188 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:07:18,188 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 07:07:18,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 07:07:18,189 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-13 07:07:18,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:07:18,190 INFO L82 PathProgramCache]: Analyzing trace with hash -821381069, now seen corresponding path program 1 times [2021-10-13 07:07:18,190 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:07:18,193 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554670738] [2021-10-13 07:07:18,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:07:18,194 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:07:18,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:07:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:07:18,258 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:07:18,258 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554670738] [2021-10-13 07:07:18,258 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554670738] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:07:18,258 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:07:18,258 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 07:07:18,259 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728124367] [2021-10-13 07:07:18,259 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:07:18,259 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:07:18,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:07:18,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:07:18,261 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:18,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:07:18,464 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2021-10-13 07:07:18,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 07:07:18,466 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-13 07:07:18,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:07:18,469 INFO L225 Difference]: With dead ends: 166 [2021-10-13 07:07:18,469 INFO L226 Difference]: Without dead ends: 166 [2021-10-13 07:07:18,470 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 28.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:07:18,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-10-13 07:07:18,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2021-10-13 07:07:18,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 82 states have (on average 1.5853658536585367) internal successors, (130), 118 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:18,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2021-10-13 07:07:18,494 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 6 [2021-10-13 07:07:18,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:07:18,495 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2021-10-13 07:07:18,495 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:18,495 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2021-10-13 07:07:18,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-13 07:07:18,496 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:07:18,496 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:07:18,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 07:07:18,497 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-13 07:07:18,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:07:18,499 INFO L82 PathProgramCache]: Analyzing trace with hash 927018906, now seen corresponding path program 1 times [2021-10-13 07:07:18,499 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:07:18,499 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659087604] [2021-10-13 07:07:18,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:07:18,500 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:07:18,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:07:18,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:07:18,590 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:07:18,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659087604] [2021-10-13 07:07:18,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659087604] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:07:18,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:07:18,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:07:18,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917915584] [2021-10-13 07:07:18,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:07:18,591 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:07:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:07:18,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:07:18,593 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:18,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:07:18,722 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2021-10-13 07:07:18,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:07:18,723 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-13 07:07:18,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:07:18,725 INFO L225 Difference]: With dead ends: 118 [2021-10-13 07:07:18,725 INFO L226 Difference]: Without dead ends: 118 [2021-10-13 07:07:18,725 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 21.3ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:07:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-10-13 07:07:18,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-10-13 07:07:18,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 117 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:18,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2021-10-13 07:07:18,731 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 8 [2021-10-13 07:07:18,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:07:18,732 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2021-10-13 07:07:18,736 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:18,736 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2021-10-13 07:07:18,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-13 07:07:18,737 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:07:18,737 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:07:18,737 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 07:07:18,737 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-13 07:07:18,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:07:18,738 INFO L82 PathProgramCache]: Analyzing trace with hash 927018907, now seen corresponding path program 1 times [2021-10-13 07:07:18,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:07:18,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027890064] [2021-10-13 07:07:18,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:07:18,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:07:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:07:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:07:18,898 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:07:18,899 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027890064] [2021-10-13 07:07:18,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027890064] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:07:18,899 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:07:18,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:07:18,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500643507] [2021-10-13 07:07:18,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:07:18,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:07:18,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:07:18,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:07:18,906 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:19,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:07:19,093 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2021-10-13 07:07:19,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:07:19,094 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-13 07:07:19,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:07:19,095 INFO L225 Difference]: With dead ends: 115 [2021-10-13 07:07:19,095 INFO L226 Difference]: Without dead ends: 115 [2021-10-13 07:07:19,096 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 46.7ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:07:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-10-13 07:07:19,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2021-10-13 07:07:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 104 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:19,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2021-10-13 07:07:19,099 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 8 [2021-10-13 07:07:19,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:07:19,100 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2021-10-13 07:07:19,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:19,100 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2021-10-13 07:07:19,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 07:07:19,101 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:07:19,101 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:07:19,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 07:07:19,101 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-13 07:07:19,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:07:19,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1329117493, now seen corresponding path program 1 times [2021-10-13 07:07:19,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:07:19,102 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685689] [2021-10-13 07:07:19,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:07:19,103 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:07:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:07:19,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:07:19,156 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:07:19,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685689] [2021-10-13 07:07:19,157 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685689] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:07:19,157 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:07:19,157 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:07:19,157 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374297505] [2021-10-13 07:07:19,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:07:19,158 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:07:19,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:07:19,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:07:19,159 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:19,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:07:19,268 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2021-10-13 07:07:19,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:07:19,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-13 07:07:19,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:07:19,270 INFO L225 Difference]: With dead ends: 104 [2021-10-13 07:07:19,270 INFO L226 Difference]: Without dead ends: 104 [2021-10-13 07:07:19,270 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:07:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-13 07:07:19,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-10-13 07:07:19,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.52) internal successors, (114), 103 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:19,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2021-10-13 07:07:19,273 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 9 [2021-10-13 07:07:19,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:07:19,274 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2021-10-13 07:07:19,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:19,274 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2021-10-13 07:07:19,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-13 07:07:19,275 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:07:19,275 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:07:19,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 07:07:19,275 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-13 07:07:19,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:07:19,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1329117492, now seen corresponding path program 1 times [2021-10-13 07:07:19,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:07:19,276 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134275008] [2021-10-13 07:07:19,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:07:19,276 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:07:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:07:19,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:07:19,342 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:07:19,342 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134275008] [2021-10-13 07:07:19,342 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134275008] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:07:19,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:07:19,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 07:07:19,343 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584326413] [2021-10-13 07:07:19,343 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:07:19,343 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:07:19,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:07:19,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:07:19,344 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:19,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:07:19,458 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-10-13 07:07:19,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:07:19,463 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-13 07:07:19,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:07:19,464 INFO L225 Difference]: With dead ends: 103 [2021-10-13 07:07:19,465 INFO L226 Difference]: Without dead ends: 103 [2021-10-13 07:07:19,465 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 26.4ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 07:07:19,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-10-13 07:07:19,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-10-13 07:07:19,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 102 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2021-10-13 07:07:19,469 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 9 [2021-10-13 07:07:19,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:07:19,469 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2021-10-13 07:07:19,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:19,470 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2021-10-13 07:07:19,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-13 07:07:19,472 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:07:19,474 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:07:19,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 07:07:19,475 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-13 07:07:19,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:07:19,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1806938586, now seen corresponding path program 1 times [2021-10-13 07:07:19,476 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:07:19,476 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282997738] [2021-10-13 07:07:19,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:07:19,476 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:07:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:07:19,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:07:19,580 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:07:19,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282997738] [2021-10-13 07:07:19,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282997738] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:07:19,581 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:07:19,581 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 07:07:19,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303973532] [2021-10-13 07:07:19,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 07:07:19,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:07:19,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 07:07:19,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:07:19,583 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:19,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:07:19,702 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2021-10-13 07:07:19,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 07:07:19,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-13 07:07:19,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:07:19,703 INFO L225 Difference]: With dead ends: 109 [2021-10-13 07:07:19,703 INFO L226 Difference]: Without dead ends: 109 [2021-10-13 07:07:19,704 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.3ms TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-13 07:07:19,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-10-13 07:07:19,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2021-10-13 07:07:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.5) internal successors, (111), 100 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:19,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2021-10-13 07:07:19,707 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 10 [2021-10-13 07:07:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:07:19,708 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2021-10-13 07:07:19,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2021-10-13 07:07:19,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 07:07:19,709 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:07:19,709 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:07:19,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 07:07:19,709 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-13 07:07:19,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:07:19,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1676451459, now seen corresponding path program 1 times [2021-10-13 07:07:19,710 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:07:19,710 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926256344] [2021-10-13 07:07:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:07:19,710 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:07:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 07:07:19,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 07:07:19,751 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 07:07:19,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926256344] [2021-10-13 07:07:19,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926256344] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 07:07:19,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 07:07:19,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-13 07:07:19,752 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563765773] [2021-10-13 07:07:19,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 07:07:19,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 07:07:19,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 07:07:19,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 07:07:19,754 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 07:07:19,876 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2021-10-13 07:07:19,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 07:07:19,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-13 07:07:19,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 07:07:19,878 INFO L225 Difference]: With dead ends: 150 [2021-10-13 07:07:19,878 INFO L226 Difference]: Without dead ends: 150 [2021-10-13 07:07:19,879 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 07:07:19,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-10-13 07:07:19,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 99. [2021-10-13 07:07:19,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 98 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2021-10-13 07:07:19,885 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 11 [2021-10-13 07:07:19,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 07:07:19,885 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2021-10-13 07:07:19,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 07:07:19,886 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2021-10-13 07:07:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-13 07:07:19,888 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 07:07:19,888 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 07:07:19,888 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 07:07:19,889 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-13 07:07:19,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 07:07:19,889 INFO L82 PathProgramCache]: Analyzing trace with hash 935207482, now seen corresponding path program 1 times [2021-10-13 07:07:19,889 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 07:07:19,890 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785460412] [2021-10-13 07:07:19,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 07:07:19,890 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 07:07:19,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:07:19,936 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 07:07:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 07:07:20,029 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-13 07:07:20,030 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 07:07:20,031 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:07:20,033 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-13 07:07:20,034 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-13 07:07:20,034 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-13 07:07:20,034 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-13 07:07:20,034 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-13 07:07:20,035 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-13 07:07:20,035 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-13 07:07:20,035 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-13 07:07:20,035 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-13 07:07:20,036 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-13 07:07:20,036 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:07:20,036 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-13 07:07:20,036 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-13 07:07:20,037 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-13 07:07:20,037 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-13 07:07:20,037 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-13 07:07:20,038 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-13 07:07:20,038 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-13 07:07:20,038 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-13 07:07:20,038 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:07:20,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-13 07:07:20,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-13 07:07:20,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-13 07:07:20,039 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-13 07:07:20,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:07:20,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-13 07:07:20,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-13 07:07:20,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-13 07:07:20,040 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-13 07:07:20,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-13 07:07:20,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-13 07:07:20,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-13 07:07:20,041 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-13 07:07:20,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:07:20,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-13 07:07:20,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-13 07:07:20,042 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-13 07:07:20,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-13 07:07:20,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:07:20,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:07:20,043 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:07:20,044 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-13 07:07:20,044 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-13 07:07:20,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:07:20,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-13 07:07:20,045 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-13 07:07:20,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:07:20,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:07:20,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:07:20,046 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:07:20,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:07:20,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 07:07:20,047 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 07:07:20,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 07:07:20,056 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 07:07:20,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 07:07:20 BoogieIcfgContainer [2021-10-13 07:07:20,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 07:07:20,096 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 07:07:20,096 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 07:07:20,097 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 07:07:20,097 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:07:17" (3/4) ... [2021-10-13 07:07:20,100 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 07:07:20,143 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 07:07:20,143 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 07:07:20,145 INFO L168 Benchmark]: Toolchain (without parser) took 4569.16 ms. Allocated memory was 98.6 MB in the beginning and 132.1 MB in the end (delta: 33.6 MB). Free memory was 62.3 MB in the beginning and 67.2 MB in the end (delta: -4.9 MB). Peak memory consumption was 26.7 MB. Max. memory is 16.1 GB. [2021-10-13 07:07:20,146 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 98.6 MB. Free memory was 70.3 MB in the beginning and 70.2 MB in the end (delta: 26.1 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:07:20,146 INFO L168 Benchmark]: CACSL2BoogieTranslator took 605.83 ms. Allocated memory is still 98.6 MB. Free memory was 62.0 MB in the beginning and 66.4 MB in the end (delta: -4.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-13 07:07:20,147 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.44 ms. Allocated memory is still 98.6 MB. Free memory was 66.4 MB in the beginning and 64.3 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 07:07:20,148 INFO L168 Benchmark]: Boogie Preprocessor took 76.40 ms. Allocated memory is still 98.6 MB. Free memory was 64.3 MB in the beginning and 62.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-13 07:07:20,148 INFO L168 Benchmark]: RCFGBuilder took 813.92 ms. Allocated memory is still 98.6 MB. Free memory was 62.3 MB in the beginning and 41.3 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-13 07:07:20,149 INFO L168 Benchmark]: TraceAbstraction took 2924.29 ms. Allocated memory was 98.6 MB in the beginning and 132.1 MB in the end (delta: 33.6 MB). Free memory was 40.9 MB in the beginning and 69.3 MB in the end (delta: -28.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-13 07:07:20,149 INFO L168 Benchmark]: Witness Printer took 46.95 ms. Allocated memory is still 132.1 MB. Free memory was 69.3 MB in the beginning and 67.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 07:07:20,152 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.29 ms. Allocated memory is still 98.6 MB. Free memory was 70.3 MB in the beginning and 70.2 MB in the end (delta: 26.1 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 605.83 ms. Allocated memory is still 98.6 MB. Free memory was 62.0 MB in the beginning and 66.4 MB in the end (delta: -4.3 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 92.44 ms. Allocated memory is still 98.6 MB. Free memory was 66.4 MB in the beginning and 64.3 MB in the end (delta: 2.1 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 76.40 ms. Allocated memory is still 98.6 MB. Free memory was 64.3 MB in the beginning and 62.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 813.92 ms. Allocated memory is still 98.6 MB. Free memory was 62.3 MB in the beginning and 41.3 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 2924.29 ms. Allocated memory was 98.6 MB in the beginning and 132.1 MB in the end (delta: 33.6 MB). Free memory was 40.9 MB in the beginning and 69.3 MB in the end (delta: -28.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Witness Printer took 46.95 ms. Allocated memory is still 132.1 MB. Free memory was 69.3 MB in the beginning and 67.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1031]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* head = malloc(sizeof(SLL)); [L1004] head->next = ((void*)0) [L1005] head->data = 0 [L1007] SLL* x = head; [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x->data = 1 [L1019] x->next = malloc(sizeof(SLL)) [L1020] EXPR x->next [L1020] x->next->data = 2 [L1022] x = head [L1024] COND FALSE !(!(((void*)0) != x)) [L1026] EXPR x->data [L1026] COND FALSE !(1 != x->data) [L1031] EXPR x->data [L1031] COND TRUE !(2 == x->data) [L1031] reach_error() - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 54 error locations. Started 1 CEGAR loops. OverallTime: 2803.4ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 18.1ms, AutomataDifference: 1423.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 13.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 656 SDtfs, 711 SDslu, 827 SDs, 0 SdLazy, 1009 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 891.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 199.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=4, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 124.4ms AutomataMinimizationTime, 10 MinimizatonAttempts, 181 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 35.4ms SsaConstructionTime, 217.6ms SatisfiabilityAnalysisTime, 585.8ms InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-13 07:07:20,204 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9878c6b6-37ee-4d25-b57c-732033acaf04/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...