./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 57096758 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs --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 54165abed718b8d39f88748583b76365fb540324 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-5709675 [2021-10-16 02:34:19,130 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-16 02:34:19,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-16 02:34:19,169 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-16 02:34:19,170 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-16 02:34:19,171 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-16 02:34:19,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-16 02:34:19,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-16 02:34:19,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-16 02:34:19,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-16 02:34:19,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-16 02:34:19,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-16 02:34:19,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-16 02:34:19,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-16 02:34:19,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-16 02:34:19,187 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-16 02:34:19,188 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-16 02:34:19,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-16 02:34:19,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-16 02:34:19,195 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-16 02:34:19,198 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-16 02:34:19,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-16 02:34:19,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-16 02:34:19,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-16 02:34:19,207 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-16 02:34:19,207 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-16 02:34:19,208 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-16 02:34:19,209 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-16 02:34:19,210 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-16 02:34:19,211 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-16 02:34:19,212 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-16 02:34:19,213 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-16 02:34:19,214 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-16 02:34:19,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-16 02:34:19,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-16 02:34:19,224 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-16 02:34:19,225 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-16 02:34:19,226 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-16 02:34:19,227 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-16 02:34:19,228 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-16 02:34:19,228 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-16 02:34:19,229 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-10-16 02:34:19,295 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-16 02:34:19,297 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-16 02:34:19,304 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-16 02:34:19,305 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-16 02:34:19,305 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-16 02:34:19,305 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-16 02:34:19,305 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-16 02:34:19,305 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-16 02:34:19,305 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-16 02:34:19,305 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-16 02:34:19,306 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-16 02:34:19,306 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-16 02:34:19,306 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-16 02:34:19,306 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-16 02:34:19,306 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-16 02:34:19,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-16 02:34:19,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-16 02:34:19,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-16 02:34:19,308 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-16 02:34:19,308 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-16 02:34:19,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-16 02:34:19,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-16 02:34:19,309 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-16 02:34:19,309 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-16 02:34:19,309 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-16 02:34:19,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-16 02:34:19,310 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-16 02:34:19,310 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-16 02:34:19,310 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-16 02:34:19,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-16 02:34:19,311 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-16 02:34:19,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:34:19,311 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-16 02:34:19,311 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-16 02:34:19,320 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-16 02:34:19,320 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-16 02:34:19,320 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-16 02:34:19,321 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-16 02:34:19,321 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_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/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_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs 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 -> 54165abed718b8d39f88748583b76365fb540324 [2021-10-16 02:34:19,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-16 02:34:19,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-16 02:34:19,616 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-16 02:34:19,617 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-16 02:34:19,618 INFO L275 PluginConnector]: CDTParser initialized [2021-10-16 02:34:19,620 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-10-16 02:34:19,714 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/data/45a537cb4/6e4c10ba6e8049f28e131bfa80fae47d/FLAGf6d9aa04a [2021-10-16 02:34:20,348 INFO L306 CDTParser]: Found 1 translation units. [2021-10-16 02:34:20,349 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-10-16 02:34:20,366 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/data/45a537cb4/6e4c10ba6e8049f28e131bfa80fae47d/FLAGf6d9aa04a [2021-10-16 02:34:20,623 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/data/45a537cb4/6e4c10ba6e8049f28e131bfa80fae47d [2021-10-16 02:34:20,626 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-16 02:34:20,628 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-16 02:34:20,632 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-16 02:34:20,633 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-16 02:34:20,637 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-16 02:34:20,638 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:34:20" (1/1) ... [2021-10-16 02:34:20,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ce5845c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:20, skipping insertion in model container [2021-10-16 02:34:20,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 02:34:20" (1/1) ... [2021-10-16 02:34:20,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-16 02:34:20,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-16 02:34:21,049 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_8a6b869a-e31a-4084-bf09-144e6e1734c7/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-10-16 02:34:21,080 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:34:21,089 INFO L203 MainTranslator]: Completed pre-run [2021-10-16 02:34:21,130 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_8a6b869a-e31a-4084-bf09-144e6e1734c7/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-10-16 02:34:21,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-16 02:34:21,197 INFO L208 MainTranslator]: Completed translation [2021-10-16 02:34:21,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:21 WrapperNode [2021-10-16 02:34:21,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-16 02:34:21,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-16 02:34:21,199 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-16 02:34:21,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-16 02:34:21,208 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:21" (1/1) ... [2021-10-16 02:34:21,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:21" (1/1) ... [2021-10-16 02:34:21,310 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-16 02:34:21,313 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-16 02:34:21,314 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-16 02:34:21,314 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-16 02:34:21,325 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:21" (1/1) ... [2021-10-16 02:34:21,325 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:21" (1/1) ... [2021-10-16 02:34:21,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:21" (1/1) ... [2021-10-16 02:34:21,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:21" (1/1) ... [2021-10-16 02:34:21,362 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:21" (1/1) ... [2021-10-16 02:34:21,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:21" (1/1) ... [2021-10-16 02:34:21,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:21" (1/1) ... [2021-10-16 02:34:21,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-16 02:34:21,383 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-16 02:34:21,383 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-16 02:34:21,383 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-16 02:34:21,387 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:21" (1/1) ... [2021-10-16 02:34:21,406 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-16 02:34:21,420 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/z3 [2021-10-16 02:34:21,441 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-16 02:34:21,456 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-16 02:34:21,496 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-16 02:34:21,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-16 02:34:21,496 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-16 02:34:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-16 02:34:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-16 02:34:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-16 02:34:21,497 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-16 02:34:21,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-16 02:34:21,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-16 02:34:21,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-16 02:34:22,864 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-16 02:34:22,865 INFO L299 CfgBuilder]: Removed 75 assume(true) statements. [2021-10-16 02:34:22,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:34:22 BoogieIcfgContainer [2021-10-16 02:34:22,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-16 02:34:22,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-16 02:34:22,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-16 02:34:22,876 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-16 02:34:22,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 02:34:20" (1/3) ... [2021-10-16 02:34:22,878 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75edbe5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:34:22, skipping insertion in model container [2021-10-16 02:34:22,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 02:34:21" (2/3) ... [2021-10-16 02:34:22,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75edbe5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 02:34:22, skipping insertion in model container [2021-10-16 02:34:22,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:34:22" (3/3) ... [2021-10-16 02:34:22,881 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2021-10-16 02:34:22,888 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-16 02:34:22,888 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 131 error locations. [2021-10-16 02:34:22,946 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-16 02:34:22,953 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-16 02:34:22,954 INFO L340 AbstractCegarLoop]: Starting to check reachability of 131 error locations. [2021-10-16 02:34:22,982 INFO L276 IsEmpty]: Start isEmpty. Operand has 255 states, 123 states have (on average 2.5284552845528454) internal successors, (311), 254 states have internal predecessors, (311), 0 states have call successors, (0), 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-16 02:34:22,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-16 02:34:22,990 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:22,991 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-16 02:34:22,992 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:22,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:22,999 INFO L82 PathProgramCache]: Analyzing trace with hash 19122463, now seen corresponding path program 1 times [2021-10-16 02:34:23,012 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:23,013 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116308631] [2021-10-16 02:34:23,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:23,014 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:23,203 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-16 02:34:23,204 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:23,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116308631] [2021-10-16 02:34:23,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116308631] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:23,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:23,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:34:23,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232173513] [2021-10-16 02:34:23,214 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:34:23,214 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:23,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:34:23,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:23,234 INFO L87 Difference]: Start difference. First operand has 255 states, 123 states have (on average 2.5284552845528454) internal successors, (311), 254 states have internal predecessors, (311), 0 states have call successors, (0), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-16 02:34:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:23,749 INFO L93 Difference]: Finished difference Result 473 states and 496 transitions. [2021-10-16 02:34:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:34:23,751 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-10-16 02:34:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:23,787 INFO L225 Difference]: With dead ends: 473 [2021-10-16 02:34:23,787 INFO L226 Difference]: Without dead ends: 471 [2021-10-16 02:34:23,789 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:23,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-10-16 02:34:23,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 252. [2021-10-16 02:34:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 123 states have (on average 2.1463414634146343) internal successors, (264), 251 states have internal predecessors, (264), 0 states have call successors, (0), 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-16 02:34:23,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2021-10-16 02:34:23,882 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 4 [2021-10-16 02:34:23,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:23,884 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2021-10-16 02:34:23,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-16 02:34:23,885 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2021-10-16 02:34:23,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-16 02:34:23,886 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:23,886 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-16 02:34:23,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-16 02:34:23,887 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:23,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:23,891 INFO L82 PathProgramCache]: Analyzing trace with hash 19122464, now seen corresponding path program 1 times [2021-10-16 02:34:23,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:23,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961408880] [2021-10-16 02:34:23,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:23,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:23,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:23,999 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-16 02:34:24,000 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:24,000 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961408880] [2021-10-16 02:34:24,000 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961408880] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:24,001 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:24,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:34:24,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784550688] [2021-10-16 02:34:24,003 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:34:24,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:24,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:34:24,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:24,005 INFO L87 Difference]: Start difference. First operand 252 states and 264 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-16 02:34:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:24,344 INFO L93 Difference]: Finished difference Result 397 states and 416 transitions. [2021-10-16 02:34:24,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:34:24,346 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2021-10-16 02:34:24,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:24,351 INFO L225 Difference]: With dead ends: 397 [2021-10-16 02:34:24,351 INFO L226 Difference]: Without dead ends: 397 [2021-10-16 02:34:24,352 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:24,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-10-16 02:34:24,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 250. [2021-10-16 02:34:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 123 states have (on average 2.130081300813008) internal successors, (262), 249 states have internal predecessors, (262), 0 states have call successors, (0), 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-16 02:34:24,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 262 transitions. [2021-10-16 02:34:24,395 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 262 transitions. Word has length 4 [2021-10-16 02:34:24,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:24,395 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 262 transitions. [2021-10-16 02:34:24,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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-16 02:34:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 262 transitions. [2021-10-16 02:34:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-16 02:34:24,397 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:24,398 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-16 02:34:24,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-16 02:34:24,403 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:24,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:24,405 INFO L82 PathProgramCache]: Analyzing trace with hash 592197104, now seen corresponding path program 1 times [2021-10-16 02:34:24,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:24,406 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906608939] [2021-10-16 02:34:24,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:24,408 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:24,444 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-16 02:34:24,444 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:24,445 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906608939] [2021-10-16 02:34:24,445 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906608939] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:24,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:24,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-16 02:34:24,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418778875] [2021-10-16 02:34:24,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:34:24,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:24,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:34:24,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:24,448 INFO L87 Difference]: Start difference. First operand 250 states and 262 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-16 02:34:24,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:24,704 INFO L93 Difference]: Finished difference Result 386 states and 404 transitions. [2021-10-16 02:34:24,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:34:24,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2021-10-16 02:34:24,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:24,709 INFO L225 Difference]: With dead ends: 386 [2021-10-16 02:34:24,709 INFO L226 Difference]: Without dead ends: 385 [2021-10-16 02:34:24,709 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:24,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-10-16 02:34:24,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 253. [2021-10-16 02:34:24,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 126 states have (on average 2.111111111111111) internal successors, (266), 252 states have internal predecessors, (266), 0 states have call successors, (0), 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-16 02:34:24,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 266 transitions. [2021-10-16 02:34:24,730 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 266 transitions. Word has length 5 [2021-10-16 02:34:24,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:24,730 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 266 transitions. [2021-10-16 02:34:24,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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-16 02:34:24,731 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 266 transitions. [2021-10-16 02:34:24,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-16 02:34:24,731 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:24,732 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-16 02:34:24,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-16 02:34:24,732 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:24,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:24,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1178226029, now seen corresponding path program 1 times [2021-10-16 02:34:24,733 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:24,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889179280] [2021-10-16 02:34:24,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:24,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:24,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:24,806 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-16 02:34:24,807 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:24,807 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889179280] [2021-10-16 02:34:24,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889179280] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:24,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:24,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:34:24,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429466930] [2021-10-16 02:34:24,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:34:24,815 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:24,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:34:24,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:24,817 INFO L87 Difference]: Start difference. First operand 253 states and 266 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-16 02:34:24,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:24,844 INFO L93 Difference]: Finished difference Result 263 states and 274 transitions. [2021-10-16 02:34:24,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:34:24,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-16 02:34:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:24,847 INFO L225 Difference]: With dead ends: 263 [2021-10-16 02:34:24,848 INFO L226 Difference]: Without dead ends: 262 [2021-10-16 02:34:24,849 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:24,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-16 02:34:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 252. [2021-10-16 02:34:24,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 125 states have (on average 2.112) internal successors, (264), 251 states have internal predecessors, (264), 0 states have call successors, (0), 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-16 02:34:24,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2021-10-16 02:34:24,865 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 6 [2021-10-16 02:34:24,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:24,866 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2021-10-16 02:34:24,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-16 02:34:24,867 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2021-10-16 02:34:24,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-16 02:34:24,868 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:24,868 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-16 02:34:24,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-16 02:34:24,868 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:24,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:24,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1197398764, now seen corresponding path program 1 times [2021-10-16 02:34:24,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:24,871 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373069545] [2021-10-16 02:34:24,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:24,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:24,957 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-16 02:34:24,957 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:24,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373069545] [2021-10-16 02:34:24,958 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373069545] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:24,958 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:24,958 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:34:24,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229017672] [2021-10-16 02:34:24,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:34:24,960 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:24,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:34:24,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:24,961 INFO L87 Difference]: Start difference. First operand 252 states and 264 transitions. Second operand has 3 states, 2 states have (on average 3.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-16 02:34:25,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:25,228 INFO L93 Difference]: Finished difference Result 401 states and 421 transitions. [2021-10-16 02:34:25,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:34:25,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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-16 02:34:25,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:25,232 INFO L225 Difference]: With dead ends: 401 [2021-10-16 02:34:25,232 INFO L226 Difference]: Without dead ends: 401 [2021-10-16 02:34:25,233 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:25,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-10-16 02:34:25,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 250. [2021-10-16 02:34:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 125 states have (on average 2.096) internal successors, (262), 249 states have internal predecessors, (262), 0 states have call successors, (0), 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-16 02:34:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 262 transitions. [2021-10-16 02:34:25,242 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 262 transitions. Word has length 6 [2021-10-16 02:34:25,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:25,242 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 262 transitions. [2021-10-16 02:34:25,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-16 02:34:25,243 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 262 transitions. [2021-10-16 02:34:25,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-16 02:34:25,243 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:25,243 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-16 02:34:25,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-16 02:34:25,244 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:25,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:25,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1197398765, now seen corresponding path program 1 times [2021-10-16 02:34:25,245 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:25,245 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529644039] [2021-10-16 02:34:25,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:25,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:25,324 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-16 02:34:25,324 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:25,324 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529644039] [2021-10-16 02:34:25,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529644039] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:25,325 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:25,330 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-16 02:34:25,330 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020301918] [2021-10-16 02:34:25,331 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-16 02:34:25,331 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:25,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-16 02:34:25,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:25,332 INFO L87 Difference]: Start difference. First operand 250 states and 262 transitions. Second operand has 3 states, 2 states have (on average 3.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-16 02:34:25,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:25,560 INFO L93 Difference]: Finished difference Result 327 states and 343 transitions. [2021-10-16 02:34:25,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-16 02:34:25,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.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-16 02:34:25,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:25,563 INFO L225 Difference]: With dead ends: 327 [2021-10-16 02:34:25,563 INFO L226 Difference]: Without dead ends: 327 [2021-10-16 02:34:25,564 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-16 02:34:25,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-10-16 02:34:25,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 248. [2021-10-16 02:34:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 125 states have (on average 2.08) internal successors, (260), 247 states have internal predecessors, (260), 0 states have call successors, (0), 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-16 02:34:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 260 transitions. [2021-10-16 02:34:25,572 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 260 transitions. Word has length 6 [2021-10-16 02:34:25,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:25,573 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 260 transitions. [2021-10-16 02:34:25,573 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.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-16 02:34:25,573 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 260 transitions. [2021-10-16 02:34:25,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-16 02:34:25,574 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:25,574 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:25,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-16 02:34:25,575 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:25,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:25,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1465193814, now seen corresponding path program 1 times [2021-10-16 02:34:25,576 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:25,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421989225] [2021-10-16 02:34:25,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:25,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:25,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:25,668 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:25,668 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421989225] [2021-10-16 02:34:25,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421989225] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:25,668 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:25,669 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:34:25,669 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123377980] [2021-10-16 02:34:25,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-16 02:34:25,670 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:25,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-16 02:34:25,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-16 02:34:25,671 INFO L87 Difference]: Start difference. First operand 248 states and 260 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-16 02:34:25,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:25,729 INFO L93 Difference]: Finished difference Result 422 states and 443 transitions. [2021-10-16 02:34:25,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-16 02:34:25,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-16 02:34:25,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:25,733 INFO L225 Difference]: With dead ends: 422 [2021-10-16 02:34:25,733 INFO L226 Difference]: Without dead ends: 422 [2021-10-16 02:34:25,733 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:34:25,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-10-16 02:34:25,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 248. [2021-10-16 02:34:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 125 states have (on average 2.072) internal successors, (259), 247 states have internal predecessors, (259), 0 states have call successors, (0), 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-16 02:34:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 259 transitions. [2021-10-16 02:34:25,743 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 259 transitions. Word has length 11 [2021-10-16 02:34:25,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:25,744 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 259 transitions. [2021-10-16 02:34:25,744 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-16 02:34:25,744 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 259 transitions. [2021-10-16 02:34:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-16 02:34:25,745 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:25,745 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:25,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-16 02:34:25,746 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:25,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:25,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1823647033, now seen corresponding path program 1 times [2021-10-16 02:34:25,747 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:25,747 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349126494] [2021-10-16 02:34:25,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:25,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:25,798 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:25,798 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349126494] [2021-10-16 02:34:25,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349126494] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:25,799 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:25,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 02:34:25,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354720919] [2021-10-16 02:34:25,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:34:25,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:25,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:34:25,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:34:25,801 INFO L87 Difference]: Start difference. First operand 248 states and 259 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-16 02:34:25,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:25,962 INFO L93 Difference]: Finished difference Result 820 states and 861 transitions. [2021-10-16 02:34:25,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-16 02:34:25,963 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2021-10-16 02:34:25,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:25,968 INFO L225 Difference]: With dead ends: 820 [2021-10-16 02:34:25,968 INFO L226 Difference]: Without dead ends: 820 [2021-10-16 02:34:25,968 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 24.1ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-16 02:34:25,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-10-16 02:34:25,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 250. [2021-10-16 02:34:25,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 128 states have (on average 2.0625) internal successors, (264), 249 states have internal predecessors, (264), 0 states have call successors, (0), 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-16 02:34:25,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 264 transitions. [2021-10-16 02:34:25,979 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 264 transitions. Word has length 12 [2021-10-16 02:34:25,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:25,979 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 264 transitions. [2021-10-16 02:34:25,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 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-16 02:34:25,979 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 264 transitions. [2021-10-16 02:34:25,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-16 02:34:25,980 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:25,980 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:25,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-16 02:34:25,981 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:25,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:25,981 INFO L82 PathProgramCache]: Analyzing trace with hash -698477090, now seen corresponding path program 1 times [2021-10-16 02:34:25,981 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:25,981 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733661229] [2021-10-16 02:34:25,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:25,982 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:25,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:26,027 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:26,028 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:26,028 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733661229] [2021-10-16 02:34:26,028 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733661229] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:26,028 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:26,028 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:34:26,029 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580312504] [2021-10-16 02:34:26,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:34:26,029 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:26,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:34:26,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:34:26,030 INFO L87 Difference]: Start difference. First operand 250 states and 264 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-16 02:34:26,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:26,635 INFO L93 Difference]: Finished difference Result 490 states and 518 transitions. [2021-10-16 02:34:26,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-16 02:34:26,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-10-16 02:34:26,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:26,647 INFO L225 Difference]: With dead ends: 490 [2021-10-16 02:34:26,647 INFO L226 Difference]: Without dead ends: 490 [2021-10-16 02:34:26,648 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 25.8ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-16 02:34:26,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-10-16 02:34:26,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 242. [2021-10-16 02:34:26,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 129 states have (on average 1.9844961240310077) internal successors, (256), 241 states have internal predecessors, (256), 0 states have call successors, (0), 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-16 02:34:26,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 256 transitions. [2021-10-16 02:34:26,657 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 256 transitions. Word has length 13 [2021-10-16 02:34:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:26,658 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 256 transitions. [2021-10-16 02:34:26,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-16 02:34:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 256 transitions. [2021-10-16 02:34:26,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-16 02:34:26,659 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:26,659 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:26,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-16 02:34:26,659 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:26,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:26,660 INFO L82 PathProgramCache]: Analyzing trace with hash -698477089, now seen corresponding path program 1 times [2021-10-16 02:34:26,660 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:26,660 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909330622] [2021-10-16 02:34:26,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:26,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:26,759 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:26,760 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909330622] [2021-10-16 02:34:26,760 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909330622] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:26,760 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:26,760 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-16 02:34:26,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646414583] [2021-10-16 02:34:26,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:34:26,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:26,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:34:26,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:34:26,764 INFO L87 Difference]: Start difference. First operand 242 states and 256 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-16 02:34:27,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:27,237 INFO L93 Difference]: Finished difference Result 576 states and 604 transitions. [2021-10-16 02:34:27,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-16 02:34:27,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2021-10-16 02:34:27,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:27,241 INFO L225 Difference]: With dead ends: 576 [2021-10-16 02:34:27,242 INFO L226 Difference]: Without dead ends: 576 [2021-10-16 02:34:27,242 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 51.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-16 02:34:27,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-10-16 02:34:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 282. [2021-10-16 02:34:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 169 states have (on average 1.8875739644970415) internal successors, (319), 281 states have internal predecessors, (319), 0 states have call successors, (0), 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-16 02:34:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 319 transitions. [2021-10-16 02:34:27,253 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 319 transitions. Word has length 13 [2021-10-16 02:34:27,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:27,254 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 319 transitions. [2021-10-16 02:34:27,254 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 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-16 02:34:27,254 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 319 transitions. [2021-10-16 02:34:27,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-16 02:34:27,255 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:27,255 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:27,255 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-16 02:34:27,255 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:27,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:27,256 INFO L82 PathProgramCache]: Analyzing trace with hash 804274739, now seen corresponding path program 1 times [2021-10-16 02:34:27,256 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:27,256 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288557848] [2021-10-16 02:34:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:27,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:27,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:27,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-16 02:34:27,311 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:27,311 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288557848] [2021-10-16 02:34:27,311 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288557848] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:27,311 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:27,311 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 02:34:27,311 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067963981] [2021-10-16 02:34:27,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:34:27,312 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:27,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:34:27,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:34:27,313 INFO L87 Difference]: Start difference. First operand 282 states and 319 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-16 02:34:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:27,514 INFO L93 Difference]: Finished difference Result 358 states and 398 transitions. [2021-10-16 02:34:27,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:34:27,515 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 19 [2021-10-16 02:34:27,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:27,517 INFO L225 Difference]: With dead ends: 358 [2021-10-16 02:34:27,518 INFO L226 Difference]: Without dead ends: 358 [2021-10-16 02:34:27,518 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.9ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:34:27,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-10-16 02:34:27,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 280. [2021-10-16 02:34:27,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 168 states have (on average 1.880952380952381) internal successors, (316), 279 states have internal predecessors, (316), 0 states have call successors, (0), 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-16 02:34:27,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 316 transitions. [2021-10-16 02:34:27,527 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 316 transitions. Word has length 19 [2021-10-16 02:34:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:27,528 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 316 transitions. [2021-10-16 02:34:27,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-16 02:34:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 316 transitions. [2021-10-16 02:34:27,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-16 02:34:27,529 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:27,529 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:27,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-16 02:34:27,530 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:27,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:27,530 INFO L82 PathProgramCache]: Analyzing trace with hash 770874066, now seen corresponding path program 1 times [2021-10-16 02:34:27,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:27,531 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276443779] [2021-10-16 02:34:27,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:27,531 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:27,624 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-16 02:34:27,624 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:27,625 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276443779] [2021-10-16 02:34:27,625 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276443779] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:27,625 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:27,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-16 02:34:27,625 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060482261] [2021-10-16 02:34:27,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-16 02:34:27,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:27,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-16 02:34:27,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-16 02:34:27,627 INFO L87 Difference]: Start difference. First operand 280 states and 316 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-16 02:34:27,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:27,815 INFO L93 Difference]: Finished difference Result 278 states and 313 transitions. [2021-10-16 02:34:27,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-16 02:34:27,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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 19 [2021-10-16 02:34:27,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:27,818 INFO L225 Difference]: With dead ends: 278 [2021-10-16 02:34:27,818 INFO L226 Difference]: Without dead ends: 278 [2021-10-16 02:34:27,819 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-16 02:34:27,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-10-16 02:34:27,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2021-10-16 02:34:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 167 states have (on average 1.874251497005988) internal successors, (313), 277 states have internal predecessors, (313), 0 states have call successors, (0), 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-16 02:34:27,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 313 transitions. [2021-10-16 02:34:27,827 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 313 transitions. Word has length 19 [2021-10-16 02:34:27,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:27,828 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 313 transitions. [2021-10-16 02:34:27,828 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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-16 02:34:27,828 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 313 transitions. [2021-10-16 02:34:27,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-16 02:34:27,829 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:27,829 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:27,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-16 02:34:27,829 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:27,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:27,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1467799738, now seen corresponding path program 1 times [2021-10-16 02:34:27,830 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:27,830 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960581473] [2021-10-16 02:34:27,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:27,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:27,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:27,912 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:27,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960581473] [2021-10-16 02:34:27,912 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960581473] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:27,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:27,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-16 02:34:27,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971214476] [2021-10-16 02:34:27,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-16 02:34:27,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:27,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-16 02:34:27,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:34:27,915 INFO L87 Difference]: Start difference. First operand 278 states and 313 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 02:34:28,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:28,373 INFO L93 Difference]: Finished difference Result 576 states and 604 transitions. [2021-10-16 02:34:28,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-16 02:34:28,374 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-10-16 02:34:28,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:28,378 INFO L225 Difference]: With dead ends: 576 [2021-10-16 02:34:28,378 INFO L226 Difference]: Without dead ends: 576 [2021-10-16 02:34:28,378 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 94.4ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-10-16 02:34:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-10-16 02:34:28,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 278. [2021-10-16 02:34:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 167 states have (on average 1.8682634730538923) internal successors, (312), 277 states have internal predecessors, (312), 0 states have call successors, (0), 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-16 02:34:28,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 312 transitions. [2021-10-16 02:34:28,389 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 312 transitions. Word has length 22 [2021-10-16 02:34:28,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:28,390 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 312 transitions. [2021-10-16 02:34:28,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 02:34:28,390 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 312 transitions. [2021-10-16 02:34:28,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-16 02:34:28,391 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:28,391 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:28,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-16 02:34:28,392 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:28,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:28,392 INFO L82 PathProgramCache]: Analyzing trace with hash -74930744, now seen corresponding path program 1 times [2021-10-16 02:34:28,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:28,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804024333] [2021-10-16 02:34:28,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:28,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:28,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:28,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:28,470 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:28,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804024333] [2021-10-16 02:34:28,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804024333] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:28,471 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:28,471 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-16 02:34:28,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407400866] [2021-10-16 02:34:28,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-16 02:34:28,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:28,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-16 02:34:28,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:34:28,472 INFO L87 Difference]: Start difference. First operand 278 states and 312 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 02:34:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:28,888 INFO L93 Difference]: Finished difference Result 574 states and 602 transitions. [2021-10-16 02:34:28,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-16 02:34:28,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-10-16 02:34:28,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:28,893 INFO L225 Difference]: With dead ends: 574 [2021-10-16 02:34:28,893 INFO L226 Difference]: Without dead ends: 574 [2021-10-16 02:34:28,893 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 86.7ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-10-16 02:34:28,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-10-16 02:34:28,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 278. [2021-10-16 02:34:28,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 167 states have (on average 1.8622754491017963) internal successors, (311), 277 states have internal predecessors, (311), 0 states have call successors, (0), 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-16 02:34:28,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 311 transitions. [2021-10-16 02:34:28,902 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 311 transitions. Word has length 22 [2021-10-16 02:34:28,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:28,903 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 311 transitions. [2021-10-16 02:34:28,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 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-16 02:34:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 311 transitions. [2021-10-16 02:34:28,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-16 02:34:28,904 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:28,905 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:28,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-16 02:34:28,905 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:28,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:28,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1806081044, now seen corresponding path program 1 times [2021-10-16 02:34:28,906 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:28,906 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712991617] [2021-10-16 02:34:28,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:28,906 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:28,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:28,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:28,989 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:28,989 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712991617] [2021-10-16 02:34:28,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712991617] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:28,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:28,990 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-16 02:34:28,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102757012] [2021-10-16 02:34:28,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-16 02:34:28,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:28,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-16 02:34:28,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-16 02:34:28,991 INFO L87 Difference]: Start difference. First operand 278 states and 311 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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-16 02:34:29,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:29,803 INFO L93 Difference]: Finished difference Result 670 states and 707 transitions. [2021-10-16 02:34:29,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-16 02:34:29,805 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-10-16 02:34:29,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:29,809 INFO L225 Difference]: With dead ends: 670 [2021-10-16 02:34:29,809 INFO L226 Difference]: Without dead ends: 670 [2021-10-16 02:34:29,809 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 93.5ms TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-10-16 02:34:29,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-10-16 02:34:29,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 279. [2021-10-16 02:34:29,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 168 states have (on average 1.8630952380952381) internal successors, (313), 278 states have internal predecessors, (313), 0 states have call successors, (0), 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-16 02:34:29,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 313 transitions. [2021-10-16 02:34:29,822 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 313 transitions. Word has length 24 [2021-10-16 02:34:29,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:29,822 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 313 transitions. [2021-10-16 02:34:29,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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-16 02:34:29,823 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 313 transitions. [2021-10-16 02:34:29,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-16 02:34:29,827 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:29,827 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:29,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-16 02:34:29,828 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:29,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:29,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1806081043, now seen corresponding path program 1 times [2021-10-16 02:34:29,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:29,829 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041308853] [2021-10-16 02:34:29,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:29,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:29,989 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:29,992 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:29,992 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041308853] [2021-10-16 02:34:29,994 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041308853] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:29,994 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:29,995 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-16 02:34:29,995 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294829405] [2021-10-16 02:34:29,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-16 02:34:29,995 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:29,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-16 02:34:29,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:34:29,996 INFO L87 Difference]: Start difference. First operand 279 states and 313 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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-16 02:34:30,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:30,779 INFO L93 Difference]: Finished difference Result 635 states and 667 transitions. [2021-10-16 02:34:30,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-16 02:34:30,780 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-10-16 02:34:30,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:30,785 INFO L225 Difference]: With dead ends: 635 [2021-10-16 02:34:30,785 INFO L226 Difference]: Without dead ends: 635 [2021-10-16 02:34:30,786 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 123.2ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-10-16 02:34:30,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-10-16 02:34:30,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 279. [2021-10-16 02:34:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 278 states have internal predecessors, (312), 0 states have call successors, (0), 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-16 02:34:30,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 312 transitions. [2021-10-16 02:34:30,797 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 312 transitions. Word has length 24 [2021-10-16 02:34:30,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:30,798 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 312 transitions. [2021-10-16 02:34:30,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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-16 02:34:30,798 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 312 transitions. [2021-10-16 02:34:30,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-16 02:34:30,799 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:30,800 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:30,800 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-16 02:34:30,800 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:30,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:30,801 INFO L82 PathProgramCache]: Analyzing trace with hash 1006190094, now seen corresponding path program 1 times [2021-10-16 02:34:30,801 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:30,801 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848254957] [2021-10-16 02:34:30,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:30,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:30,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:30,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:30,889 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:30,890 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848254957] [2021-10-16 02:34:30,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848254957] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:30,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:30,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-16 02:34:30,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006796579] [2021-10-16 02:34:30,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-16 02:34:30,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:30,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-16 02:34:30,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-16 02:34:30,893 INFO L87 Difference]: Start difference. First operand 279 states and 312 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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-16 02:34:31,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:31,713 INFO L93 Difference]: Finished difference Result 668 states and 705 transitions. [2021-10-16 02:34:31,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-16 02:34:31,714 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-10-16 02:34:31,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:31,717 INFO L225 Difference]: With dead ends: 668 [2021-10-16 02:34:31,717 INFO L226 Difference]: Without dead ends: 668 [2021-10-16 02:34:31,717 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 111.4ms TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-10-16 02:34:31,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-10-16 02:34:31,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 279. [2021-10-16 02:34:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 168 states have (on average 1.8511904761904763) internal successors, (311), 278 states have internal predecessors, (311), 0 states have call successors, (0), 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-16 02:34:31,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 311 transitions. [2021-10-16 02:34:31,729 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 311 transitions. Word has length 24 [2021-10-16 02:34:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:31,729 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 311 transitions. [2021-10-16 02:34:31,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 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-16 02:34:31,730 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 311 transitions. [2021-10-16 02:34:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-16 02:34:31,736 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:31,736 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:31,736 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-16 02:34:31,737 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:31,737 INFO L82 PathProgramCache]: Analyzing trace with hash 1006190095, now seen corresponding path program 1 times [2021-10-16 02:34:31,738 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:31,738 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473639246] [2021-10-16 02:34:31,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:31,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-16 02:34:31,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-16 02:34:31,912 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-16 02:34:31,912 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473639246] [2021-10-16 02:34:31,913 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473639246] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-16 02:34:31,913 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-16 02:34:31,913 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-16 02:34:31,913 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540320230] [2021-10-16 02:34:31,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-16 02:34:31,914 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-16 02:34:31,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-16 02:34:31,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-16 02:34:31,915 INFO L87 Difference]: Start difference. First operand 279 states and 311 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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-16 02:34:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-16 02:34:32,749 INFO L93 Difference]: Finished difference Result 633 states and 665 transitions. [2021-10-16 02:34:32,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-16 02:34:32,749 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2021-10-16 02:34:32,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-16 02:34:32,754 INFO L225 Difference]: With dead ends: 633 [2021-10-16 02:34:32,754 INFO L226 Difference]: Without dead ends: 633 [2021-10-16 02:34:32,754 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 145.0ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-10-16 02:34:32,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2021-10-16 02:34:32,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 279. [2021-10-16 02:34:32,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 168 states have (on average 1.8452380952380953) internal successors, (310), 278 states have internal predecessors, (310), 0 states have call successors, (0), 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-16 02:34:32,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 310 transitions. [2021-10-16 02:34:32,766 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 310 transitions. Word has length 24 [2021-10-16 02:34:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-16 02:34:32,766 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 310 transitions. [2021-10-16 02:34:32,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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-16 02:34:32,767 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 310 transitions. [2021-10-16 02:34:32,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-16 02:34:32,770 INFO L504 BasicCegarLoop]: Found error trace [2021-10-16 02:34:32,770 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-16 02:34:32,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-16 02:34:32,771 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-16 02:34:32,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-16 02:34:32,771 INFO L82 PathProgramCache]: Analyzing trace with hash -477088755, now seen corresponding path program 1 times [2021-10-16 02:34:32,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-16 02:34:32,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645239281] [2021-10-16 02:34:32,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-16 02:34:32,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-16 02:34:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 02:34:32,807 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-16 02:34:32,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-16 02:34:32,880 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-16 02:34:32,880 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-16 02:34:32,882 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:32,885 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-16 02:34:32,886 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-16 02:34:32,886 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-16 02:34:32,886 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-16 02:34:32,887 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-16 02:34:32,887 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-16 02:34:32,887 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-16 02:34:32,887 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-16 02:34:32,888 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:32,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-16 02:34:32,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-16 02:34:32,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:32,889 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-16 02:34:32,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-16 02:34:32,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:32,890 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-16 02:34:32,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-16 02:34:32,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:32,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-16 02:34:32,891 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-16 02:34:32,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-16 02:34:32,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-16 02:34:32,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:32,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-16 02:34:32,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-16 02:34:32,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:32,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-16 02:34:32,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-16 02:34:32,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:32,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-16 02:34:32,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-16 02:34:32,894 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:32,895 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-16 02:34:32,895 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-16 02:34:32,895 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-16 02:34:32,895 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-16 02:34:32,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-16 02:34:32,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-16 02:34:32,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-16 02:34:32,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-16 02:34:32,896 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-16 02:34:32,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-16 02:34:32,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-16 02:34:32,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-10-16 02:34:32,897 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-16 02:34:32,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-16 02:34:32,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-16 02:34:32,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-16 02:34:32,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-16 02:34:32,898 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-16 02:34:32,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-16 02:34:32,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-16 02:34:32,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-16 02:34:32,899 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-16 02:34:32,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-16 02:34:32,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-10-16 02:34:32,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-10-16 02:34:32,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-10-16 02:34:32,900 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-16 02:34:32,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-16 02:34:32,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-10-16 02:34:32,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-16 02:34:32,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-16 02:34:32,901 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-10-16 02:34:32,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-10-16 02:34:32,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-10-16 02:34:32,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION [2021-10-16 02:34:32,902 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-10-16 02:34:32,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION [2021-10-16 02:34:32,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION [2021-10-16 02:34:32,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-10-16 02:34:32,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-10-16 02:34:32,903 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION [2021-10-16 02:34:32,904 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-10-16 02:34:32,904 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-10-16 02:34:32,904 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-10-16 02:34:32,904 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION [2021-10-16 02:34:32,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-10-16 02:34:32,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-10-16 02:34:32,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATION [2021-10-16 02:34:32,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATION [2021-10-16 02:34:32,905 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATION [2021-10-16 02:34:32,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-10-16 02:34:32,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATION [2021-10-16 02:34:32,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-10-16 02:34:32,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-10-16 02:34:32,906 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATION [2021-10-16 02:34:32,907 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-10-16 02:34:32,907 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATION [2021-10-16 02:34:32,907 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-10-16 02:34:32,907 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-10-16 02:34:32,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATION [2021-10-16 02:34:32,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-10-16 02:34:32,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATION [2021-10-16 02:34:32,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95REQUIRES_VIOLATION [2021-10-16 02:34:32,908 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-10-16 02:34:32,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATION [2021-10-16 02:34:32,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98REQUIRES_VIOLATION [2021-10-16 02:34:32,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99REQUIRES_VIOLATION [2021-10-16 02:34:32,909 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100REQUIRES_VIOLATION [2021-10-16 02:34:32,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:32,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:32,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:32,910 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:32,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105REQUIRES_VIOLATION [2021-10-16 02:34:32,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-10-16 02:34:32,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:32,911 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108REQUIRES_VIOLATION [2021-10-16 02:34:32,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-10-16 02:34:32,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:32,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111REQUIRES_VIOLATION [2021-10-16 02:34:32,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-10-16 02:34:32,912 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-10-16 02:34:32,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114REQUIRES_VIOLATION [2021-10-16 02:34:32,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115REQUIRES_VIOLATION [2021-10-16 02:34:32,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-10-16 02:34:32,913 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117REQUIRES_VIOLATION [2021-10-16 02:34:32,914 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118REQUIRES_VIOLATION [2021-10-16 02:34:32,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:32,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120REQUIRES_VIOLATION [2021-10-16 02:34:32,915 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-10-16 02:34:32,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:32,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:32,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:32,916 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125REQUIRES_VIOLATION [2021-10-16 02:34:32,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126REQUIRES_VIOLATION [2021-10-16 02:34:32,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:32,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:32,917 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONMEMORY_FREE [2021-10-16 02:34:32,918 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONMEMORY_LEAK [2021-10-16 02:34:32,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-16 02:34:32,928 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-16 02:34:32,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 02:34:32 BoogieIcfgContainer [2021-10-16 02:34:32,995 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-16 02:34:32,996 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-16 02:34:32,996 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-16 02:34:32,997 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-16 02:34:32,997 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 02:34:22" (3/4) ... [2021-10-16 02:34:33,000 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-16 02:34:33,082 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/witness.graphml [2021-10-16 02:34:33,084 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-16 02:34:33,086 INFO L168 Benchmark]: Toolchain (without parser) took 12457.43 ms. Allocated memory was 111.1 MB in the beginning and 176.2 MB in the end (delta: 65.0 MB). Free memory was 64.8 MB in the beginning and 84.8 MB in the end (delta: -20.1 MB). Peak memory consumption was 43.9 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:33,087 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 111.1 MB. Free memory is still 82.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-16 02:34:33,088 INFO L168 Benchmark]: CACSL2BoogieTranslator took 565.94 ms. Allocated memory is still 111.1 MB. Free memory was 64.6 MB in the beginning and 77.4 MB in the end (delta: -12.8 MB). Peak memory consumption was 4.6 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:33,088 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.64 ms. Allocated memory is still 111.1 MB. Free memory was 77.4 MB in the beginning and 74.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:33,089 INFO L168 Benchmark]: Boogie Preprocessor took 68.53 ms. Allocated memory is still 111.1 MB. Free memory was 74.4 MB in the beginning and 71.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:33,089 INFO L168 Benchmark]: RCFGBuilder took 1486.37 ms. Allocated memory was 111.1 MB in the beginning and 140.5 MB in the end (delta: 29.4 MB). Free memory was 71.5 MB in the beginning and 96.7 MB in the end (delta: -25.2 MB). Peak memory consumption was 41.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:33,090 INFO L168 Benchmark]: TraceAbstraction took 10124.06 ms. Allocated memory was 140.5 MB in the beginning and 176.2 MB in the end (delta: 35.7 MB). Free memory was 96.0 MB in the beginning and 86.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:33,091 INFO L168 Benchmark]: Witness Printer took 88.28 ms. Allocated memory is still 176.2 MB. Free memory was 86.9 MB in the beginning and 84.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-16 02:34:33,094 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.34 ms. Allocated memory is still 111.1 MB. Free memory is still 82.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 565.94 ms. Allocated memory is still 111.1 MB. Free memory was 64.6 MB in the beginning and 77.4 MB in the end (delta: -12.8 MB). Peak memory consumption was 4.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 113.64 ms. Allocated memory is still 111.1 MB. Free memory was 77.4 MB in the beginning and 74.4 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 68.53 ms. Allocated memory is still 111.1 MB. Free memory was 74.4 MB in the beginning and 71.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1486.37 ms. Allocated memory was 111.1 MB in the beginning and 140.5 MB in the end (delta: 29.4 MB). Free memory was 71.5 MB in the beginning and 96.7 MB in the end (delta: -25.2 MB). Peak memory consumption was 41.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 10124.06 ms. Allocated memory was 140.5 MB in the beginning and 176.2 MB in the end (delta: 35.7 MB). Free memory was 96.0 MB in the beginning and 86.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 16.1 GB. * Witness Printer took 88.28 ms. Allocated memory is still 176.2 MB. Free memory was 86.9 MB in the beginning and 84.8 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: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L638] struct list *data = ((void *)0); [L639] COND TRUE __VERIFIER_nondet_int() [L640] struct node *node = malloc(sizeof *node); [L641] COND FALSE !(!node) [L643] node->next = node [L644] node->value = __VERIFIER_nondet_int() [L645] struct list *item = malloc(sizeof *item); [L646] COND FALSE !(!item) [L648] item->slist = node [L649] item->next = data [L650] data = item [L639] COND FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) [L615] COND FALSE !(!(shape)) [L616] shape->next [L616] COND FALSE !(shape->next) [L622] COND FALSE !(!(shape)) [L623] EXPR shape->next [L623] COND FALSE !(!(shape->next == ((void *)0))) [L624] EXPR shape->slist [L624] COND FALSE !(!(shape->slist)) [L625] EXPR shape->slist [L625] EXPR shape->slist->next [L625] COND TRUE !(shape->slist->next == ((void *)0)) [L565] reach_error() - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: 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, 255 locations, 131 error locations. Started 1 CEGAR loops. OverallTime: 9979.1ms, OverallIterations: 19, TraceHistogramMax: 2, EmptinessCheckTime: 39.6ms, AutomataDifference: 7614.2ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 22.0ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3876 SDtfs, 12370 SDslu, 6932 SDs, 0 SdLazy, 5417 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5127.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 856.9ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=10, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 294.3ms AutomataMinimizationTime, 18 MinimizatonAttempts, 4186 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 60.5ms SsaConstructionTime, 310.1ms SatisfiabilityAnalysisTime, 1143.3ms InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 1759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 24/24 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-16 02:34:33,174 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8a6b869a-e31a-4084-bf09-144e6e1734c7/bin/utaipan-mTDlp9Zugs/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...