./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 b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/dll-optional-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG --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 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 04:44:14,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 04:44:14,460 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 04:44:14,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 04:44:14,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 04:44:14,537 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 04:44:14,539 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 04:44:14,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 04:44:14,544 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 04:44:14,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 04:44:14,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 04:44:14,548 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 04:44:14,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 04:44:14,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 04:44:14,563 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 04:44:14,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 04:44:14,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 04:44:14,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 04:44:14,575 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 04:44:14,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 04:44:14,586 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 04:44:14,588 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 04:44:14,592 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 04:44:14,594 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 04:44:14,601 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 04:44:14,602 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 04:44:14,602 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 04:44:14,605 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 04:44:14,606 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 04:44:14,608 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 04:44:14,609 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 04:44:14,610 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 04:44:14,613 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 04:44:14,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 04:44:14,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 04:44:14,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 04:44:14,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 04:44:14,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 04:44:14,619 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 04:44:14,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 04:44:14,622 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 04:44:14,623 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-10-29 04:44:14,696 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 04:44:14,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 04:44:14,698 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 04:44:14,699 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 04:44:14,699 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 04:44:14,699 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 04:44:14,700 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 04:44:14,700 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 04:44:14,700 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 04:44:14,701 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 04:44:14,702 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 04:44:14,703 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 04:44:14,703 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 04:44:14,703 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 04:44:14,704 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 04:44:14,704 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 04:44:14,705 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 04:44:14,705 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 04:44:14,705 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 04:44:14,706 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-29 04:44:14,706 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 04:44:14,706 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 04:44:14,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 04:44:14,707 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-29 04:44:14,707 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-29 04:44:14,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 04:44:14,708 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 04:44:14,708 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 04:44:14,709 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 04:44:14,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 04:44:14,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 04:44:14,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:44:14,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 04:44:14,711 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 04:44:14,711 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 04:44:14,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 04:44:14,711 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 04:44:14,712 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 04:44:14,712 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_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/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_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG 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-10-29 04:44:15,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 04:44:15,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 04:44:15,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 04:44:15,056 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 04:44:15,057 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 04:44:15,058 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/forester-heap/dll-optional-2.i [2021-10-29 04:44:15,151 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/data/b828815ef/4f093092395245f0a7b814a0b7890143/FLAG244f3e29f [2021-10-29 04:44:15,858 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 04:44:15,859 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/sv-benchmarks/c/forester-heap/dll-optional-2.i [2021-10-29 04:44:15,906 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/data/b828815ef/4f093092395245f0a7b814a0b7890143/FLAG244f3e29f [2021-10-29 04:44:16,118 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/data/b828815ef/4f093092395245f0a7b814a0b7890143 [2021-10-29 04:44:16,122 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 04:44:16,124 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 04:44:16,126 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 04:44:16,126 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 04:44:16,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 04:44:16,133 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:44:16" (1/1) ... [2021-10-29 04:44:16,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d62e378 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:44:16, skipping insertion in model container [2021-10-29 04:44:16,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 04:44:16" (1/1) ... [2021-10-29 04:44:16,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 04:44:16,202 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 04:44:16,623 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/sv-benchmarks/c/forester-heap/dll-optional-2.i[22706,22719] [2021-10-29 04:44:16,643 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:44:16,653 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 04:44:16,699 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/sv-benchmarks/c/forester-heap/dll-optional-2.i[22706,22719] [2021-10-29 04:44:16,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 04:44:16,752 INFO L208 MainTranslator]: Completed translation [2021-10-29 04:44:16,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:44:16 WrapperNode [2021-10-29 04:44:16,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 04:44:16,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 04:44:16,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 04:44:16,755 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 04:44:16,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:44:16" (1/1) ... [2021-10-29 04:44:16,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:44:16" (1/1) ... [2021-10-29 04:44:16,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 04:44:16,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 04:44:16,816 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 04:44:16,816 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 04:44:16,832 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:44:16" (1/1) ... [2021-10-29 04:44:16,833 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:44:16" (1/1) ... [2021-10-29 04:44:16,839 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:44:16" (1/1) ... [2021-10-29 04:44:16,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:44:16" (1/1) ... [2021-10-29 04:44:16,868 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:44:16" (1/1) ... [2021-10-29 04:44:16,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:44:16" (1/1) ... [2021-10-29 04:44:16,884 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:44:16" (1/1) ... [2021-10-29 04:44:16,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 04:44:16,889 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 04:44:16,889 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 04:44:16,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 04:44:16,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:44:16" (1/1) ... [2021-10-29 04:44:16,904 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 04:44:16,917 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 04:44:16,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 04:44:16,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 04:44:17,000 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-29 04:44:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-29 04:44:17,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-29 04:44:17,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-29 04:44:17,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 04:44:17,004 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-29 04:44:17,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-29 04:44:17,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 04:44:17,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 04:44:17,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 04:44:17,993 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 04:44:17,994 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2021-10-29 04:44:17,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:44:17 BoogieIcfgContainer [2021-10-29 04:44:17,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 04:44:17,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 04:44:17,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 04:44:18,005 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 04:44:18,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 04:44:16" (1/3) ... [2021-10-29 04:44:18,006 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f520fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:44:18, skipping insertion in model container [2021-10-29 04:44:18,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 04:44:16" (2/3) ... [2021-10-29 04:44:18,007 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f520fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 04:44:18, skipping insertion in model container [2021-10-29 04:44:18,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:44:17" (3/3) ... [2021-10-29 04:44:18,009 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-optional-2.i [2021-10-29 04:44:18,020 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 04:44:18,021 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 66 error locations. [2021-10-29 04:44:18,120 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 04:44:18,134 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 04:44:18,134 INFO L340 AbstractCegarLoop]: Starting to check reachability of 66 error locations. [2021-10-29 04:44:18,167 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-10-29 04:44:18,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-29 04:44:18,175 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:18,176 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-10-29 04:44:18,177 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-10-29 04:44:18,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:18,193 INFO L85 PathProgramCache]: Analyzing trace with hash 7847, now seen corresponding path program 1 times [2021-10-29 04:44:18,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:44:18,203 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400631375] [2021-10-29 04:44:18,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:18,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:44:18,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:18,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:18,405 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:44:18,405 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400631375] [2021-10-29 04:44:18,406 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400631375] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:18,407 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:18,407 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-29 04:44:18,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343301315] [2021-10-29 04:44:18,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:44:18,415 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:44:18,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:44:18,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:44:18,437 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-10-29 04:44:18,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:18,662 INFO L93 Difference]: Finished difference Result 118 states and 126 transitions. [2021-10-29 04:44:18,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:44:18,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-29 04:44:18,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:18,684 INFO L225 Difference]: With dead ends: 118 [2021-10-29 04:44:18,685 INFO L226 Difference]: Without dead ends: 116 [2021-10-29 04:44:18,688 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:44:18,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2021-10-29 04:44:18,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 111. [2021-10-29 04:44:18,736 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-10-29 04:44:18,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2021-10-29 04:44:18,741 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 2 [2021-10-29 04:44:18,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:18,741 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2021-10-29 04:44:18,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:44:18,742 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2021-10-29 04:44:18,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-29 04:44:18,743 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:18,743 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-10-29 04:44:18,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 04:44:18,743 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-10-29 04:44:18,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:18,745 INFO L85 PathProgramCache]: Analyzing trace with hash 7848, now seen corresponding path program 1 times [2021-10-29 04:44:18,745 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:44:18,745 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992269097] [2021-10-29 04:44:18,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:18,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:44:18,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:18,804 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:44:18,804 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992269097] [2021-10-29 04:44:18,805 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992269097] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:18,805 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:18,805 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-29 04:44:18,805 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618946941] [2021-10-29 04:44:18,807 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 04:44:18,807 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:44:18,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 04:44:18,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:44:18,809 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-10-29 04:44:18,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:18,971 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2021-10-29 04:44:18,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 04:44:18,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2021-10-29 04:44:18,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:18,974 INFO L225 Difference]: With dead ends: 105 [2021-10-29 04:44:18,974 INFO L226 Difference]: Without dead ends: 105 [2021-10-29 04:44:18,975 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 04:44:18,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-10-29 04:44:18,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2021-10-29 04:44:18,984 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-10-29 04:44:18,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2021-10-29 04:44:18,987 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 2 [2021-10-29 04:44:18,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:18,987 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2021-10-29 04:44:18,987 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:44:18,988 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2021-10-29 04:44:18,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-29 04:44:18,988 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:18,989 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:18,989 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 04:44:18,989 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-10-29 04:44:18,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:18,990 INFO L85 PathProgramCache]: Analyzing trace with hash -832928076, now seen corresponding path program 1 times [2021-10-29 04:44:18,990 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:44:18,991 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155261150] [2021-10-29 04:44:18,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:18,991 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:44:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:19,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:19,089 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:44:19,090 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155261150] [2021-10-29 04:44:19,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155261150] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:19,090 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:19,090 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:44:19,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258657565] [2021-10-29 04:44:19,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:44:19,091 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:44:19,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:44:19,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:44:19,093 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-10-29 04:44:19,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:19,371 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2021-10-29 04:44:19,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:44:19,371 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-29 04:44:19,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:19,373 INFO L225 Difference]: With dead ends: 126 [2021-10-29 04:44:19,373 INFO L226 Difference]: Without dead ends: 126 [2021-10-29 04:44:19,374 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:44:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2021-10-29 04:44:19,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 101. [2021-10-29 04:44:19,383 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-10-29 04:44:19,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2021-10-29 04:44:19,385 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 8 [2021-10-29 04:44:19,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:19,386 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2021-10-29 04:44:19,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:44:19,386 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2021-10-29 04:44:19,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-29 04:44:19,387 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:19,387 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:19,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 04:44:19,388 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-10-29 04:44:19,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:19,389 INFO L85 PathProgramCache]: Analyzing trace with hash -832928075, now seen corresponding path program 1 times [2021-10-29 04:44:19,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:44:19,389 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768843128] [2021-10-29 04:44:19,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:19,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:44:19,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:19,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:19,557 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:44:19,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768843128] [2021-10-29 04:44:19,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768843128] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:19,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:19,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:44:19,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142253109] [2021-10-29 04:44:19,559 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:44:19,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:44:19,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:44:19,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:44:19,561 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-10-29 04:44:19,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:19,793 INFO L93 Difference]: Finished difference Result 100 states and 110 transitions. [2021-10-29 04:44:19,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:44:19,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2021-10-29 04:44:19,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:19,796 INFO L225 Difference]: With dead ends: 100 [2021-10-29 04:44:19,796 INFO L226 Difference]: Without dead ends: 100 [2021-10-29 04:44:19,796 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:44:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-10-29 04:44:19,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2021-10-29 04:44:19,811 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-10-29 04:44:19,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2021-10-29 04:44:19,819 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 8 [2021-10-29 04:44:19,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:19,820 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2021-10-29 04:44:19,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:44:19,820 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2021-10-29 04:44:19,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-29 04:44:19,821 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:19,822 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:19,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 04:44:19,822 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-10-29 04:44:19,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:19,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1417727733, now seen corresponding path program 1 times [2021-10-29 04:44:19,825 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:44:19,825 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639991815] [2021-10-29 04:44:19,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:19,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:44:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:19,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:19,956 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:44:19,957 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639991815] [2021-10-29 04:44:19,957 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639991815] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:19,957 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:19,957 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:44:19,958 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598688077] [2021-10-29 04:44:19,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:44:19,959 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:44:19,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:44:19,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:44:19,960 INFO L87 Difference]: Start difference. First operand 100 states and 110 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:44:20,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:20,166 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2021-10-29 04:44:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:44:20,167 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-29 04:44:20,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:20,168 INFO L225 Difference]: With dead ends: 100 [2021-10-29 04:44:20,169 INFO L226 Difference]: Without dead ends: 100 [2021-10-29 04:44:20,169 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:44:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-10-29 04:44:20,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2021-10-29 04:44:20,175 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-10-29 04:44:20,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2021-10-29 04:44:20,176 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 11 [2021-10-29 04:44:20,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:20,177 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2021-10-29 04:44:20,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:44:20,177 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2021-10-29 04:44:20,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-29 04:44:20,178 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:20,178 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:20,178 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 04:44:20,179 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-10-29 04:44:20,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:20,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1417727732, now seen corresponding path program 1 times [2021-10-29 04:44:20,180 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:44:20,180 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205590777] [2021-10-29 04:44:20,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:20,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:44:20,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:20,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:20,295 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:44:20,295 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205590777] [2021-10-29 04:44:20,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205590777] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:20,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:20,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 04:44:20,296 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398549379] [2021-10-29 04:44:20,296 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:44:20,297 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:44:20,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:44:20,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:44:20,298 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-10-29 04:44:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:20,526 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2021-10-29 04:44:20,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:44:20,527 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-10-29 04:44:20,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:20,528 INFO L225 Difference]: With dead ends: 130 [2021-10-29 04:44:20,528 INFO L226 Difference]: Without dead ends: 130 [2021-10-29 04:44:20,529 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:44:20,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2021-10-29 04:44:20,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 111. [2021-10-29 04:44:20,536 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-10-29 04:44:20,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 132 transitions. [2021-10-29 04:44:20,537 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 132 transitions. Word has length 11 [2021-10-29 04:44:20,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:20,538 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 132 transitions. [2021-10-29 04:44:20,538 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-10-29 04:44:20,539 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 132 transitions. [2021-10-29 04:44:20,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-29 04:44:20,540 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:20,540 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:20,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 04:44:20,540 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-10-29 04:44:20,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:20,541 INFO L85 PathProgramCache]: Analyzing trace with hash -931567606, now seen corresponding path program 1 times [2021-10-29 04:44:20,542 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:44:20,542 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434868671] [2021-10-29 04:44:20,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:20,542 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:44:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:20,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:20,603 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:44:20,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434868671] [2021-10-29 04:44:20,604 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434868671] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:20,604 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:20,604 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:44:20,605 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174123038] [2021-10-29 04:44:20,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:44:20,605 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:44:20,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:44:20,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:44:20,607 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-10-29 04:44:20,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:20,779 INFO L93 Difference]: Finished difference Result 110 states and 130 transitions. [2021-10-29 04:44:20,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:44:20,780 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-29 04:44:20,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:20,781 INFO L225 Difference]: With dead ends: 110 [2021-10-29 04:44:20,782 INFO L226 Difference]: Without dead ends: 110 [2021-10-29 04:44:20,782 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:44:20,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-10-29 04:44:20,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2021-10-29 04:44:20,788 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-10-29 04:44:20,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 130 transitions. [2021-10-29 04:44:20,790 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 130 transitions. Word has length 13 [2021-10-29 04:44:20,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:20,790 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 130 transitions. [2021-10-29 04:44:20,791 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:44:20,791 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 130 transitions. [2021-10-29 04:44:20,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-29 04:44:20,792 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:20,792 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:20,792 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 04:44:20,793 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-10-29 04:44:20,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:20,794 INFO L85 PathProgramCache]: Analyzing trace with hash -931567605, now seen corresponding path program 1 times [2021-10-29 04:44:20,794 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:44:20,794 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329195070] [2021-10-29 04:44:20,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:20,795 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:44:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:20,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:20,909 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:44:20,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329195070] [2021-10-29 04:44:20,910 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329195070] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:20,910 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:20,910 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 04:44:20,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996973056] [2021-10-29 04:44:20,911 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 04:44:20,911 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:44:20,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 04:44:20,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 04:44:20,913 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-10-29 04:44:21,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:21,091 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2021-10-29 04:44:21,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 04:44:21,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-10-29 04:44:21,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:21,093 INFO L225 Difference]: With dead ends: 109 [2021-10-29 04:44:21,093 INFO L226 Difference]: Without dead ends: 109 [2021-10-29 04:44:21,094 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 04:44:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-10-29 04:44:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2021-10-29 04:44:21,098 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-10-29 04:44:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 128 transitions. [2021-10-29 04:44:21,099 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 128 transitions. Word has length 13 [2021-10-29 04:44:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:21,099 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 128 transitions. [2021-10-29 04:44:21,099 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 04:44:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2021-10-29 04:44:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-10-29 04:44:21,100 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:21,101 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:21,101 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 04:44:21,101 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-10-29 04:44:21,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:21,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1181636105, now seen corresponding path program 1 times [2021-10-29 04:44:21,102 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:44:21,110 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116987079] [2021-10-29 04:44:21,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:21,110 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:44:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:21,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:21,169 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:44:21,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116987079] [2021-10-29 04:44:21,169 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116987079] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:21,170 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:21,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 04:44:21,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589987826] [2021-10-29 04:44:21,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 04:44:21,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:44:21,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 04:44:21,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:44:21,172 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-10-29 04:44:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:21,347 INFO L93 Difference]: Finished difference Result 123 states and 138 transitions. [2021-10-29 04:44:21,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 04:44:21,348 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-10-29 04:44:21,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:21,349 INFO L225 Difference]: With dead ends: 123 [2021-10-29 04:44:21,349 INFO L226 Difference]: Without dead ends: 123 [2021-10-29 04:44:21,350 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 04:44:21,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2021-10-29 04:44:21,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 109. [2021-10-29 04:44:21,354 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-10-29 04:44:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 126 transitions. [2021-10-29 04:44:21,355 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 126 transitions. Word has length 14 [2021-10-29 04:44:21,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:21,355 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 126 transitions. [2021-10-29 04:44:21,355 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-10-29 04:44:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 126 transitions. [2021-10-29 04:44:21,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 04:44:21,356 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:21,356 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:21,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 04:44:21,357 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-10-29 04:44:21,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:21,357 INFO L85 PathProgramCache]: Analyzing trace with hash -1883114057, now seen corresponding path program 1 times [2021-10-29 04:44:21,358 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:44:21,358 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350167858] [2021-10-29 04:44:21,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:21,359 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:44:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:21,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:21,469 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:44:21,470 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350167858] [2021-10-29 04:44:21,470 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350167858] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:21,470 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:21,470 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-29 04:44:21,471 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647732003] [2021-10-29 04:44:21,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-29 04:44:21,471 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:44:21,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-29 04:44:21,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2021-10-29 04:44:21,473 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-10-29 04:44:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:21,874 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2021-10-29 04:44:21,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 04:44:21,875 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-10-29 04:44:21,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:21,876 INFO L225 Difference]: With dead ends: 110 [2021-10-29 04:44:21,876 INFO L226 Difference]: Without dead ends: 110 [2021-10-29 04:44:21,877 INFO L786 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-10-29 04:44:21,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-10-29 04:44:21,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2021-10-29 04:44:21,880 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-10-29 04:44:21,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 125 transitions. [2021-10-29 04:44:21,881 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 125 transitions. Word has length 15 [2021-10-29 04:44:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:21,881 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 125 transitions. [2021-10-29 04:44:21,882 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-10-29 04:44:21,882 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 125 transitions. [2021-10-29 04:44:21,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 04:44:21,883 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:21,883 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:21,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 04:44:21,883 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-10-29 04:44:21,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:21,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1883114056, now seen corresponding path program 1 times [2021-10-29 04:44:21,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:44:21,884 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126434841] [2021-10-29 04:44:21,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:21,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:44:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 04:44:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 04:44:22,127 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 04:44:22,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126434841] [2021-10-29 04:44:22,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126434841] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 04:44:22,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 04:44:22,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-10-29 04:44:22,129 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453533748] [2021-10-29 04:44:22,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-10-29 04:44:22,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 04:44:22,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-10-29 04:44:22,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-10-29 04:44:22,132 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-10-29 04:44:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 04:44:22,643 INFO L93 Difference]: Finished difference Result 100 states and 115 transitions. [2021-10-29 04:44:22,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-10-29 04:44:22,644 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-10-29 04:44:22,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 04:44:22,645 INFO L225 Difference]: With dead ends: 100 [2021-10-29 04:44:22,645 INFO L226 Difference]: Without dead ends: 100 [2021-10-29 04:44:22,646 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2021-10-29 04:44:22,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2021-10-29 04:44:22,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2021-10-29 04:44:22,648 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-10-29 04:44:22,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2021-10-29 04:44:22,649 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 15 [2021-10-29 04:44:22,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 04:44:22,650 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2021-10-29 04:44:22,650 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-10-29 04:44:22,650 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2021-10-29 04:44:22,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-29 04:44:22,651 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 04:44:22,651 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:22,651 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 04:44:22,651 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-10-29 04:44:22,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 04:44:22,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1584318480, now seen corresponding path program 1 times [2021-10-29 04:44:22,652 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 04:44:22,653 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240462656] [2021-10-29 04:44:22,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 04:44:22,653 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 04:44:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:44:22,669 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 04:44:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 04:44:22,706 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-29 04:44:22,707 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-29 04:44:22,708 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:44:22,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-29 04:44:22,710 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-29 04:44:22,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-29 04:44:22,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-29 04:44:22,711 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-29 04:44:22,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-29 04:44:22,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-29 04:44:22,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-29 04:44:22,712 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-29 04:44:22,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-29 04:44:22,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-29 04:44:22,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-29 04:44:22,713 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-29 04:44:22,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-29 04:44:22,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-29 04:44:22,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-29 04:44:22,714 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-29 04:44:22,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-29 04:44:22,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-29 04:44:22,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-29 04:44:22,715 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-29 04:44:22,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-29 04:44:22,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-29 04:44:22,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-29 04:44:22,716 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-29 04:44:22,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-29 04:44:22,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-29 04:44:22,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-29 04:44:22,717 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-29 04:44:22,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-29 04:44:22,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-29 04:44:22,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-29 04:44:22,718 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-29 04:44:22,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-29 04:44:22,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-29 04:44:22,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-29 04:44:22,719 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-29 04:44:22,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-29 04:44:22,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-29 04:44:22,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-29 04:44:22,720 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-29 04:44:22,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-29 04:44:22,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-29 04:44:22,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-29 04:44:22,721 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-10-29 04:44:22,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-29 04:44:22,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-29 04:44:22,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-29 04:44:22,722 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-29 04:44:22,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-29 04:44:22,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-29 04:44:22,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-29 04:44:22,723 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-29 04:44:22,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-29 04:44:22,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-29 04:44:22,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-10-29 04:44:22,724 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-10-29 04:44:22,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-10-29 04:44:22,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:44:22,725 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:44:22,726 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:44:22,726 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:44:22,726 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:44:22,726 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 04:44:22,727 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 04:44:22,727 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 04:44:22,731 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 04:44:22,736 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 04:44:22,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 04:44:22 BoogieIcfgContainer [2021-10-29 04:44:22,769 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 04:44:22,770 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 04:44:22,770 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 04:44:22,770 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 04:44:22,771 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 04:44:17" (3/4) ... [2021-10-29 04:44:22,773 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 04:44:22,848 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 04:44:22,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 04:44:22,850 INFO L168 Benchmark]: Toolchain (without parser) took 6725.02 ms. Allocated memory was 102.8 MB in the beginning and 125.8 MB in the end (delta: 23.1 MB). Free memory was 80.4 MB in the beginning and 61.9 MB in the end (delta: 18.5 MB). Peak memory consumption was 40.7 MB. Max. memory is 16.1 GB. [2021-10-29 04:44:22,850 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 102.8 MB. Free memory is still 75.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 04:44:22,850 INFO L168 Benchmark]: CACSL2BoogieTranslator took 627.78 ms. Allocated memory is still 102.8 MB. Free memory was 80.2 MB in the beginning and 71.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 04:44:22,851 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.88 ms. Allocated memory is still 102.8 MB. Free memory was 71.3 MB in the beginning and 69.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 04:44:22,851 INFO L168 Benchmark]: Boogie Preprocessor took 72.45 ms. Allocated memory is still 102.8 MB. Free memory was 69.2 MB in the beginning and 67.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 04:44:22,852 INFO L168 Benchmark]: RCFGBuilder took 1108.15 ms. Allocated memory is still 102.8 MB. Free memory was 67.4 MB in the beginning and 40.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-10-29 04:44:22,852 INFO L168 Benchmark]: TraceAbstraction took 4769.73 ms. Allocated memory was 102.8 MB in the beginning and 125.8 MB in the end (delta: 23.1 MB). Free memory was 40.2 MB in the beginning and 64.0 MB in the end (delta: -23.8 MB). Peak memory consumption was 443.8 kB. Max. memory is 16.1 GB. [2021-10-29 04:44:22,853 INFO L168 Benchmark]: Witness Printer took 78.36 ms. Allocated memory is still 125.8 MB. Free memory was 64.0 MB in the beginning and 61.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 04:44:22,858 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.39 ms. Allocated memory is still 102.8 MB. Free memory is still 75.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 627.78 ms. Allocated memory is still 102.8 MB. Free memory was 80.2 MB in the beginning and 71.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 60.88 ms. Allocated memory is still 102.8 MB. Free memory was 71.3 MB in the beginning and 69.2 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 72.45 ms. Allocated memory is still 102.8 MB. Free memory was 69.2 MB in the beginning and 67.4 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1108.15 ms. Allocated memory is still 102.8 MB. Free memory was 67.4 MB in the beginning and 40.6 MB in the end (delta: 26.8 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 4769.73 ms. Allocated memory was 102.8 MB in the beginning and 125.8 MB in the end (delta: 23.1 MB). Free memory was 40.2 MB in the beginning and 64.0 MB in the end (delta: -23.8 MB). Peak memory consumption was 443.8 kB. Max. memory is 16.1 GB. * Witness Printer took 78.36 ms. Allocated memory is still 125.8 MB. Free memory was 64.0 MB in the beginning and 61.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1009]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = ((void*)0) [L999] head->prev = ((void*)0) [L1000] COND FALSE !(__VERIFIER_nondet_int()) [L1000] COND TRUE __VERIFIER_nondet_int() [L1000] head->data = 1 [L1000] head->opt = head [L1001] SLL* x = head; [L1003] COND FALSE !(__VERIFIER_nondet_int()) [L1006] x = head [L1007] COND TRUE x != ((void*)0) [L1009] EXPR x->data [L1009] EXPR x->data == 2 && x->opt == x [L1009] COND TRUE !(x->data == 2 && x->opt == x) [L1009] reach_error() - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 999]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1003]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1009]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1010]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1021]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 994]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 119 locations, 66 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 673 SDtfs, 745 SDslu, 898 SDs, 0 SdLazy, 1767 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s 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.9s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 101 ConstructedInterpolants, 0 QuantifiedInterpolants, 593 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-29 04:44:22,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_66897e80-081f-47b2-b8dc-09bdcd63ea4d/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...