./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 53f42b1a Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P --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-53f42b1 [2021-11-20 22:47:41,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-20 22:47:41,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-20 22:47:41,065 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-20 22:47:41,066 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-20 22:47:41,071 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-20 22:47:41,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-20 22:47:41,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-20 22:47:41,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-20 22:47:41,088 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-20 22:47:41,089 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-20 22:47:41,091 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-20 22:47:41,091 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-20 22:47:41,094 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-20 22:47:41,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-20 22:47:41,128 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-20 22:47:41,130 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-20 22:47:41,131 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-20 22:47:41,133 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-20 22:47:41,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-20 22:47:41,146 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-20 22:47:41,147 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-20 22:47:41,150 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-20 22:47:41,151 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-20 22:47:41,155 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-20 22:47:41,155 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-20 22:47:41,156 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-20 22:47:41,158 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-20 22:47:41,158 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-20 22:47:41,160 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-20 22:47:41,160 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-20 22:47:41,161 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-20 22:47:41,163 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-20 22:47:41,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-20 22:47:41,166 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-20 22:47:41,166 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-20 22:47:41,167 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-20 22:47:41,167 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-20 22:47:41,167 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-20 22:47:41,168 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-20 22:47:41,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-20 22:47:41,171 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-20 22:47:41,215 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-20 22:47:41,215 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-20 22:47:41,216 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-11-20 22:47:41,216 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-11-20 22:47:41,218 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-20 22:47:41,218 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-11-20 22:47:41,218 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-20 22:47:41,218 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-20 22:47:41,219 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-20 22:47:41,219 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-20 22:47:41,220 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-20 22:47:41,220 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-20 22:47:41,220 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-20 22:47:41,221 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-20 22:47:41,221 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-20 22:47:41,221 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-20 22:47:41,221 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-20 22:47:41,221 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2021-11-20 22:47:41,222 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-20 22:47:41,222 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-20 22:47:41,223 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-20 22:47:41,223 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-20 22:47:41,223 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-20 22:47:41,225 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-20 22:47:41,225 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-20 22:47:41,225 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-20 22:47:41,225 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-20 22:47:41,226 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-20 22:47:41,226 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-20 22:47:41,226 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-20 22:47:41,226 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-20 22:47:41,227 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-20 22:47:41,227 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-20 22:47:41,227 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-20 22:47:41,227 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 22:47:41,228 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-20 22:47:41,228 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-20 22:47:41,228 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-20 22:47:41,228 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-20 22:47:41,229 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-20 22:47:41,229 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-20 22:47:41,229 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_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/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_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P 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-20 22:47:41,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-20 22:47:41,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-20 22:47:41,575 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-20 22:47:41,576 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-20 22:47:41,577 INFO L275 PluginConnector]: CDTParser initialized [2021-11-20 22:47:41,579 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/../../sv-benchmarks/c/forester-heap/dll-optional-2.i [2021-11-20 22:47:41,648 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/data/e78102df7/9808ad6049b04dbb9b5c7b0c8a0a8860/FLAG516e4b7bc [2021-11-20 22:47:42,266 INFO L306 CDTParser]: Found 1 translation units. [2021-11-20 22:47:42,267 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/sv-benchmarks/c/forester-heap/dll-optional-2.i [2021-11-20 22:47:42,289 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/data/e78102df7/9808ad6049b04dbb9b5c7b0c8a0a8860/FLAG516e4b7bc [2021-11-20 22:47:42,577 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/data/e78102df7/9808ad6049b04dbb9b5c7b0c8a0a8860 [2021-11-20 22:47:42,581 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-20 22:47:42,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-20 22:47:42,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-20 22:47:42,587 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-20 22:47:42,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-20 22:47:42,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:47:42" (1/1) ... [2021-11-20 22:47:42,593 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e4691e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:42, skipping insertion in model container [2021-11-20 22:47:42,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:47:42" (1/1) ... [2021-11-20 22:47:42,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-20 22:47:42,664 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-20 22:47:42,990 WARN L230 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_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/sv-benchmarks/c/forester-heap/dll-optional-2.i[22706,22719] [2021-11-20 22:47:43,005 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 22:47:43,015 INFO L203 MainTranslator]: Completed pre-run [2021-11-20 22:47:43,050 WARN L230 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_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/sv-benchmarks/c/forester-heap/dll-optional-2.i[22706,22719] [2021-11-20 22:47:43,053 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-11-20 22:47:43,083 INFO L208 MainTranslator]: Completed translation [2021-11-20 22:47:43,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:43 WrapperNode [2021-11-20 22:47:43,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-20 22:47:43,085 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-20 22:47:43,085 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-20 22:47:43,085 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-20 22:47:43,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:43" (1/1) ... [2021-11-20 22:47:43,129 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:43" (1/1) ... [2021-11-20 22:47:43,157 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 121 [2021-11-20 22:47:43,157 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-20 22:47:43,158 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-20 22:47:43,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-20 22:47:43,159 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-20 22:47:43,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:43" (1/1) ... [2021-11-20 22:47:43,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:43" (1/1) ... [2021-11-20 22:47:43,171 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:43" (1/1) ... [2021-11-20 22:47:43,172 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:43" (1/1) ... [2021-11-20 22:47:43,182 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:43" (1/1) ... [2021-11-20 22:47:43,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:43" (1/1) ... [2021-11-20 22:47:43,188 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:43" (1/1) ... [2021-11-20 22:47:43,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-20 22:47:43,192 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-20 22:47:43,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-20 22:47:43,193 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-20 22:47:43,194 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:43" (1/1) ... [2021-11-20 22:47:43,206 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-20 22:47:43,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/z3 [2021-11-20 22:47:43,229 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-20 22:47:43,264 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-20 22:47:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-20 22:47:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-20 22:47:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-20 22:47:43,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-11-20 22:47:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-20 22:47:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-20 22:47:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-20 22:47:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-20 22:47:43,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-20 22:47:43,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-20 22:47:43,386 INFO L236 CfgBuilder]: Building ICFG [2021-11-20 22:47:43,387 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-11-20 22:47:43,890 INFO L277 CfgBuilder]: Performing block encoding [2021-11-20 22:47:43,942 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-20 22:47:43,942 INFO L301 CfgBuilder]: Removed 5 assume(true) statements. [2021-11-20 22:47:43,945 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:43 BoogieIcfgContainer [2021-11-20 22:47:43,945 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-20 22:47:43,947 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-20 22:47:43,947 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-20 22:47:43,951 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-20 22:47:43,951 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:47:42" (1/3) ... [2021-11-20 22:47:43,952 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351736f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:47:43, skipping insertion in model container [2021-11-20 22:47:43,952 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:47:43" (2/3) ... [2021-11-20 22:47:43,953 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@351736f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:47:43, skipping insertion in model container [2021-11-20 22:47:43,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:43" (3/3) ... [2021-11-20 22:47:43,954 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-2.i [2021-11-20 22:47:43,960 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-20 22:47:43,960 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2021-11-20 22:47:44,016 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-20 22:47:44,028 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-20 22:47:44,028 INFO L340 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2021-11-20 22:47:44,049 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-20 22:47:44,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-20 22:47:44,071 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:44,073 INFO L514 BasicCegarLoop]: trace histogram [1, 1] [2021-11-20 22:47:44,074 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-20 22:47:44,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:44,080 INFO L85 PathProgramCache]: Analyzing trace with hash 7847, now seen corresponding path program 1 times [2021-11-20 22:47:44,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 22:47:44,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160798803] [2021-11-20 22:47:44,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:44,091 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 22:47:44,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:44,278 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-20 22:47:44,278 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 22:47:44,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160798803] [2021-11-20 22:47:44,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160798803] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 22:47:44,280 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:47:44,281 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-20 22:47:44,282 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368463238] [2021-11-20 22:47:44,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 22:47:44,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 22:47:44,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 22:47:44,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 22:47:44,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 22:47:44,327 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-20 22:47:44,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:47:44,569 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2021-11-20 22:47:44,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 22:47:44,572 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-20 22:47:44,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:47:44,581 INFO L225 Difference]: With dead ends: 118 [2021-11-20 22:47:44,581 INFO L226 Difference]: Without dead ends: 116 [2021-11-20 22:47:44,583 INFO L932 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-20 22:47:44,586 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 103 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 22:47:44,588 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 52 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 22:47:44,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-11-20 22:47:44,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2021-11-20 22:47:44,630 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-20 22:47:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2021-11-20 22:47:44,638 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 2 [2021-11-20 22:47:44,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:47:44,638 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2021-11-20 22:47:44,639 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-20 22:47:44,639 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2021-11-20 22:47:44,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-11-20 22:47:44,640 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:44,640 INFO L514 BasicCegarLoop]: trace histogram [1, 1] [2021-11-20 22:47:44,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-20 22:47:44,641 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-20 22:47:44,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:44,643 INFO L85 PathProgramCache]: Analyzing trace with hash 7848, now seen corresponding path program 1 times [2021-11-20 22:47:44,643 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 22:47:44,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054918031] [2021-11-20 22:47:44,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:44,644 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 22:47:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:44,733 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-20 22:47:44,734 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 22:47:44,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054918031] [2021-11-20 22:47:44,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054918031] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 22:47:44,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:47:44,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-20 22:47:44,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733596513] [2021-11-20 22:47:44,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 22:47:44,736 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-20 22:47:44,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 22:47:44,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-20 22:47:44,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-20 22:47:44,737 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-20 22:47:44,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:47:44,877 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2021-11-20 22:47:44,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-20 22:47:44,878 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-20 22:47:44,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:47:44,879 INFO L225 Difference]: With dead ends: 105 [2021-11-20 22:47:44,880 INFO L226 Difference]: Without dead ends: 105 [2021-11-20 22:47:44,880 INFO L932 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-20 22:47:44,882 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 80 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 22:47:44,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 67 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 22:47:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-11-20 22:47:44,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2021-11-20 22:47:44,890 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-20 22:47:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2021-11-20 22:47:44,892 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 2 [2021-11-20 22:47:44,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:47:44,892 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2021-11-20 22:47:44,893 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-20 22:47:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2021-11-20 22:47:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-20 22:47:44,893 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:44,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:44,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-20 22:47:44,894 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-20 22:47:44,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash -832928076, now seen corresponding path program 1 times [2021-11-20 22:47:44,895 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 22:47:44,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927962244] [2021-11-20 22:47:44,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:44,895 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 22:47:44,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:44,965 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-20 22:47:44,966 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 22:47:44,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927962244] [2021-11-20 22:47:44,966 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927962244] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 22:47:44,966 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:47:44,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 22:47:44,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31022152] [2021-11-20 22:47:44,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 22:47:44,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 22:47:44,967 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 22:47:44,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 22:47:44,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 22:47:44,968 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-20 22:47:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:47:45,202 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2021-11-20 22:47:45,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 22:47:45,204 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-20 22:47:45,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:47:45,205 INFO L225 Difference]: With dead ends: 126 [2021-11-20 22:47:45,205 INFO L226 Difference]: Without dead ends: 126 [2021-11-20 22:47:45,205 INFO L932 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-20 22:47:45,207 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 28 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 22:47:45,208 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 212 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 22:47:45,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-11-20 22:47:45,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2021-11-20 22:47:45,223 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-20 22:47:45,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2021-11-20 22:47:45,224 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 8 [2021-11-20 22:47:45,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:47:45,225 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2021-11-20 22:47:45,225 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-20 22:47:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2021-11-20 22:47:45,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-11-20 22:47:45,226 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:45,226 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:45,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-20 22:47:45,226 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-20 22:47:45,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:45,227 INFO L85 PathProgramCache]: Analyzing trace with hash -832928075, now seen corresponding path program 1 times [2021-11-20 22:47:45,227 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 22:47:45,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244328467] [2021-11-20 22:47:45,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:45,228 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 22:47:45,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:45,340 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-20 22:47:45,340 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 22:47:45,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244328467] [2021-11-20 22:47:45,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244328467] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 22:47:45,341 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:47:45,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 22:47:45,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624092608] [2021-11-20 22:47:45,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 22:47:45,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 22:47:45,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 22:47:45,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 22:47:45,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 22:47:45,346 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-20 22:47:45,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:47:45,573 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2021-11-20 22:47:45,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 22:47:45,573 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-20 22:47:45,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:47:45,574 INFO L225 Difference]: With dead ends: 100 [2021-11-20 22:47:45,575 INFO L226 Difference]: Without dead ends: 100 [2021-11-20 22:47:45,575 INFO L932 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-20 22:47:45,585 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 22:47:45,587 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 235 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 22:47:45,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-20 22:47:45,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-11-20 22:47:45,594 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-20 22:47:45,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2021-11-20 22:47:45,595 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 8 [2021-11-20 22:47:45,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:47:45,595 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2021-11-20 22:47:45,596 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-20 22:47:45,596 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2021-11-20 22:47:45,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 22:47:45,596 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:45,597 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:45,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-20 22:47:45,597 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-20 22:47:45,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:45,597 INFO L85 PathProgramCache]: Analyzing trace with hash -1417727733, now seen corresponding path program 1 times [2021-11-20 22:47:45,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 22:47:45,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268828413] [2021-11-20 22:47:45,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:45,598 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 22:47:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:45,670 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-20 22:47:45,670 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 22:47:45,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268828413] [2021-11-20 22:47:45,671 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268828413] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 22:47:45,671 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:47:45,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 22:47:45,671 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057073445] [2021-11-20 22:47:45,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 22:47:45,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 22:47:45,672 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 22:47:45,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 22:47:45,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 22:47:45,673 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), 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-20 22:47:45,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:47:45,810 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2021-11-20 22:47:45,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 22:47:45,812 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-20 22:47:45,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:47:45,816 INFO L225 Difference]: With dead ends: 100 [2021-11-20 22:47:45,817 INFO L226 Difference]: Without dead ends: 100 [2021-11-20 22:47:45,817 INFO L932 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-20 22:47:45,821 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 120 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 22:47:45,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 45 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 22:47:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-20 22:47:45,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2021-11-20 22:47:45,835 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-20 22:47:45,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2021-11-20 22:47:45,842 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 11 [2021-11-20 22:47:45,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:47:45,842 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2021-11-20 22:47:45,842 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-20 22:47:45,843 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2021-11-20 22:47:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-20 22:47:45,843 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:45,843 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:45,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-20 22:47:45,844 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-20 22:47:45,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:45,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1417727732, now seen corresponding path program 1 times [2021-11-20 22:47:45,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 22:47:45,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284726332] [2021-11-20 22:47:45,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:45,846 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 22:47:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:45,950 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-20 22:47:45,950 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 22:47:45,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284726332] [2021-11-20 22:47:45,951 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284726332] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 22:47:45,951 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:47:45,951 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-20 22:47:45,951 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537537496] [2021-11-20 22:47:45,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 22:47:45,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 22:47:45,952 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 22:47:45,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 22:47:45,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 22:47:45,953 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-20 22:47:46,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:47:46,124 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2021-11-20 22:47:46,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 22:47:46,124 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-20 22:47:46,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:47:46,125 INFO L225 Difference]: With dead ends: 130 [2021-11-20 22:47:46,126 INFO L226 Difference]: Without dead ends: 130 [2021-11-20 22:47:46,126 INFO L932 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-20 22:47:46,127 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 110 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 22:47:46,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 74 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 22:47:46,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-11-20 22:47:46,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2021-11-20 22:47:46,132 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-20 22:47:46,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2021-11-20 22:47:46,138 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 11 [2021-11-20 22:47:46,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:47:46,139 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2021-11-20 22:47:46,139 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-20 22:47:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2021-11-20 22:47:46,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 22:47:46,140 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:46,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:46,140 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-20 22:47:46,140 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-20 22:47:46,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:46,141 INFO L85 PathProgramCache]: Analyzing trace with hash -931567606, now seen corresponding path program 1 times [2021-11-20 22:47:46,142 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 22:47:46,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948138886] [2021-11-20 22:47:46,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:46,142 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 22:47:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:46,226 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-20 22:47:46,227 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 22:47:46,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948138886] [2021-11-20 22:47:46,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948138886] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 22:47:46,228 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:47:46,228 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 22:47:46,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7092668] [2021-11-20 22:47:46,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 22:47:46,229 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 22:47:46,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 22:47:46,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 22:47:46,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 22:47:46,230 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-20 22:47:46,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:47:46,369 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2021-11-20 22:47:46,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 22:47:46,370 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-20 22:47:46,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:47:46,371 INFO L225 Difference]: With dead ends: 110 [2021-11-20 22:47:46,371 INFO L226 Difference]: Without dead ends: 110 [2021-11-20 22:47:46,371 INFO L932 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-20 22:47:46,372 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 6 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 22:47:46,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 190 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 22:47:46,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-20 22:47:46,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-11-20 22:47:46,385 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-20 22:47:46,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2021-11-20 22:47:46,390 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 13 [2021-11-20 22:47:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:47:46,390 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2021-11-20 22:47:46,391 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-20 22:47:46,391 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2021-11-20 22:47:46,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-20 22:47:46,392 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:46,392 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:46,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-20 22:47:46,392 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-20 22:47:46,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:46,393 INFO L85 PathProgramCache]: Analyzing trace with hash -931567605, now seen corresponding path program 1 times [2021-11-20 22:47:46,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 22:47:46,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771280811] [2021-11-20 22:47:46,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:46,396 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 22:47:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:46,487 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-20 22:47:46,487 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 22:47:46,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771280811] [2021-11-20 22:47:46,488 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771280811] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 22:47:46,488 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:47:46,488 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-20 22:47:46,488 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15600408] [2021-11-20 22:47:46,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 22:47:46,489 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-20 22:47:46,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 22:47:46,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-20 22:47:46,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-20 22:47:46,490 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-20 22:47:46,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:47:46,649 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2021-11-20 22:47:46,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-20 22:47:46,649 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-20 22:47:46,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:47:46,650 INFO L225 Difference]: With dead ends: 109 [2021-11-20 22:47:46,650 INFO L226 Difference]: Without dead ends: 109 [2021-11-20 22:47:46,650 INFO L932 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-20 22:47:46,651 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 3 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 22:47:46,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 183 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 22:47:46,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-11-20 22:47:46,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-11-20 22:47:46,655 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-20 22:47:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2021-11-20 22:47:46,656 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 13 [2021-11-20 22:47:46,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:47:46,656 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2021-11-20 22:47:46,657 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-20 22:47:46,657 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2021-11-20 22:47:46,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-20 22:47:46,657 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:46,658 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:46,658 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-20 22:47:46,658 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-20 22:47:46,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:46,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1181636105, now seen corresponding path program 1 times [2021-11-20 22:47:46,658 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 22:47:46,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267878659] [2021-11-20 22:47:46,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:46,659 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 22:47:46,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:46,687 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-20 22:47:46,687 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 22:47:46,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267878659] [2021-11-20 22:47:46,687 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267878659] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 22:47:46,687 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:47:46,687 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-20 22:47:46,688 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521261817] [2021-11-20 22:47:46,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 22:47:46,688 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-20 22:47:46,688 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 22:47:46,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-20 22:47:46,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-20 22:47:46,689 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-20 22:47:46,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:47:46,799 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2021-11-20 22:47:46,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-20 22:47:46,800 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-20 22:47:46,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:47:46,801 INFO L225 Difference]: With dead ends: 123 [2021-11-20 22:47:46,801 INFO L226 Difference]: Without dead ends: 123 [2021-11-20 22:47:46,801 INFO L932 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-20 22:47:46,802 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 101 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-11-20 22:47:46,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 102 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-11-20 22:47:46,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-11-20 22:47:46,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2021-11-20 22:47:46,805 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-20 22:47:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2021-11-20 22:47:46,806 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 14 [2021-11-20 22:47:46,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:47:46,807 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2021-11-20 22:47:46,807 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-20 22:47:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2021-11-20 22:47:46,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-20 22:47:46,808 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:46,808 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:46,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-20 22:47:46,808 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-20 22:47:46,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:46,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1883114057, now seen corresponding path program 1 times [2021-11-20 22:47:46,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 22:47:46,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729191299] [2021-11-20 22:47:46,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:46,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 22:47:46,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:46,891 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-20 22:47:46,891 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 22:47:46,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729191299] [2021-11-20 22:47:46,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729191299] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 22:47:46,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:47:46,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-20 22:47:46,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404041519] [2021-11-20 22:47:46,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 22:47:46,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-20 22:47:46,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 22:47:46,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-20 22:47:46,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-11-20 22:47:46,893 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-20 22:47:47,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:47:47,159 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2021-11-20 22:47:47,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-20 22:47:47,159 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-20 22:47:47,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:47:47,160 INFO L225 Difference]: With dead ends: 110 [2021-11-20 22:47:47,160 INFO L226 Difference]: Without dead ends: 110 [2021-11-20 22:47:47,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-11-20 22:47:47,161 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 111 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-11-20 22:47:47,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 100 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-11-20 22:47:47,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-20 22:47:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2021-11-20 22:47:47,164 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-20 22:47:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2021-11-20 22:47:47,165 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 15 [2021-11-20 22:47:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:47:47,166 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2021-11-20 22:47:47,166 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-20 22:47:47,166 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2021-11-20 22:47:47,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-11-20 22:47:47,166 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:47,167 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:47,167 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-20 22:47:47,167 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-20 22:47:47,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:47,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1883114056, now seen corresponding path program 1 times [2021-11-20 22:47:47,167 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 22:47:47,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887073912] [2021-11-20 22:47:47,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:47,168 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 22:47:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-20 22:47:47,290 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-20 22:47:47,290 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-20 22:47:47,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887073912] [2021-11-20 22:47:47,290 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887073912] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-20 22:47:47,291 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-11-20 22:47:47,291 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-11-20 22:47:47,291 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488141120] [2021-11-20 22:47:47,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-11-20 22:47:47,291 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-11-20 22:47:47,291 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-20 22:47:47,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-11-20 22:47:47,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-11-20 22:47:47,292 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-20 22:47:47,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-20 22:47:47,705 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2021-11-20 22:47:47,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-11-20 22:47:47,706 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-20 22:47:47,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-20 22:47:47,707 INFO L225 Difference]: With dead ends: 100 [2021-11-20 22:47:47,707 INFO L226 Difference]: Without dead ends: 100 [2021-11-20 22:47:47,707 INFO L932 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-20 22:47:47,708 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 99 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-11-20 22:47:47,708 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 188 Invalid, 393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-11-20 22:47:47,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-11-20 22:47:47,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2021-11-20 22:47:47,711 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-20 22:47:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2021-11-20 22:47:47,712 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 15 [2021-11-20 22:47:47,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-20 22:47:47,712 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2021-11-20 22:47:47,713 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-20 22:47:47,713 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2021-11-20 22:47:47,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-20 22:47:47,714 INFO L506 BasicCegarLoop]: Found error trace [2021-11-20 22:47:47,714 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:47,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-20 22:47:47,714 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-20 22:47:47,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-20 22:47:47,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1584318480, now seen corresponding path program 1 times [2021-11-20 22:47:47,715 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-20 22:47:47,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931568243] [2021-11-20 22:47:47,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-20 22:47:47,716 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-20 22:47:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 22:47:47,726 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-20 22:47:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-20 22:47:47,754 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-20 22:47:47,755 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-11-20 22:47:47,756 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK (65 of 66 remaining) [2021-11-20 22:47:47,757 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (64 of 66 remaining) [2021-11-20 22:47:47,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (63 of 66 remaining) [2021-11-20 22:47:47,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (62 of 66 remaining) [2021-11-20 22:47:47,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (61 of 66 remaining) [2021-11-20 22:47:47,758 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (60 of 66 remaining) [2021-11-20 22:47:47,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (59 of 66 remaining) [2021-11-20 22:47:47,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (58 of 66 remaining) [2021-11-20 22:47:47,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (57 of 66 remaining) [2021-11-20 22:47:47,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (56 of 66 remaining) [2021-11-20 22:47:47,759 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (55 of 66 remaining) [2021-11-20 22:47:47,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (54 of 66 remaining) [2021-11-20 22:47:47,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (53 of 66 remaining) [2021-11-20 22:47:47,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (52 of 66 remaining) [2021-11-20 22:47:47,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (51 of 66 remaining) [2021-11-20 22:47:47,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (50 of 66 remaining) [2021-11-20 22:47:47,760 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (49 of 66 remaining) [2021-11-20 22:47:47,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (48 of 66 remaining) [2021-11-20 22:47:47,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (47 of 66 remaining) [2021-11-20 22:47:47,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (46 of 66 remaining) [2021-11-20 22:47:47,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (45 of 66 remaining) [2021-11-20 22:47:47,761 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (44 of 66 remaining) [2021-11-20 22:47:47,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (43 of 66 remaining) [2021-11-20 22:47:47,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (42 of 66 remaining) [2021-11-20 22:47:47,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (41 of 66 remaining) [2021-11-20 22:47:47,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (40 of 66 remaining) [2021-11-20 22:47:47,762 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (39 of 66 remaining) [2021-11-20 22:47:47,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (38 of 66 remaining) [2021-11-20 22:47:47,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (37 of 66 remaining) [2021-11-20 22:47:47,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (36 of 66 remaining) [2021-11-20 22:47:47,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (35 of 66 remaining) [2021-11-20 22:47:47,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (34 of 66 remaining) [2021-11-20 22:47:47,763 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (33 of 66 remaining) [2021-11-20 22:47:47,764 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (32 of 66 remaining) [2021-11-20 22:47:47,764 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (31 of 66 remaining) [2021-11-20 22:47:47,764 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (30 of 66 remaining) [2021-11-20 22:47:47,764 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (29 of 66 remaining) [2021-11-20 22:47:47,764 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (28 of 66 remaining) [2021-11-20 22:47:47,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (27 of 66 remaining) [2021-11-20 22:47:47,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (26 of 66 remaining) [2021-11-20 22:47:47,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (25 of 66 remaining) [2021-11-20 22:47:47,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (24 of 66 remaining) [2021-11-20 22:47:47,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (23 of 66 remaining) [2021-11-20 22:47:47,765 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (22 of 66 remaining) [2021-11-20 22:47:47,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (21 of 66 remaining) [2021-11-20 22:47:47,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (20 of 66 remaining) [2021-11-20 22:47:47,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (19 of 66 remaining) [2021-11-20 22:47:47,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (18 of 66 remaining) [2021-11-20 22:47:47,766 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (17 of 66 remaining) [2021-11-20 22:47:47,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (16 of 66 remaining) [2021-11-20 22:47:47,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (15 of 66 remaining) [2021-11-20 22:47:47,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (14 of 66 remaining) [2021-11-20 22:47:47,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (13 of 66 remaining) [2021-11-20 22:47:47,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (12 of 66 remaining) [2021-11-20 22:47:47,767 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (11 of 66 remaining) [2021-11-20 22:47:47,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (10 of 66 remaining) [2021-11-20 22:47:47,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (9 of 66 remaining) [2021-11-20 22:47:47,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION (8 of 66 remaining) [2021-11-20 22:47:47,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (7 of 66 remaining) [2021-11-20 22:47:47,768 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE (6 of 66 remaining) [2021-11-20 22:47:47,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE (5 of 66 remaining) [2021-11-20 22:47:47,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE (4 of 66 remaining) [2021-11-20 22:47:47,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE (3 of 66 remaining) [2021-11-20 22:47:47,769 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE (2 of 66 remaining) [2021-11-20 22:47:47,770 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (1 of 66 remaining) [2021-11-20 22:47:47,770 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK (0 of 66 remaining) [2021-11-20 22:47:47,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-20 22:47:47,773 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-20 22:47:47,777 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-20 22:47:47,801 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:47:47 BoogieIcfgContainer [2021-11-20 22:47:47,801 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-20 22:47:47,801 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-20 22:47:47,802 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-20 22:47:47,802 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-20 22:47:47,802 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:47:43" (3/4) ... [2021-11-20 22:47:47,804 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-20 22:47:47,837 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/witness.graphml [2021-11-20 22:47:47,837 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-20 22:47:47,837 INFO L158 Benchmark]: Toolchain (without parser) took 5254.29ms. Allocated memory is still 127.9MB. Free memory was 99.3MB in the beginning and 68.2MB in the end (delta: 31.1MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2021-11-20 22:47:47,838 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 83.9MB. Free memory was 50.4MB in the beginning and 50.4MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 22:47:47,838 INFO L158 Benchmark]: CACSL2BoogieTranslator took 498.04ms. Allocated memory is still 127.9MB. Free memory was 99.1MB in the beginning and 82.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2021-11-20 22:47:47,839 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.64ms. Allocated memory is still 127.9MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 22:47:47,839 INFO L158 Benchmark]: Boogie Preprocessor took 33.06ms. Allocated memory is still 127.9MB. Free memory was 80.0MB in the beginning and 78.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 22:47:47,839 INFO L158 Benchmark]: RCFGBuilder took 753.54ms. Allocated memory is still 127.9MB. Free memory was 78.2MB in the beginning and 54.6MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-11-20 22:47:47,840 INFO L158 Benchmark]: TraceAbstraction took 3853.78ms. Allocated memory is still 127.9MB. Free memory was 54.0MB in the beginning and 69.2MB in the end (delta: -15.2MB). There was no memory consumed. Max. memory is 16.1GB. [2021-11-20 22:47:47,840 INFO L158 Benchmark]: Witness Printer took 35.45ms. Allocated memory is still 127.9MB. Free memory was 69.2MB in the beginning and 68.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-11-20 22:47:47,842 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.30ms. Allocated memory is still 83.9MB. Free memory was 50.4MB in the beginning and 50.4MB in the end (delta: 42.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 498.04ms. Allocated memory is still 127.9MB. Free memory was 99.1MB in the beginning and 82.3MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.64ms. Allocated memory is still 127.9MB. Free memory was 82.1MB in the beginning and 80.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.06ms. Allocated memory is still 127.9MB. Free memory was 80.0MB in the beginning and 78.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 753.54ms. Allocated memory is still 127.9MB. Free memory was 78.2MB in the beginning and 54.6MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3853.78ms. Allocated memory is still 127.9MB. Free memory was 54.0MB in the beginning and 69.2MB in the end (delta: -15.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 35.45ms. Allocated memory is still 127.9MB. Free memory was 69.2MB in the beginning and 68.2MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * 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) VAL [head={-1:0}] [L999] head->prev = ((void*)0) [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1000] COND TRUE __VERIFIER_nondet_int() [L1000] head->data = 1 VAL [head={-1:0}] [L1000] head->opt = head VAL [head={-1:0}] [L1001] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1003] COND FALSE !(__VERIFIER_nondet_int()) [L1006] x = head VAL [head={-1:0}, x={-1:0}] [L1007] COND TRUE x != ((void*)0) VAL [head={-1:0}, x={-1:0}] [L1009] EXPR x->data [L1009] EXPR x->data == 2 && x->opt == x VAL [head={-1:0}, x={-1:0}, x->data=1, x->data == 2 && x->opt == x=0] [L1009] COND TRUE !(x->data == 2 && x->opt == x) [L1009] reach_error() VAL [head={-1:0}, x={-1:0}] - 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.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 762 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 762 mSDsluCounter, 1448 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 878 mSDsCounter, 153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1801 IncrementalHoareTripleChecker+Invalid, 1954 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 153 mSolverCounterUnsat, 596 mSDtfsCounter, 1801 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 53 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, 583 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-20 22:47:47,921 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b6228ba2-391a-41ed-8e9e-6f6e5768f16d/bin/utaipan-TEXQjIfE4P/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)