./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 279a496440714e08b745bf93c9b96ddf5eea3a1a1333716a32e013acf1d533d2 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-e943c26 [2021-10-24 10:09:19,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-24 10:09:19,273 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-24 10:09:19,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-24 10:09:19,319 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-24 10:09:19,320 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-24 10:09:19,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-24 10:09:19,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-24 10:09:19,328 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-24 10:09:19,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-24 10:09:19,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-24 10:09:19,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-24 10:09:19,333 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-24 10:09:19,334 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-24 10:09:19,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-24 10:09:19,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-24 10:09:19,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-24 10:09:19,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-24 10:09:19,347 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-24 10:09:19,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-24 10:09:19,352 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-24 10:09:19,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-24 10:09:19,368 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-24 10:09:19,369 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-24 10:09:19,380 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-24 10:09:19,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-24 10:09:19,381 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-24 10:09:19,382 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-24 10:09:19,383 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-24 10:09:19,384 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-24 10:09:19,384 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-24 10:09:19,385 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-24 10:09:19,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-24 10:09:19,391 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-24 10:09:19,393 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-24 10:09:19,393 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-24 10:09:19,394 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-24 10:09:19,394 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-24 10:09:19,395 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-24 10:09:19,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-24 10:09:19,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-24 10:09:19,401 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2021-10-24 10:09:19,452 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-24 10:09:19,452 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-24 10:09:19,454 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-24 10:09:19,460 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-24 10:09:19,460 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-24 10:09:19,460 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-24 10:09:19,460 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-24 10:09:19,460 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-24 10:09:19,460 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-24 10:09:19,461 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-24 10:09:19,461 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-24 10:09:19,461 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-24 10:09:19,461 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-24 10:09:19,461 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-24 10:09:19,462 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-24 10:09:19,462 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-24 10:09:19,462 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-24 10:09:19,463 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-24 10:09:19,463 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-24 10:09:19,463 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-24 10:09:19,463 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-24 10:09:19,463 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-24 10:09:19,464 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-24 10:09:19,464 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-24 10:09:19,464 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-24 10:09:19,464 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-10-24 10:09:19,464 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-24 10:09:19,465 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-24 10:09:19,465 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-24 10:09:19,465 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-24 10:09:19,465 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-24 10:09:19,466 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-24 10:09:19,466 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 10:09:19,466 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-24 10:09:19,466 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-24 10:09:19,466 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-24 10:09:19,467 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-24 10:09:19,467 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-24 10:09:19,467 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-24 10:09:19,467 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_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/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_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> 279a496440714e08b745bf93c9b96ddf5eea3a1a1333716a32e013acf1d533d2 [2021-10-24 10:09:19,694 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-24 10:09:19,724 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-24 10:09:19,726 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-24 10:09:19,727 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-24 10:09:19,728 INFO L275 PluginConnector]: CDTParser initialized [2021-10-24 10:09:19,728 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/../../sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2021-10-24 10:09:19,815 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/data/6ff879a31/ac4520f39f354e168cdd6bf709463cb1/FLAGd7dcbcaac [2021-10-24 10:09:20,320 INFO L306 CDTParser]: Found 1 translation units. [2021-10-24 10:09:20,321 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/sv-benchmarks/c/memory-alloca/c.03-alloca-2.i [2021-10-24 10:09:20,349 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/data/6ff879a31/ac4520f39f354e168cdd6bf709463cb1/FLAGd7dcbcaac [2021-10-24 10:09:20,648 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/data/6ff879a31/ac4520f39f354e168cdd6bf709463cb1 [2021-10-24 10:09:20,650 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-24 10:09:20,651 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-24 10:09:20,663 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-24 10:09:20,664 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-24 10:09:20,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-24 10:09:20,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:09:20" (1/1) ... [2021-10-24 10:09:20,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@320c6940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:09:20, skipping insertion in model container [2021-10-24 10:09:20,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 10:09:20" (1/1) ... [2021-10-24 10:09:20,676 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-24 10:09:20,711 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-24 10:09:21,046 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 10:09:21,053 INFO L203 MainTranslator]: Completed pre-run [2021-10-24 10:09:21,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-24 10:09:21,152 INFO L208 MainTranslator]: Completed translation [2021-10-24 10:09:21,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:09:21 WrapperNode [2021-10-24 10:09:21,152 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-24 10:09:21,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-24 10:09:21,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-24 10:09:21,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-24 10:09:21,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:09:21" (1/1) ... [2021-10-24 10:09:21,198 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:09:21" (1/1) ... [2021-10-24 10:09:21,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-24 10:09:21,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-24 10:09:21,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-24 10:09:21,221 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-24 10:09:21,228 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:09:21" (1/1) ... [2021-10-24 10:09:21,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:09:21" (1/1) ... [2021-10-24 10:09:21,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:09:21" (1/1) ... [2021-10-24 10:09:21,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:09:21" (1/1) ... [2021-10-24 10:09:21,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:09:21" (1/1) ... [2021-10-24 10:09:21,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:09:21" (1/1) ... [2021-10-24 10:09:21,243 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:09:21" (1/1) ... [2021-10-24 10:09:21,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-24 10:09:21,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-24 10:09:21,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-24 10:09:21,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-24 10:09:21,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:09:21" (1/1) ... [2021-10-24 10:09:21,256 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-24 10:09:21,271 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/z3 [2021-10-24 10:09:21,283 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-24 10:09:21,299 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-24 10:09:21,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-24 10:09:21,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-24 10:09:21,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-24 10:09:21,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-24 10:09:21,329 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-24 10:09:21,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-24 10:09:21,771 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-24 10:09:21,771 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2021-10-24 10:09:21,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:09:21 BoogieIcfgContainer [2021-10-24 10:09:21,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-24 10:09:21,776 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-24 10:09:21,776 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-24 10:09:21,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-24 10:09:21,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 10:09:20" (1/3) ... [2021-10-24 10:09:21,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c8d54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:09:21, skipping insertion in model container [2021-10-24 10:09:21,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 10:09:21" (2/3) ... [2021-10-24 10:09:21,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c8d54b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 10:09:21, skipping insertion in model container [2021-10-24 10:09:21,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:09:21" (3/3) ... [2021-10-24 10:09:21,783 INFO L111 eAbstractionObserver]: Analyzing ICFG c.03-alloca-2.i [2021-10-24 10:09:21,789 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-24 10:09:21,789 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2021-10-24 10:09:21,836 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-24 10:09:21,843 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, mAutomataTypeConcurrency=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-24 10:09:21,843 INFO L340 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2021-10-24 10:09:21,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 19 states have (on average 2.789473684210526) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 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-24 10:09:21,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-24 10:09:21,876 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:09:21,877 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-24 10:09:21,877 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-24 10:09:21,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:09:21,883 INFO L82 PathProgramCache]: Analyzing trace with hash 3383, now seen corresponding path program 1 times [2021-10-24 10:09:21,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:09:21,897 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057623635] [2021-10-24 10:09:21,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:09:21,898 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:09:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:09:22,136 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-24 10:09:22,137 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:09:22,138 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057623635] [2021-10-24 10:09:22,138 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057623635] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:09:22,139 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:09:22,139 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-24 10:09:22,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557220776] [2021-10-24 10:09:22,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:09:22,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:09:22,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:09:22,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:09:22,163 INFO L87 Difference]: Start difference. First operand has 51 states, 19 states have (on average 2.789473684210526) internal successors, (53), 50 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:09:22,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:09:22,234 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2021-10-24 10:09:22,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:09:22,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-24 10:09:22,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:09:22,244 INFO L225 Difference]: With dead ends: 46 [2021-10-24 10:09:22,245 INFO L226 Difference]: Without dead ends: 45 [2021-10-24 10:09:22,246 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:09:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2021-10-24 10:09:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2021-10-24 10:09:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 44 states have internal predecessors, (46), 0 states have call successors, (0), 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-24 10:09:22,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2021-10-24 10:09:22,280 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 2 [2021-10-24 10:09:22,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:09:22,281 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2021-10-24 10:09:22,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:09:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2021-10-24 10:09:22,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-24 10:09:22,282 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:09:22,282 INFO L512 BasicCegarLoop]: trace histogram [1, 1] [2021-10-24 10:09:22,282 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-24 10:09:22,283 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-24 10:09:22,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:09:22,284 INFO L82 PathProgramCache]: Analyzing trace with hash 3384, now seen corresponding path program 1 times [2021-10-24 10:09:22,284 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:09:22,284 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231380164] [2021-10-24 10:09:22,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:09:22,285 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:09:22,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:09:22,353 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-24 10:09:22,354 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:09:22,354 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231380164] [2021-10-24 10:09:22,354 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231380164] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:09:22,355 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:09:22,355 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-24 10:09:22,355 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301165425] [2021-10-24 10:09:22,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:09:22,357 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:09:22,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:09:22,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:09:22,358 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:09:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:09:22,428 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2021-10-24 10:09:22,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:09:22,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-24 10:09:22,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:09:22,429 INFO L225 Difference]: With dead ends: 40 [2021-10-24 10:09:22,430 INFO L226 Difference]: Without dead ends: 40 [2021-10-24 10:09:22,431 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:09:22,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2021-10-24 10:09:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2021-10-24 10:09:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 39 states have internal predecessors, (41), 0 states have call successors, (0), 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-24 10:09:22,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2021-10-24 10:09:22,439 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 2 [2021-10-24 10:09:22,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:09:22,440 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2021-10-24 10:09:22,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:09:22,441 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2021-10-24 10:09:22,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-24 10:09:22,442 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:09:22,442 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-24 10:09:22,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-24 10:09:22,443 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-24 10:09:22,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:09:22,444 INFO L82 PathProgramCache]: Analyzing trace with hash 104849, now seen corresponding path program 1 times [2021-10-24 10:09:22,445 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:09:22,447 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649295729] [2021-10-24 10:09:22,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:09:22,448 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:09:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:09:22,531 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-24 10:09:22,532 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:09:22,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649295729] [2021-10-24 10:09:22,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649295729] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:09:22,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:09:22,535 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-24 10:09:22,535 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588803351] [2021-10-24 10:09:22,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:09:22,537 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:09:22,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:09:22,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:09:22,539 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-24 10:09:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:09:22,600 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2021-10-24 10:09:22,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:09:22,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-10-24 10:09:22,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:09:22,602 INFO L225 Difference]: With dead ends: 38 [2021-10-24 10:09:22,603 INFO L226 Difference]: Without dead ends: 38 [2021-10-24 10:09:22,604 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:09:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-10-24 10:09:22,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2021-10-24 10:09:22,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 37 states have internal predecessors, (39), 0 states have call successors, (0), 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-24 10:09:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 39 transitions. [2021-10-24 10:09:22,611 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 39 transitions. Word has length 3 [2021-10-24 10:09:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:09:22,611 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 39 transitions. [2021-10-24 10:09:22,612 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-24 10:09:22,612 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 39 transitions. [2021-10-24 10:09:22,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-24 10:09:22,612 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:09:22,613 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-24 10:09:22,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-24 10:09:22,613 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-24 10:09:22,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:09:22,615 INFO L82 PathProgramCache]: Analyzing trace with hash 104850, now seen corresponding path program 1 times [2021-10-24 10:09:22,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:09:22,615 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572087038] [2021-10-24 10:09:22,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:09:22,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:09:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:09:22,709 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-24 10:09:22,709 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:09:22,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572087038] [2021-10-24 10:09:22,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572087038] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:09:22,711 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:09:22,712 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-24 10:09:22,712 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978768159] [2021-10-24 10:09:22,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:09:22,714 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:09:22,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:09:22,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:09:22,717 INFO L87 Difference]: Start difference. First operand 38 states and 39 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-24 10:09:22,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:09:22,768 INFO L93 Difference]: Finished difference Result 36 states and 37 transitions. [2021-10-24 10:09:22,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:09:22,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-10-24 10:09:22,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:09:22,770 INFO L225 Difference]: With dead ends: 36 [2021-10-24 10:09:22,772 INFO L226 Difference]: Without dead ends: 36 [2021-10-24 10:09:22,773 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:09:22,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-10-24 10:09:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-10-24 10:09:22,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 35 states have internal predecessors, (37), 0 states have call successors, (0), 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-24 10:09:22,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2021-10-24 10:09:22,779 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 3 [2021-10-24 10:09:22,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:09:22,779 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2021-10-24 10:09:22,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-24 10:09:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2021-10-24 10:09:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-24 10:09:22,782 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:09:22,782 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-24 10:09:22,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-24 10:09:22,784 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-24 10:09:22,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:09:22,785 INFO L82 PathProgramCache]: Analyzing trace with hash 3250298, now seen corresponding path program 1 times [2021-10-24 10:09:22,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:09:22,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511077012] [2021-10-24 10:09:22,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:09:22,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:09:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:09:22,871 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-24 10:09:22,871 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:09:22,871 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511077012] [2021-10-24 10:09:22,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511077012] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:09:22,872 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:09:22,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-24 10:09:22,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010764181] [2021-10-24 10:09:22,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:09:22,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:09:22,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:09:22,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:09:22,875 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-24 10:09:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:09:22,975 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2021-10-24 10:09:22,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:09:22,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-24 10:09:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:09:22,976 INFO L225 Difference]: With dead ends: 32 [2021-10-24 10:09:22,976 INFO L226 Difference]: Without dead ends: 32 [2021-10-24 10:09:22,976 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:09:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-10-24 10:09:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2021-10-24 10:09:22,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.736842105263158) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 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-24 10:09:22,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2021-10-24 10:09:22,980 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 4 [2021-10-24 10:09:22,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:09:22,980 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2021-10-24 10:09:22,980 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-24 10:09:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2021-10-24 10:09:22,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-24 10:09:22,981 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:09:22,981 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-24 10:09:22,981 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-24 10:09:22,981 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-24 10:09:22,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:09:22,982 INFO L82 PathProgramCache]: Analyzing trace with hash 3250299, now seen corresponding path program 1 times [2021-10-24 10:09:22,982 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:09:22,982 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094014188] [2021-10-24 10:09:22,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:09:22,983 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:09:23,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:09:23,044 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-24 10:09:23,044 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:09:23,045 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094014188] [2021-10-24 10:09:23,045 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094014188] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:09:23,045 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:09:23,045 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-24 10:09:23,046 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429671017] [2021-10-24 10:09:23,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:09:23,046 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:09:23,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:09:23,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:09:23,047 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-24 10:09:23,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:09:23,075 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2021-10-24 10:09:23,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:09:23,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-24 10:09:23,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:09:23,077 INFO L225 Difference]: With dead ends: 28 [2021-10-24 10:09:23,077 INFO L226 Difference]: Without dead ends: 28 [2021-10-24 10:09:23,077 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:09:23,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2021-10-24 10:09:23,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2021-10-24 10:09:23,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 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-24 10:09:23,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2021-10-24 10:09:23,080 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 4 [2021-10-24 10:09:23,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:09:23,081 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2021-10-24 10:09:23,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 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-24 10:09:23,081 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2021-10-24 10:09:23,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-24 10:09:23,082 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:09:23,082 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-24 10:09:23,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-24 10:09:23,082 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-24 10:09:23,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:09:23,083 INFO L82 PathProgramCache]: Analyzing trace with hash 100759220, now seen corresponding path program 1 times [2021-10-24 10:09:23,083 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:09:23,083 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226626997] [2021-10-24 10:09:23,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:09:23,084 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:09:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:09:23,115 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-24 10:09:23,115 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:09:23,115 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226626997] [2021-10-24 10:09:23,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226626997] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:09:23,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:09:23,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-24 10:09:23,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28936469] [2021-10-24 10:09:23,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:09:23,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:09:23,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:09:23,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:09:23,118 INFO L87 Difference]: Start difference. First operand 28 states and 29 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-24 10:09:23,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:09:23,150 INFO L93 Difference]: Finished difference Result 24 states and 25 transitions. [2021-10-24 10:09:23,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:09:23,150 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-24 10:09:23,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:09:23,151 INFO L225 Difference]: With dead ends: 24 [2021-10-24 10:09:23,151 INFO L226 Difference]: Without dead ends: 24 [2021-10-24 10:09:23,151 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-24 10:09:23,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2021-10-24 10:09:23,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2021-10-24 10:09:23,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 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-24 10:09:23,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2021-10-24 10:09:23,154 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 5 [2021-10-24 10:09:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:09:23,154 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2021-10-24 10:09:23,155 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-24 10:09:23,155 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2021-10-24 10:09:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-24 10:09:23,155 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:09:23,155 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-24 10:09:23,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-24 10:09:23,156 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-24 10:09:23,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:09:23,156 INFO L82 PathProgramCache]: Analyzing trace with hash 100759221, now seen corresponding path program 1 times [2021-10-24 10:09:23,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:09:23,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195412940] [2021-10-24 10:09:23,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:09:23,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:09:23,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:09:23,206 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-24 10:09:23,206 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:09:23,207 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195412940] [2021-10-24 10:09:23,207 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195412940] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:09:23,207 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:09:23,207 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-24 10:09:23,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910773571] [2021-10-24 10:09:23,208 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-24 10:09:23,208 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:09:23,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-24 10:09:23,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:09:23,209 INFO L87 Difference]: Start difference. First operand 24 states and 25 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-24 10:09:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:09:23,239 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2021-10-24 10:09:23,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-24 10:09:23,240 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-24 10:09:23,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:09:23,243 INFO L225 Difference]: With dead ends: 20 [2021-10-24 10:09:23,243 INFO L226 Difference]: Without dead ends: 20 [2021-10-24 10:09:23,244 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-24 10:09:23,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-10-24 10:09:23,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-10-24 10:09:23,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 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-24 10:09:23,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2021-10-24 10:09:23,259 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 5 [2021-10-24 10:09:23,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:09:23,260 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2021-10-24 10:09:23,260 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-24 10:09:23,260 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2021-10-24 10:09:23,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-24 10:09:23,260 INFO L504 BasicCegarLoop]: Found error trace [2021-10-24 10:09:23,261 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-24 10:09:23,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-24 10:09:23,261 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 27 more)] === [2021-10-24 10:09:23,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-24 10:09:23,262 INFO L82 PathProgramCache]: Analyzing trace with hash 553774910, now seen corresponding path program 1 times [2021-10-24 10:09:23,262 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-24 10:09:23,262 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489947187] [2021-10-24 10:09:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-24 10:09:23,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-24 10:09:23,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-24 10:09:23,392 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-24 10:09:23,392 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-24 10:09:23,392 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489947187] [2021-10-24 10:09:23,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489947187] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-24 10:09:23,393 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-24 10:09:23,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-24 10:09:23,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420258768] [2021-10-24 10:09:23,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-24 10:09:23,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-24 10:09:23,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-24 10:09:23,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:09:23,395 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:09:23,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-24 10:09:23,435 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2021-10-24 10:09:23,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-24 10:09:23,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-24 10:09:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-24 10:09:23,436 INFO L225 Difference]: With dead ends: 19 [2021-10-24 10:09:23,436 INFO L226 Difference]: Without dead ends: 0 [2021-10-24 10:09:23,436 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.2ms TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-24 10:09:23,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-24 10:09:23,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-24 10:09:23,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-24 10:09:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-24 10:09:23,437 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2021-10-24 10:09:23,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-24 10:09:23,437 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-24 10:09:23,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-24 10:09:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-24 10:09:23,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-24 10:09:23,440 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-24 10:09:23,441 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-24 10:09:23,441 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-24 10:09:23,442 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-24 10:09:23,442 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-24 10:09:23,442 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-24 10:09:23,442 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-24 10:09:23,442 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-24 10:09:23,443 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-24 10:09:23,443 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-24 10:09:23,443 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-24 10:09:23,443 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-24 10:09:23,443 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-24 10:09:23,444 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-24 10:09:23,444 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-24 10:09:23,444 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-24 10:09:23,444 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-24 10:09:23,444 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-24 10:09:23,444 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-24 10:09:23,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-24 10:09:23,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-24 10:09:23,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-24 10:09:23,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-24 10:09:23,445 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-24 10:09:23,446 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-24 10:09:23,446 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-24 10:09:23,446 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-24 10:09:23,446 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-24 10:09:23,446 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-24 10:09:23,446 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-24 10:09:23,447 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK [2021-10-24 10:09:23,447 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-24 10:09:23,452 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-24 10:09:23,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 10:09:23 BoogieIcfgContainer [2021-10-24 10:09:23,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-24 10:09:23,455 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-24 10:09:23,455 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-24 10:09:23,455 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-24 10:09:23,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 10:09:21" (3/4) ... [2021-10-24 10:09:23,459 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-24 10:09:23,470 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2021-10-24 10:09:23,471 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-10-24 10:09:23,471 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-24 10:09:23,514 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/witness.graphml [2021-10-24 10:09:23,514 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-24 10:09:23,516 INFO L168 Benchmark]: Toolchain (without parser) took 2863.46 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 69.7 MB in the beginning and 53.2 MB in the end (delta: 16.5 MB). Peak memory consumption was 34.0 MB. Max. memory is 16.1 GB. [2021-10-24 10:09:23,516 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 102.8 MB. Free memory is still 55.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-24 10:09:23,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.59 ms. Allocated memory is still 102.8 MB. Free memory was 69.7 MB in the beginning and 72.2 MB in the end (delta: -2.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-24 10:09:23,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.09 ms. Allocated memory is still 102.8 MB. Free memory was 71.8 MB in the beginning and 70.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-24 10:09:23,524 INFO L168 Benchmark]: Boogie Preprocessor took 25.59 ms. Allocated memory is still 102.8 MB. Free memory was 70.0 MB in the beginning and 68.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-24 10:09:23,524 INFO L168 Benchmark]: RCFGBuilder took 527.71 ms. Allocated memory is still 102.8 MB. Free memory was 68.7 MB in the beginning and 52.8 MB in the end (delta: 15.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-24 10:09:23,525 INFO L168 Benchmark]: TraceAbstraction took 1678.63 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 52.4 MB in the beginning and 57.4 MB in the end (delta: -5.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 16.1 GB. [2021-10-24 10:09:23,525 INFO L168 Benchmark]: Witness Printer took 59.33 ms. Allocated memory is still 123.7 MB. Free memory was 56.4 MB in the beginning and 53.2 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-24 10:09:23,527 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.21 ms. Allocated memory is still 102.8 MB. Free memory is still 55.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 489.59 ms. Allocated memory is still 102.8 MB. Free memory was 69.7 MB in the beginning and 72.2 MB in the end (delta: -2.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 66.09 ms. Allocated memory is still 102.8 MB. Free memory was 71.8 MB in the beginning and 70.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.59 ms. Allocated memory is still 102.8 MB. Free memory was 70.0 MB in the beginning and 68.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 527.71 ms. Allocated memory is still 102.8 MB. Free memory was 68.7 MB in the beginning and 52.8 MB in the end (delta: 15.9 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 1678.63 ms. Allocated memory was 102.8 MB in the beginning and 123.7 MB in the end (delta: 21.0 MB). Free memory was 52.4 MB in the beginning and 57.4 MB in the end (delta: -5.0 MB). Peak memory consumption was 15.8 MB. Max. memory is 16.1 GB. * Witness Printer took 59.33 ms. Allocated memory is still 123.7 MB. Free memory was 56.4 MB in the beginning and 53.2 MB in the end (delta: 3.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 - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 522]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 526]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 532]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 1616.8ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 25.2ms, AutomataDifference: 544.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 11.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 98 SDtfs, 254 SDslu, 4 SDs, 0 SdLazy, 219 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 312.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 51.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 63.9ms AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 27.4ms SsaConstructionTime, 255.8ms SatisfiabilityAnalysisTime, 430.8ms InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 29 ConstructedInterpolants, 0 QuantifiedInterpolants, 463 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-24 10:09:23,574 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_74cbd9aa-d679-4e48-83c7-db1910673f26/bin/utaipan-9zjyvhn0QE/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...