./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/dll-optional-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8287e6117d458104c3f33a0e7a83f771b50c3974e23296edc32c92f0b8cae546 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 03:39:58,992 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 03:39:58,994 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 03:39:59,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 03:39:59,037 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 03:39:59,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 03:39:59,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 03:39:59,048 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 03:39:59,051 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 03:39:59,057 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 03:39:59,058 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 03:39:59,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 03:39:59,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 03:39:59,064 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 03:39:59,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 03:39:59,070 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 03:39:59,072 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 03:39:59,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 03:39:59,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 03:39:59,084 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 03:39:59,086 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 03:39:59,088 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 03:39:59,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 03:39:59,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 03:39:59,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 03:39:59,095 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 03:39:59,095 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 03:39:59,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 03:39:59,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 03:39:59,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 03:39:59,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 03:39:59,100 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 03:39:59,101 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 03:39:59,102 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 03:39:59,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 03:39:59,104 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 03:39:59,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 03:39:59,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 03:39:59,105 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 03:39:59,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 03:39:59,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 03:39:59,112 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-03 03:39:59,161 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 03:39:59,161 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 03:39:59,162 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 03:39:59,162 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 03:39:59,162 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 03:39:59,162 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 03:39:59,163 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 03:39:59,163 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 03:39:59,163 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 03:39:59,163 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 03:39:59,163 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 03:39:59,164 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 03:39:59,164 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 03:39:59,164 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 03:39:59,164 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 03:39:59,165 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 03:39:59,165 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 03:39:59,166 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 03:39:59,166 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 03:39:59,166 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-03 03:39:59,166 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 03:39:59,166 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 03:39:59,167 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 03:39:59,167 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-03 03:39:59,167 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-03 03:39:59,167 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 03:39:59,167 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 03:39:59,168 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 03:39:59,168 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 03:39:59,168 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 03:39:59,168 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 03:39:59,168 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:39:59,169 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 03:39:59,169 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 03:39:59,169 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 03:39:59,169 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 03:39:59,169 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 03:39:59,170 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 03:39:59,170 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_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/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_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8287e6117d458104c3f33a0e7a83f771b50c3974e23296edc32c92f0b8cae546 [2021-11-03 03:39:59,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 03:39:59,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 03:39:59,502 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 03:39:59,503 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 03:39:59,504 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 03:39:59,505 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/forester-heap/dll-optional-2.i [2021-11-03 03:39:59,591 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/data/acebe2936/dda8f55eda9545bea31a228a3bd67522/FLAGf8926a85e [2021-11-03 03:40:00,165 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 03:40:00,165 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/sv-benchmarks/c/forester-heap/dll-optional-2.i [2021-11-03 03:40:00,185 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/data/acebe2936/dda8f55eda9545bea31a228a3bd67522/FLAGf8926a85e [2021-11-03 03:40:00,455 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/data/acebe2936/dda8f55eda9545bea31a228a3bd67522 [2021-11-03 03:40:00,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 03:40:00,460 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 03:40:00,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 03:40:00,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 03:40:00,468 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 03:40:00,468 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:40:00" (1/1) ... [2021-11-03 03:40:00,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@279e0673 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:00, skipping insertion in model container [2021-11-03 03:40:00,470 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 03:40:00" (1/1) ... [2021-11-03 03:40:00,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 03:40:00,541 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 03:40:00,900 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/sv-benchmarks/c/forester-heap/dll-optional-2.i[22706,22719] [2021-11-03 03:40:00,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:40:00,914 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 03:40:00,951 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/sv-benchmarks/c/forester-heap/dll-optional-2.i[22706,22719] [2021-11-03 03:40:00,954 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 03:40:00,987 INFO L208 MainTranslator]: Completed translation [2021-11-03 03:40:00,988 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:00 WrapperNode [2021-11-03 03:40:00,988 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 03:40:00,989 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 03:40:00,989 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 03:40:00,989 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 03:40:00,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:00" (1/1) ... [2021-11-03 03:40:01,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:00" (1/1) ... [2021-11-03 03:40:01,054 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 03:40:01,054 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 03:40:01,054 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 03:40:01,055 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 03:40:01,063 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:00" (1/1) ... [2021-11-03 03:40:01,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:00" (1/1) ... [2021-11-03 03:40:01,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:00" (1/1) ... [2021-11-03 03:40:01,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:00" (1/1) ... [2021-11-03 03:40:01,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:00" (1/1) ... [2021-11-03 03:40:01,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:00" (1/1) ... [2021-11-03 03:40:01,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:00" (1/1) ... [2021-11-03 03:40:01,104 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 03:40:01,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 03:40:01,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 03:40:01,105 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 03:40:01,106 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:00" (1/1) ... [2021-11-03 03:40:01,112 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 03:40:01,127 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 03:40:01,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 03:40:01,151 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 03:40:01,184 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 03:40:01,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 03:40:01,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 03:40:01,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 03:40:01,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 03:40:01,185 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 03:40:01,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 03:40:01,185 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 03:40:01,185 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 03:40:01,185 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 03:40:01,847 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 03:40:01,852 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-11-03 03:40:01,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:40:01 BoogieIcfgContainer [2021-11-03 03:40:01,855 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 03:40:01,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 03:40:01,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 03:40:01,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 03:40:01,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 03:40:00" (1/3) ... [2021-11-03 03:40:01,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da45547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:40:01, skipping insertion in model container [2021-11-03 03:40:01,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 03:40:00" (2/3) ... [2021-11-03 03:40:01,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6da45547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 03:40:01, skipping insertion in model container [2021-11-03 03:40:01,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:40:01" (3/3) ... [2021-11-03 03:40:01,866 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-2.i [2021-11-03 03:40:01,877 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 03:40:01,877 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2021-11-03 03:40:01,934 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 03:40:01,943 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-11-03 03:40:01,943 INFO L340 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2021-11-03 03:40:01,966 INFO L276 IsEmpty]: Start isEmpty. Operand has 119 states, 52 states have (on average 2.519230769230769) internal successors, (131), 118 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:01,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-03 03:40:01,972 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:40:01,973 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-11-03 03:40:01,973 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-03 03:40:01,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:40:01,980 INFO L85 PathProgramCache]: Analyzing trace with hash 7847, now seen corresponding path program 1 times [2021-11-03 03:40:01,989 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:40:01,990 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027580853] [2021-11-03 03:40:01,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:40:01,991 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:40:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:40:02,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:40:02,168 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:40:02,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027580853] [2021-11-03 03:40:02,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027580853] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:40:02,170 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:40:02,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-03 03:40:02,182 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154675306] [2021-11-03 03:40:02,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 03:40:02,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:40:02,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 03:40:02,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:40:02,211 INFO L87 Difference]: Start difference. First operand has 119 states, 52 states have (on average 2.519230769230769) internal successors, (131), 118 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:02,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:40:02,416 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2021-11-03 03:40:02,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 03:40:02,418 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-11-03 03:40:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:40:02,428 INFO L225 Difference]: With dead ends: 118 [2021-11-03 03:40:02,429 INFO L226 Difference]: Without dead ends: 116 [2021-11-03 03:40:02,431 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:40:02,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-03 03:40:02,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2021-11-03 03:40:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 55 states have (on average 2.2) internal successors, (121), 110 states have internal predecessors, (121), 0 states have call successors, (0), 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-11-03 03:40:02,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2021-11-03 03:40:02,465 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 2 [2021-11-03 03:40:02,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:40:02,465 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2021-11-03 03:40:02,466 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-11-03 03:40:02,466 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2021-11-03 03:40:02,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-03 03:40:02,466 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:40:02,467 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-11-03 03:40:02,467 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 03:40:02,467 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-03 03:40:02,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:40:02,468 INFO L85 PathProgramCache]: Analyzing trace with hash 7848, now seen corresponding path program 1 times [2021-11-03 03:40:02,468 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:40:02,469 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037691215] [2021-11-03 03:40:02,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:40:02,469 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:40:02,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:40:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:40:02,555 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:40:02,556 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037691215] [2021-11-03 03:40:02,556 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037691215] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:40:02,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:40:02,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-03 03:40:02,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013948074] [2021-11-03 03:40:02,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 03:40:02,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:40:02,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 03:40:02,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:40:02,558 INFO L87 Difference]: Start difference. First operand 111 states and 121 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-11-03 03:40:02,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:40:02,672 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2021-11-03 03:40:02,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 03:40:02,672 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-11-03 03:40:02,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:40:02,674 INFO L225 Difference]: With dead ends: 105 [2021-11-03 03:40:02,674 INFO L226 Difference]: Without dead ends: 105 [2021-11-03 03:40:02,675 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 03:40:02,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-03 03:40:02,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2021-11-03 03:40:02,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 55 states have (on average 2.036363636363636) internal successors, (112), 101 states have internal predecessors, (112), 0 states have call successors, (0), 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-11-03 03:40:02,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2021-11-03 03:40:02,685 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 2 [2021-11-03 03:40:02,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:40:02,686 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2021-11-03 03:40:02,686 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-11-03 03:40:02,686 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2021-11-03 03:40:02,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-03 03:40:02,687 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:40:02,687 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:40:02,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 03:40:02,688 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-03 03:40:02,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:40:02,689 INFO L85 PathProgramCache]: Analyzing trace with hash -832928076, now seen corresponding path program 1 times [2021-11-03 03:40:02,689 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:40:02,689 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656906455] [2021-11-03 03:40:02,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:40:02,690 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:40:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:40:02,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:40:02,766 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:40:02,766 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656906455] [2021-11-03 03:40:02,767 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656906455] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:40:02,767 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:40:02,767 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 03:40:02,767 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878856586] [2021-11-03 03:40:02,768 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:40:02,768 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:40:02,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:40:02,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:40:02,771 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:02,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:40:02,999 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2021-11-03 03:40:03,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:40:03,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-03 03:40:03,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:40:03,005 INFO L225 Difference]: With dead ends: 126 [2021-11-03 03:40:03,006 INFO L226 Difference]: Without dead ends: 126 [2021-11-03 03:40:03,006 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 03:40:03,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-11-03 03:40:03,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2021-11-03 03:40:03,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 55 states have (on average 2.018181818181818) internal successors, (111), 100 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:03,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2021-11-03 03:40:03,022 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 8 [2021-11-03 03:40:03,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:40:03,023 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2021-11-03 03:40:03,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:03,023 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2021-11-03 03:40:03,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-03 03:40:03,024 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:40:03,024 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:40:03,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 03:40:03,025 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-03 03:40:03,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:40:03,025 INFO L85 PathProgramCache]: Analyzing trace with hash -832928075, now seen corresponding path program 1 times [2021-11-03 03:40:03,026 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:40:03,026 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634437017] [2021-11-03 03:40:03,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:40:03,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:40:03,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:40:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:40:03,134 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:40:03,134 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634437017] [2021-11-03 03:40:03,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634437017] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:40:03,134 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:40:03,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 03:40:03,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998103700] [2021-11-03 03:40:03,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:40:03,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:40:03,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:40:03,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:40:03,137 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:03,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:40:03,385 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2021-11-03 03:40:03,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:40:03,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-11-03 03:40:03,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:40:03,387 INFO L225 Difference]: With dead ends: 100 [2021-11-03 03:40:03,387 INFO L226 Difference]: Without dead ends: 100 [2021-11-03 03:40:03,387 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 03:40:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-03 03:40:03,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-11-03 03:40:03,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 55 states have (on average 2.0) internal successors, (110), 99 states have internal predecessors, (110), 0 states have call successors, (0), 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-11-03 03:40:03,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2021-11-03 03:40:03,394 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 8 [2021-11-03 03:40:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:40:03,394 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2021-11-03 03:40:03,394 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2021-11-03 03:40:03,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 03:40:03,403 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:40:03,404 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:40:03,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 03:40:03,419 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-03 03:40:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:40:03,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1417727733, now seen corresponding path program 1 times [2021-11-03 03:40:03,420 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:40:03,421 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299885345] [2021-11-03 03:40:03,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:40:03,421 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:40:03,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:40:03,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:40:03,495 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:40:03,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299885345] [2021-11-03 03:40:03,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299885345] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:40:03,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:40:03,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:40:03,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770977273] [2021-11-03 03:40:03,496 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:40:03,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:40:03,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:40:03,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:40:03,498 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:03,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:40:03,687 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2021-11-03 03:40:03,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:40:03,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-03 03:40:03,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:40:03,689 INFO L225 Difference]: With dead ends: 100 [2021-11-03 03:40:03,689 INFO L226 Difference]: Without dead ends: 100 [2021-11-03 03:40:03,689 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:40:03,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-03 03:40:03,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2021-11-03 03:40:03,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.8) internal successors, (108), 92 states have internal predecessors, (108), 0 states have call successors, (0), 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-11-03 03:40:03,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2021-11-03 03:40:03,703 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 11 [2021-11-03 03:40:03,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:40:03,704 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2021-11-03 03:40:03,704 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:03,704 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2021-11-03 03:40:03,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 03:40:03,705 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:40:03,705 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:40:03,705 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 03:40:03,705 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-03 03:40:03,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:40:03,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1417727732, now seen corresponding path program 1 times [2021-11-03 03:40:03,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:40:03,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813348656] [2021-11-03 03:40:03,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:40:03,707 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:40:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:40:03,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:40:03,808 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:40:03,808 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813348656] [2021-11-03 03:40:03,808 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813348656] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:40:03,808 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:40:03,808 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 03:40:03,809 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132797356] [2021-11-03 03:40:03,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:40:03,809 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:40:03,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:40:03,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:40:03,810 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:03,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:40:03,987 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2021-11-03 03:40:03,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:40:03,987 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-11-03 03:40:03,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:40:03,989 INFO L225 Difference]: With dead ends: 130 [2021-11-03 03:40:03,989 INFO L226 Difference]: Without dead ends: 130 [2021-11-03 03:40:03,989 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:40:03,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-03 03:40:04,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2021-11-03 03:40:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 78 states have (on average 1.6923076923076923) internal successors, (132), 110 states have internal predecessors, (132), 0 states have call successors, (0), 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-11-03 03:40:04,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2021-11-03 03:40:04,007 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 11 [2021-11-03 03:40:04,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:40:04,012 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2021-11-03 03:40:04,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2021-11-03 03:40:04,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 03:40:04,013 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:40:04,013 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:40:04,013 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 03:40:04,013 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-03 03:40:04,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:40:04,014 INFO L85 PathProgramCache]: Analyzing trace with hash -931567606, now seen corresponding path program 1 times [2021-11-03 03:40:04,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:40:04,014 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715072162] [2021-11-03 03:40:04,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:40:04,014 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:40:04,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:40:04,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:40:04,067 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:40:04,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715072162] [2021-11-03 03:40:04,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715072162] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:40:04,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:40:04,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 03:40:04,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599785664] [2021-11-03 03:40:04,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:40:04,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:40:04,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:40:04,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:40:04,070 INFO L87 Difference]: Start difference. First operand 111 states and 132 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:04,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:40:04,212 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2021-11-03 03:40:04,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:40:04,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-03 03:40:04,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:40:04,214 INFO L225 Difference]: With dead ends: 110 [2021-11-03 03:40:04,215 INFO L226 Difference]: Without dead ends: 110 [2021-11-03 03:40:04,215 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 03:40:04,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-03 03:40:04,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-11-03 03:40:04,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 78 states have (on average 1.6666666666666667) internal successors, (130), 109 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:04,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2021-11-03 03:40:04,228 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 13 [2021-11-03 03:40:04,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:40:04,228 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2021-11-03 03:40:04,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:04,231 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2021-11-03 03:40:04,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 03:40:04,232 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:40:04,232 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:40:04,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 03:40:04,233 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-03 03:40:04,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:40:04,233 INFO L85 PathProgramCache]: Analyzing trace with hash -931567605, now seen corresponding path program 1 times [2021-11-03 03:40:04,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:40:04,234 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091012593] [2021-11-03 03:40:04,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:40:04,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:40:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:40:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:40:04,366 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:40:04,366 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091012593] [2021-11-03 03:40:04,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091012593] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:40:04,367 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:40:04,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 03:40:04,368 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995713648] [2021-11-03 03:40:04,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 03:40:04,369 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:40:04,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 03:40:04,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 03:40:04,371 INFO L87 Difference]: Start difference. First operand 110 states and 130 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:04,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:40:04,501 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2021-11-03 03:40:04,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 03:40:04,501 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-03 03:40:04,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:40:04,502 INFO L225 Difference]: With dead ends: 109 [2021-11-03 03:40:04,502 INFO L226 Difference]: Without dead ends: 109 [2021-11-03 03:40:04,503 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 03:40:04,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-11-03 03:40:04,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-11-03 03:40:04,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.641025641025641) internal successors, (128), 108 states have internal predecessors, (128), 0 states have call successors, (0), 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-11-03 03:40:04,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2021-11-03 03:40:04,506 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 13 [2021-11-03 03:40:04,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:40:04,507 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2021-11-03 03:40:04,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:04,507 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2021-11-03 03:40:04,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-03 03:40:04,508 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:40:04,508 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:40:04,508 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 03:40:04,508 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-03 03:40:04,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:40:04,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1181636105, now seen corresponding path program 1 times [2021-11-03 03:40:04,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:40:04,510 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929426400] [2021-11-03 03:40:04,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:40:04,510 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:40:04,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:40:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:40:04,578 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:40:04,578 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929426400] [2021-11-03 03:40:04,579 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929426400] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:40:04,579 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:40:04,579 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 03:40:04,579 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370300607] [2021-11-03 03:40:04,580 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 03:40:04,580 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:40:04,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 03:40:04,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:40:04,581 INFO L87 Difference]: Start difference. First operand 109 states and 128 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-11-03 03:40:04,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:40:04,689 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2021-11-03 03:40:04,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 03:40:04,689 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2021-11-03 03:40:04,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:40:04,691 INFO L225 Difference]: With dead ends: 123 [2021-11-03 03:40:04,692 INFO L226 Difference]: Without dead ends: 123 [2021-11-03 03:40:04,697 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 03:40:04,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-11-03 03:40:04,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2021-11-03 03:40:04,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 78 states have (on average 1.6153846153846154) internal successors, (126), 108 states have internal predecessors, (126), 0 states have call successors, (0), 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-11-03 03:40:04,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2021-11-03 03:40:04,702 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 14 [2021-11-03 03:40:04,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:40:04,703 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2021-11-03 03:40:04,703 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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-11-03 03:40:04,703 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2021-11-03 03:40:04,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 03:40:04,704 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:40:04,704 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:40:04,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 03:40:04,704 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-03 03:40:04,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:40:04,705 INFO L85 PathProgramCache]: Analyzing trace with hash -1883114057, now seen corresponding path program 1 times [2021-11-03 03:40:04,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:40:04,711 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045944595] [2021-11-03 03:40:04,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:40:04,711 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:40:04,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:40:04,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:40:04,823 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:40:04,824 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045944595] [2021-11-03 03:40:04,824 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045944595] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:40:04,824 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:40:04,824 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 03:40:04,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382107148] [2021-11-03 03:40:04,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 03:40:04,825 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:40:04,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 03:40:04,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-03 03:40:04,841 INFO L87 Difference]: Start difference. First operand 109 states and 126 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 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-11-03 03:40:05,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:40:05,156 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2021-11-03 03:40:05,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 03:40:05,156 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-11-03 03:40:05,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:40:05,157 INFO L225 Difference]: With dead ends: 110 [2021-11-03 03:40:05,157 INFO L226 Difference]: Without dead ends: 110 [2021-11-03 03:40:05,158 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-03 03:40:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-03 03:40:05,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2021-11-03 03:40:05,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 78 states have (on average 1.6025641025641026) internal successors, (125), 107 states have internal predecessors, (125), 0 states have call successors, (0), 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-11-03 03:40:05,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2021-11-03 03:40:05,161 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 15 [2021-11-03 03:40:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:40:05,162 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2021-11-03 03:40:05,162 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 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-11-03 03:40:05,162 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2021-11-03 03:40:05,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-03 03:40:05,163 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:40:05,163 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:40:05,163 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 03:40:05,163 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-03 03:40:05,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:40:05,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1883114056, now seen corresponding path program 1 times [2021-11-03 03:40:05,164 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:40:05,164 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337704795] [2021-11-03 03:40:05,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:40:05,165 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:40:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 03:40:05,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 03:40:05,304 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 03:40:05,304 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337704795] [2021-11-03 03:40:05,305 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337704795] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 03:40:05,305 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 03:40:05,305 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-03 03:40:05,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255253721] [2021-11-03 03:40:05,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-03 03:40:05,306 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 03:40:05,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-03 03:40:05,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-03 03:40:05,308 INFO L87 Difference]: Start difference. First operand 108 states and 125 transitions. Second operand has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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-11-03 03:40:05,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 03:40:05,718 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2021-11-03 03:40:05,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-03 03:40:05,719 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2021-11-03 03:40:05,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 03:40:05,720 INFO L225 Difference]: With dead ends: 100 [2021-11-03 03:40:05,720 INFO L226 Difference]: Without dead ends: 100 [2021-11-03 03:40:05,720 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-11-03 03:40:05,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-03 03:40:05,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2021-11-03 03:40:05,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 90 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 03:40:05,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2021-11-03 03:40:05,723 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 15 [2021-11-03 03:40:05,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 03:40:05,724 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2021-11-03 03:40:05,724 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 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-11-03 03:40:05,724 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2021-11-03 03:40:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-03 03:40:05,725 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 03:40:05,725 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:40:05,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 03:40:05,725 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 62 more)] === [2021-11-03 03:40:05,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 03:40:05,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1584318480, now seen corresponding path program 1 times [2021-11-03 03:40:05,726 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 03:40:05,726 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192915908] [2021-11-03 03:40:05,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 03:40:05,727 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 03:40:05,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 03:40:05,759 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 03:40:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 03:40:05,813 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 03:40:05,813 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 03:40:05,814 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:40:05,817 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-03 03:40:05,823 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-03 03:40:05,827 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-03 03:40:05,839 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-03 03:40:05,839 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-11-03 03:40:05,839 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-11-03 03:40:05,839 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-11-03 03:40:05,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-11-03 03:40:05,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-11-03 03:40:05,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-11-03 03:40:05,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-11-03 03:40:05,840 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-11-03 03:40:05,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-11-03 03:40:05,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-11-03 03:40:05,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-11-03 03:40:05,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-11-03 03:40:05,841 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-11-03 03:40:05,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-11-03 03:40:05,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-11-03 03:40:05,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-11-03 03:40:05,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-11-03 03:40:05,842 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-11-03 03:40:05,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-11-03 03:40:05,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-11-03 03:40:05,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-11-03 03:40:05,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-11-03 03:40:05,843 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-11-03 03:40:05,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-11-03 03:40:05,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-11-03 03:40:05,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-11-03 03:40:05,849 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-11-03 03:40:05,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-11-03 03:40:05,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-11-03 03:40:05,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-11-03 03:40:05,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-11-03 03:40:05,850 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-11-03 03:40:05,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-11-03 03:40:05,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-11-03 03:40:05,851 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-11-03 03:40:05,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-11-03 03:40:05,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-11-03 03:40:05,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-11-03 03:40:05,852 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-11-03 03:40:05,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-11-03 03:40:05,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-11-03 03:40:05,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-11-03 03:40:05,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-11-03 03:40:05,853 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-11-03 03:40:05,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-11-03 03:40:05,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-11-03 03:40:05,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-11-03 03:40:05,854 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-11-03 03:40:05,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-11-03 03:40:05,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-11-03 03:40:05,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-11-03 03:40:05,855 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-11-03 03:40:05,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-11-03 03:40:05,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-11-03 03:40:05,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:40:05,856 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:40:05,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:40:05,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:40:05,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:40:05,857 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 03:40:05,858 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 03:40:05,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 03:40:05,861 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 03:40:05,865 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 03:40:05,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 03:40:05 BoogieIcfgContainer [2021-11-03 03:40:05,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 03:40:05,902 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 03:40:05,902 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 03:40:05,902 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 03:40:05,903 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 03:40:01" (3/4) ... [2021-11-03 03:40:05,904 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-03 03:40:05,946 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/witness.graphml [2021-11-03 03:40:05,946 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 03:40:05,947 INFO L168 Benchmark]: Toolchain (without parser) took 5486.88 ms. Allocated memory was 98.6 MB in the beginning and 155.2 MB in the end (delta: 56.6 MB). Free memory was 64.0 MB in the beginning and 121.3 MB in the end (delta: -57.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 03:40:05,948 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 98.6 MB. Free memory is still 52.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 03:40:05,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 524.93 ms. Allocated memory is still 98.6 MB. Free memory was 63.8 MB in the beginning and 65.8 MB in the end (delta: -2.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-03 03:40:05,949 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.76 ms. Allocated memory is still 98.6 MB. Free memory was 65.8 MB in the beginning and 63.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 03:40:05,949 INFO L168 Benchmark]: Boogie Preprocessor took 49.64 ms. Allocated memory is still 98.6 MB. Free memory was 63.6 MB in the beginning and 62.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 03:40:05,949 INFO L168 Benchmark]: RCFGBuilder took 750.27 ms. Allocated memory was 98.6 MB in the beginning and 125.8 MB in the end (delta: 27.3 MB). Free memory was 61.6 MB in the beginning and 92.1 MB in the end (delta: -30.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 16.1 GB. [2021-11-03 03:40:05,950 INFO L168 Benchmark]: TraceAbstraction took 4044.10 ms. Allocated memory was 125.8 MB in the beginning and 155.2 MB in the end (delta: 29.4 MB). Free memory was 91.5 MB in the beginning and 123.4 MB in the end (delta: -31.8 MB). Peak memory consumption was 53.9 MB. Max. memory is 16.1 GB. [2021-11-03 03:40:05,950 INFO L168 Benchmark]: Witness Printer took 44.36 ms. Allocated memory is still 155.2 MB. Free memory was 123.4 MB in the beginning and 121.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 03:40:05,952 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.19 ms. Allocated memory is still 98.6 MB. Free memory is still 52.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 524.93 ms. Allocated memory is still 98.6 MB. Free memory was 63.8 MB in the beginning and 65.8 MB in the end (delta: -2.0 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.76 ms. Allocated memory is still 98.6 MB. Free memory was 65.8 MB in the beginning and 63.6 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 49.64 ms. Allocated memory is still 98.6 MB. Free memory was 63.6 MB in the beginning and 62.0 MB in the end (delta: 1.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 750.27 ms. Allocated memory was 98.6 MB in the beginning and 125.8 MB in the end (delta: 27.3 MB). Free memory was 61.6 MB in the beginning and 92.1 MB in the end (delta: -30.5 MB). Peak memory consumption was 24.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4044.10 ms. Allocated memory was 125.8 MB in the beginning and 155.2 MB in the end (delta: 29.4 MB). Free memory was 91.5 MB in the beginning and 123.4 MB in the end (delta: -31.8 MB). Peak memory consumption was 53.9 MB. Max. memory is 16.1 GB. * Witness Printer took 44.36 ms. Allocated memory is still 155.2 MB. Free memory was 123.4 MB in the beginning and 121.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1009]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = ((void*)0) [L999] head->prev = ((void*)0) [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1000] COND TRUE __VERIFIER_nondet_int() [L1000] head->data = 1 [L1000] head->opt = head [L1001] SLL* x = head; [L1003] COND FALSE !(__VERIFIER_nondet_int()) [L1006] x = head [L1007] COND TRUE x != ((void*)0) [L1009] EXPR x->data [L1009] EXPR x->data == 2 && x->opt == x [L1009] COND TRUE !(x->data == 2 && x->opt == x) [L1009] reach_error() - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 66 error locations. Started 1 CEGAR loops. OverallTime: 3.9s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 673 SDtfs, 745 SDslu, 898 SDs, 0 SdLazy, 1767 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=0, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 84 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 593 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-03 03:40:06,002 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad43352d-bfea-4dc4-8d9b-387f8758b6f4/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)