./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 4e77c044 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 54165abed718b8d39f88748583b76365fb540324 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-4e77c04 [2021-10-13 06:44:13,837 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-13 06:44:13,839 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-13 06:44:13,871 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-13 06:44:13,871 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-13 06:44:13,873 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-13 06:44:13,875 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-13 06:44:13,878 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-13 06:44:13,880 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-13 06:44:13,881 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-13 06:44:13,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-13 06:44:13,886 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-13 06:44:13,887 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-13 06:44:13,892 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-13 06:44:13,894 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-13 06:44:13,897 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-13 06:44:13,900 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-13 06:44:13,902 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-13 06:44:13,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-13 06:44:13,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-13 06:44:13,915 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-13 06:44:13,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-13 06:44:13,919 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-13 06:44:13,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-13 06:44:13,932 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-13 06:44:13,932 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-13 06:44:13,933 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-13 06:44:13,935 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-13 06:44:13,936 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-13 06:44:13,938 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-13 06:44:13,939 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-13 06:44:13,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-13 06:44:13,942 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-13 06:44:13,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-13 06:44:13,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-13 06:44:13,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-13 06:44:13,965 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-13 06:44:13,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-13 06:44:13,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-13 06:44:13,967 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-13 06:44:13,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-13 06:44:13,969 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-10-13 06:44:14,028 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-13 06:44:14,031 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-13 06:44:14,032 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-13 06:44:14,033 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-13 06:44:14,033 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-13 06:44:14,033 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-13 06:44:14,034 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-13 06:44:14,034 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-13 06:44:14,034 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-13 06:44:14,034 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-13 06:44:14,036 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-13 06:44:14,036 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-13 06:44:14,036 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-13 06:44:14,037 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-13 06:44:14,037 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-13 06:44:14,038 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-13 06:44:14,038 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-13 06:44:14,038 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-13 06:44:14,039 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-13 06:44:14,039 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-13 06:44:14,039 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-13 06:44:14,039 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-13 06:44:14,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-13 06:44:14,040 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-13 06:44:14,040 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-13 06:44:14,040 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-13 06:44:14,042 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-13 06:44:14,042 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-13 06:44:14,043 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-13 06:44:14,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-13 06:44:14,043 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-13 06:44:14,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:44:14,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-13 06:44:14,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-13 06:44:14,045 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-13 06:44:14,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-13 06:44:14,045 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-13 06:44:14,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-13 06:44:14,046 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_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/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_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 54165abed718b8d39f88748583b76365fb540324 [2021-10-13 06:44:14,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-13 06:44:14,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-13 06:44:14,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-13 06:44:14,342 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-13 06:44:14,343 INFO L275 PluginConnector]: CDTParser initialized [2021-10-13 06:44:14,344 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-10-13 06:44:14,407 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/data/4812cd1aa/6d9bd869c2fa41369873153f187e4ee5/FLAG405af337f [2021-10-13 06:44:14,942 INFO L306 CDTParser]: Found 1 translation units. [2021-10-13 06:44:14,943 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-10-13 06:44:14,965 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/data/4812cd1aa/6d9bd869c2fa41369873153f187e4ee5/FLAG405af337f [2021-10-13 06:44:15,245 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/data/4812cd1aa/6d9bd869c2fa41369873153f187e4ee5 [2021-10-13 06:44:15,249 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-13 06:44:15,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-13 06:44:15,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-13 06:44:15,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-13 06:44:15,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-13 06:44:15,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:44:15" (1/1) ... [2021-10-13 06:44:15,262 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dc78daa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:15, skipping insertion in model container [2021-10-13 06:44:15,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:44:15" (1/1) ... [2021-10-13 06:44:15,270 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-13 06:44:15,337 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-13 06:44:15,676 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_03279ce3-2102-4ca2-bf07-9c61b64c411c/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-10-13 06:44:15,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:44:15,746 INFO L203 MainTranslator]: Completed pre-run [2021-10-13 06:44:15,804 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_03279ce3-2102-4ca2-bf07-9c61b64c411c/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-10-13 06:44:15,828 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-13 06:44:15,874 INFO L208 MainTranslator]: Completed translation [2021-10-13 06:44:15,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:15 WrapperNode [2021-10-13 06:44:15,875 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-13 06:44:15,875 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-13 06:44:15,875 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-13 06:44:15,876 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-13 06:44:15,883 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:15" (1/1) ... [2021-10-13 06:44:15,899 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:15" (1/1) ... [2021-10-13 06:44:15,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-13 06:44:15,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-13 06:44:15,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-13 06:44:15,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-13 06:44:15,964 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:15" (1/1) ... [2021-10-13 06:44:15,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:15" (1/1) ... [2021-10-13 06:44:15,970 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:15" (1/1) ... [2021-10-13 06:44:15,970 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:15" (1/1) ... [2021-10-13 06:44:15,998 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:15" (1/1) ... [2021-10-13 06:44:16,038 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:15" (1/1) ... [2021-10-13 06:44:16,041 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:15" (1/1) ... [2021-10-13 06:44:16,046 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-13 06:44:16,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-13 06:44:16,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-13 06:44:16,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-13 06:44:16,056 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:15" (1/1) ... [2021-10-13 06:44:16,063 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-13 06:44:16,081 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/z3 [2021-10-13 06:44:16,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-13 06:44:16,113 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-13 06:44:16,136 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-13 06:44:16,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-13 06:44:16,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-13 06:44:16,136 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-13 06:44:16,136 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-13 06:44:16,137 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-13 06:44:16,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-13 06:44:16,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-13 06:44:16,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-13 06:44:16,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-13 06:44:17,355 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-13 06:44:17,356 INFO L299 CfgBuilder]: Removed 75 assume(true) statements. [2021-10-13 06:44:17,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:44:17 BoogieIcfgContainer [2021-10-13 06:44:17,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-13 06:44:17,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-13 06:44:17,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-13 06:44:17,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-13 06:44:17,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:44:15" (1/3) ... [2021-10-13 06:44:17,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ec8678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:44:17, skipping insertion in model container [2021-10-13 06:44:17,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:44:15" (2/3) ... [2021-10-13 06:44:17,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ec8678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:44:17, skipping insertion in model container [2021-10-13 06:44:17,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:44:17" (3/3) ... [2021-10-13 06:44:17,370 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2021-10-13 06:44:17,382 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-13 06:44:17,383 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 131 error locations. [2021-10-13 06:44:17,440 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-13 06:44:17,450 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-13 06:44:17,450 INFO L340 AbstractCegarLoop]: Starting to check reachability of 131 error locations. [2021-10-13 06:44:17,479 INFO L276 IsEmpty]: Start isEmpty. Operand has 255 states, 123 states have (on average 2.5284552845528454) internal successors, (311), 254 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:17,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-13 06:44:17,485 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:17,485 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-13 06:44:17,486 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:17,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:17,493 INFO L82 PathProgramCache]: Analyzing trace with hash 19122463, now seen corresponding path program 1 times [2021-10-13 06:44:17,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:17,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516343063] [2021-10-13 06:44:17,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:17,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:17,668 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-13 06:44:17,669 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:17,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516343063] [2021-10-13 06:44:17,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516343063] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:17,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:17,671 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 06:44:17,672 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614956423] [2021-10-13 06:44:17,677 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:17,677 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:17,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:17,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:17,694 INFO L87 Difference]: Start difference. First operand has 255 states, 123 states have (on average 2.5284552845528454) internal successors, (311), 254 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:18,095 INFO L93 Difference]: Finished difference Result 473 states and 496 transitions. [2021-10-13 06:44:18,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:18,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-10-13 06:44:18,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:18,122 INFO L225 Difference]: With dead ends: 473 [2021-10-13 06:44:18,122 INFO L226 Difference]: Without dead ends: 471 [2021-10-13 06:44:18,124 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:18,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-10-13 06:44:18,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 252. [2021-10-13 06:44:18,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 123 states have (on average 2.1463414634146343) internal successors, (264), 251 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:18,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2021-10-13 06:44:18,188 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 4 [2021-10-13 06:44:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:18,188 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2021-10-13 06:44:18,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2021-10-13 06:44:18,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-10-13 06:44:18,189 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:18,189 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-10-13 06:44:18,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-13 06:44:18,190 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:18,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:18,190 INFO L82 PathProgramCache]: Analyzing trace with hash 19122464, now seen corresponding path program 1 times [2021-10-13 06:44:18,191 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:18,191 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947404280] [2021-10-13 06:44:18,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:18,191 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:18,250 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-13 06:44:18,251 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:18,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947404280] [2021-10-13 06:44:18,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947404280] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:18,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:18,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 06:44:18,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508770475] [2021-10-13 06:44:18,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:18,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:18,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:18,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:18,254 INFO L87 Difference]: Start difference. First operand 252 states and 264 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:18,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:18,506 INFO L93 Difference]: Finished difference Result 397 states and 416 transitions. [2021-10-13 06:44:18,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:18,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-10-13 06:44:18,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:18,509 INFO L225 Difference]: With dead ends: 397 [2021-10-13 06:44:18,509 INFO L226 Difference]: Without dead ends: 397 [2021-10-13 06:44:18,510 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:18,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-10-13 06:44:18,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 250. [2021-10-13 06:44:18,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 123 states have (on average 2.130081300813008) internal successors, (262), 249 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:18,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 262 transitions. [2021-10-13 06:44:18,526 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 262 transitions. Word has length 4 [2021-10-13 06:44:18,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:18,526 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 262 transitions. [2021-10-13 06:44:18,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:18,527 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 262 transitions. [2021-10-13 06:44:18,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-10-13 06:44:18,528 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:18,528 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-10-13 06:44:18,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-13 06:44:18,531 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:18,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:18,532 INFO L82 PathProgramCache]: Analyzing trace with hash 592197104, now seen corresponding path program 1 times [2021-10-13 06:44:18,532 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:18,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964199837] [2021-10-13 06:44:18,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:18,533 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:18,589 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-13 06:44:18,590 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:18,590 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964199837] [2021-10-13 06:44:18,590 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964199837] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:18,590 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:18,591 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-13 06:44:18,591 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612689637] [2021-10-13 06:44:18,591 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:18,592 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:18,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:18,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:18,593 INFO L87 Difference]: Start difference. First operand 250 states and 262 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:18,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:18,804 INFO L93 Difference]: Finished difference Result 386 states and 404 transitions. [2021-10-13 06:44:18,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:18,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-10-13 06:44:18,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:18,808 INFO L225 Difference]: With dead ends: 386 [2021-10-13 06:44:18,808 INFO L226 Difference]: Without dead ends: 385 [2021-10-13 06:44:18,808 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:18,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-10-13 06:44:18,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 253. [2021-10-13 06:44:18,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 126 states have (on average 2.111111111111111) internal successors, (266), 252 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 266 transitions. [2021-10-13 06:44:18,831 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 266 transitions. Word has length 5 [2021-10-13 06:44:18,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:18,833 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 266 transitions. [2021-10-13 06:44:18,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:18,833 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 266 transitions. [2021-10-13 06:44:18,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 06:44:18,834 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:18,834 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 06:44:18,834 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-13 06:44:18,834 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:18,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:18,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1178226029, now seen corresponding path program 1 times [2021-10-13 06:44:18,836 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:18,836 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118450060] [2021-10-13 06:44:18,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:18,836 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:18,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:18,889 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-13 06:44:18,889 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:18,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118450060] [2021-10-13 06:44:18,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118450060] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:18,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:18,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 06:44:18,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099614924] [2021-10-13 06:44:18,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:18,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:18,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:18,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:18,892 INFO L87 Difference]: Start difference. First operand 253 states and 266 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:18,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:18,916 INFO L93 Difference]: Finished difference Result 263 states and 274 transitions. [2021-10-13 06:44:18,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:18,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-13 06:44:18,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:18,918 INFO L225 Difference]: With dead ends: 263 [2021-10-13 06:44:18,918 INFO L226 Difference]: Without dead ends: 262 [2021-10-13 06:44:18,918 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:18,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-10-13 06:44:18,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 252. [2021-10-13 06:44:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 125 states have (on average 2.112) internal successors, (264), 251 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2021-10-13 06:44:18,925 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 6 [2021-10-13 06:44:18,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:18,925 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2021-10-13 06:44:18,926 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:18,926 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2021-10-13 06:44:18,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 06:44:18,926 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:18,926 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 06:44:18,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-13 06:44:18,927 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:18,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:18,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1197398764, now seen corresponding path program 1 times [2021-10-13 06:44:18,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:18,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987572320] [2021-10-13 06:44:18,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:18,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:18,961 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-13 06:44:18,962 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:18,962 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987572320] [2021-10-13 06:44:18,962 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987572320] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:18,962 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:18,962 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 06:44:18,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285998104] [2021-10-13 06:44:18,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:18,963 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:18,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:18,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:18,964 INFO L87 Difference]: Start difference. First operand 252 states and 264 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:19,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:19,219 INFO L93 Difference]: Finished difference Result 401 states and 421 transitions. [2021-10-13 06:44:19,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:19,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-13 06:44:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:19,222 INFO L225 Difference]: With dead ends: 401 [2021-10-13 06:44:19,222 INFO L226 Difference]: Without dead ends: 401 [2021-10-13 06:44:19,222 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-10-13 06:44:19,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 250. [2021-10-13 06:44:19,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 125 states have (on average 2.096) internal successors, (262), 249 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 262 transitions. [2021-10-13 06:44:19,230 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 262 transitions. Word has length 6 [2021-10-13 06:44:19,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:19,231 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 262 transitions. [2021-10-13 06:44:19,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 262 transitions. [2021-10-13 06:44:19,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-13 06:44:19,232 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:19,232 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-13 06:44:19,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-13 06:44:19,232 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:19,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:19,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1197398765, now seen corresponding path program 1 times [2021-10-13 06:44:19,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:19,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498554231] [2021-10-13 06:44:19,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:19,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:19,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:19,273 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-13 06:44:19,274 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:19,274 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498554231] [2021-10-13 06:44:19,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498554231] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:19,275 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:19,275 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-13 06:44:19,275 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822028411] [2021-10-13 06:44:19,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-13 06:44:19,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:19,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-13 06:44:19,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:19,276 INFO L87 Difference]: Start difference. First operand 250 states and 262 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:19,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:19,456 INFO L93 Difference]: Finished difference Result 327 states and 343 transitions. [2021-10-13 06:44:19,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-13 06:44:19,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-10-13 06:44:19,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:19,459 INFO L225 Difference]: With dead ends: 327 [2021-10-13 06:44:19,459 INFO L226 Difference]: Without dead ends: 327 [2021-10-13 06:44:19,460 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-13 06:44:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-10-13 06:44:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 248. [2021-10-13 06:44:19,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 125 states have (on average 2.08) internal successors, (260), 247 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:19,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 260 transitions. [2021-10-13 06:44:19,468 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 260 transitions. Word has length 6 [2021-10-13 06:44:19,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:19,468 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 260 transitions. [2021-10-13 06:44:19,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:19,469 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 260 transitions. [2021-10-13 06:44:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-13 06:44:19,469 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:19,470 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:19,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-13 06:44:19,470 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:19,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1465193814, now seen corresponding path program 1 times [2021-10-13 06:44:19,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:19,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762812574] [2021-10-13 06:44:19,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:19,472 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:19,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:19,518 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:19,519 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:19,519 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762812574] [2021-10-13 06:44:19,519 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762812574] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:19,520 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:19,520 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:44:19,520 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44272052] [2021-10-13 06:44:19,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-13 06:44:19,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:19,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-13 06:44:19,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-13 06:44:19,522 INFO L87 Difference]: Start difference. First operand 248 states and 260 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:19,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:19,578 INFO L93 Difference]: Finished difference Result 422 states and 443 transitions. [2021-10-13 06:44:19,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-13 06:44:19,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-10-13 06:44:19,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:19,582 INFO L225 Difference]: With dead ends: 422 [2021-10-13 06:44:19,582 INFO L226 Difference]: Without dead ends: 422 [2021-10-13 06:44:19,583 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:19,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-10-13 06:44:19,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 248. [2021-10-13 06:44:19,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 125 states have (on average 2.072) internal successors, (259), 247 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:19,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 259 transitions. [2021-10-13 06:44:19,591 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 259 transitions. Word has length 11 [2021-10-13 06:44:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:19,592 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 259 transitions. [2021-10-13 06:44:19,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:19,593 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 259 transitions. [2021-10-13 06:44:19,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-13 06:44:19,594 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:19,594 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:19,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-13 06:44:19,595 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:19,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:19,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1823647033, now seen corresponding path program 1 times [2021-10-13 06:44:19,596 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:19,596 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832579837] [2021-10-13 06:44:19,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:19,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:19,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:19,683 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:19,683 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832579837] [2021-10-13 06:44:19,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832579837] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:19,684 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:19,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:19,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263057229] [2021-10-13 06:44:19,685 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:19,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:19,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:19,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:19,686 INFO L87 Difference]: Start difference. First operand 248 states and 259 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:19,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:19,830 INFO L93 Difference]: Finished difference Result 820 states and 861 transitions. [2021-10-13 06:44:19,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 06:44:19,830 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-10-13 06:44:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:19,835 INFO L225 Difference]: With dead ends: 820 [2021-10-13 06:44:19,835 INFO L226 Difference]: Without dead ends: 820 [2021-10-13 06:44:19,836 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.3ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 06:44:19,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-10-13 06:44:19,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 250. [2021-10-13 06:44:19,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 128 states have (on average 2.0625) internal successors, (264), 249 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:19,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 264 transitions. [2021-10-13 06:44:19,845 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 264 transitions. Word has length 12 [2021-10-13 06:44:19,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:19,845 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 264 transitions. [2021-10-13 06:44:19,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:19,846 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 264 transitions. [2021-10-13 06:44:19,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 06:44:19,846 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:19,847 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:19,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-13 06:44:19,847 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:19,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:19,848 INFO L82 PathProgramCache]: Analyzing trace with hash -698477090, now seen corresponding path program 1 times [2021-10-13 06:44:19,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:19,848 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489200931] [2021-10-13 06:44:19,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:19,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:19,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:19,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:19,889 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:19,889 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489200931] [2021-10-13 06:44:19,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489200931] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:19,890 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:19,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:44:19,890 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842001315] [2021-10-13 06:44:19,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:19,891 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:19,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:19,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:19,892 INFO L87 Difference]: Start difference. First operand 250 states and 264 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:20,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:20,377 INFO L93 Difference]: Finished difference Result 490 states and 518 transitions. [2021-10-13 06:44:20,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-13 06:44:20,378 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-13 06:44:20,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:20,381 INFO L225 Difference]: With dead ends: 490 [2021-10-13 06:44:20,381 INFO L226 Difference]: Without dead ends: 490 [2021-10-13 06:44:20,381 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 29.7ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 06:44:20,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-10-13 06:44:20,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 242. [2021-10-13 06:44:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 129 states have (on average 1.9844961240310077) internal successors, (256), 241 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 256 transitions. [2021-10-13 06:44:20,389 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 256 transitions. Word has length 13 [2021-10-13 06:44:20,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:20,389 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 256 transitions. [2021-10-13 06:44:20,389 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-13 06:44:20,390 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 256 transitions. [2021-10-13 06:44:20,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-13 06:44:20,390 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:20,390 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:20,390 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-13 06:44:20,391 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:20,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:20,391 INFO L82 PathProgramCache]: Analyzing trace with hash -698477089, now seen corresponding path program 1 times [2021-10-13 06:44:20,391 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:20,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500475397] [2021-10-13 06:44:20,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:20,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:20,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:20,449 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:20,449 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500475397] [2021-10-13 06:44:20,450 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500475397] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:20,450 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:20,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-13 06:44:20,450 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661941878] [2021-10-13 06:44:20,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:20,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:20,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:20,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:20,451 INFO L87 Difference]: Start difference. First operand 242 states and 256 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:20,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:20,859 INFO L93 Difference]: Finished difference Result 576 states and 604 transitions. [2021-10-13 06:44:20,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-13 06:44:20,860 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-13 06:44:20,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:20,864 INFO L225 Difference]: With dead ends: 576 [2021-10-13 06:44:20,865 INFO L226 Difference]: Without dead ends: 576 [2021-10-13 06:44:20,865 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 42.4ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-10-13 06:44:20,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-10-13 06:44:20,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 282. [2021-10-13 06:44:20,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 169 states have (on average 1.8875739644970415) internal successors, (319), 281 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:20,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 319 transitions. [2021-10-13 06:44:20,877 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 319 transitions. Word has length 13 [2021-10-13 06:44:20,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:20,877 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 319 transitions. [2021-10-13 06:44:20,877 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-13 06:44:20,877 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 319 transitions. [2021-10-13 06:44:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 06:44:20,878 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:20,878 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:20,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-13 06:44:20,879 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:20,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:20,879 INFO L82 PathProgramCache]: Analyzing trace with hash 804274739, now seen corresponding path program 1 times [2021-10-13 06:44:20,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:20,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919163269] [2021-10-13 06:44:20,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:20,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 06:44:20,936 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:20,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919163269] [2021-10-13 06:44:20,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919163269] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:20,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:20,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:20,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989239158] [2021-10-13 06:44:20,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:20,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:20,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:20,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:20,938 INFO L87 Difference]: Start difference. First operand 282 states and 319 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:21,115 INFO L93 Difference]: Finished difference Result 358 states and 398 transitions. [2021-10-13 06:44:21,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:44:21,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 06:44:21,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:21,117 INFO L225 Difference]: With dead ends: 358 [2021-10-13 06:44:21,118 INFO L226 Difference]: Without dead ends: 358 [2021-10-13 06:44:21,118 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.5ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:44:21,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-10-13 06:44:21,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 280. [2021-10-13 06:44:21,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 168 states have (on average 1.880952380952381) internal successors, (316), 279 states have internal predecessors, (316), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 316 transitions. [2021-10-13 06:44:21,125 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 316 transitions. Word has length 19 [2021-10-13 06:44:21,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:21,125 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 316 transitions. [2021-10-13 06:44:21,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,126 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 316 transitions. [2021-10-13 06:44:21,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-13 06:44:21,126 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:21,127 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:21,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-13 06:44:21,127 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:21,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:21,127 INFO L82 PathProgramCache]: Analyzing trace with hash 770874066, now seen corresponding path program 1 times [2021-10-13 06:44:21,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:21,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124123464] [2021-10-13 06:44:21,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:21,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:21,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-13 06:44:21,193 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:21,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124123464] [2021-10-13 06:44:21,194 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124123464] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:21,195 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:21,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-13 06:44:21,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127701074] [2021-10-13 06:44:21,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-13 06:44:21,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:21,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-13 06:44:21,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-13 06:44:21,198 INFO L87 Difference]: Start difference. First operand 280 states and 316 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:21,343 INFO L93 Difference]: Finished difference Result 278 states and 313 transitions. [2021-10-13 06:44:21,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-13 06:44:21,343 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-13 06:44:21,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:21,345 INFO L225 Difference]: With dead ends: 278 [2021-10-13 06:44:21,345 INFO L226 Difference]: Without dead ends: 278 [2021-10-13 06:44:21,345 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 30.1ms TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-13 06:44:21,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-10-13 06:44:21,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2021-10-13 06:44:21,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 167 states have (on average 1.874251497005988) internal successors, (313), 277 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 313 transitions. [2021-10-13 06:44:21,352 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 313 transitions. Word has length 19 [2021-10-13 06:44:21,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:21,352 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 313 transitions. [2021-10-13 06:44:21,352 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 313 transitions. [2021-10-13 06:44:21,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 06:44:21,368 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:21,368 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:21,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-13 06:44:21,369 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:21,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:21,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1467799738, now seen corresponding path program 1 times [2021-10-13 06:44:21,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:21,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66201092] [2021-10-13 06:44:21,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:21,370 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:21,432 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:21,432 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:21,432 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66201092] [2021-10-13 06:44:21,432 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66201092] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:21,433 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:21,433 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 06:44:21,433 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144101243] [2021-10-13 06:44:21,433 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 06:44:21,433 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:21,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 06:44:21,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:44:21,434 INFO L87 Difference]: Start difference. First operand 278 states and 313 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:21,776 INFO L93 Difference]: Finished difference Result 576 states and 604 transitions. [2021-10-13 06:44:21,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 06:44:21,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 06:44:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:21,780 INFO L225 Difference]: With dead ends: 576 [2021-10-13 06:44:21,780 INFO L226 Difference]: Without dead ends: 576 [2021-10-13 06:44:21,780 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 68.7ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-10-13 06:44:21,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-10-13 06:44:21,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 278. [2021-10-13 06:44:21,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 167 states have (on average 1.8682634730538923) internal successors, (312), 277 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 312 transitions. [2021-10-13 06:44:21,790 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 312 transitions. Word has length 22 [2021-10-13 06:44:21,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:21,792 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 312 transitions. [2021-10-13 06:44:21,792 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 312 transitions. [2021-10-13 06:44:21,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-13 06:44:21,794 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:21,794 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:21,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-13 06:44:21,795 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:21,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:21,795 INFO L82 PathProgramCache]: Analyzing trace with hash -74930744, now seen corresponding path program 1 times [2021-10-13 06:44:21,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:21,796 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664161767] [2021-10-13 06:44:21,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:21,796 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:21,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:21,875 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:21,875 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:21,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664161767] [2021-10-13 06:44:21,876 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664161767] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:21,876 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:21,876 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 06:44:21,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622787337] [2021-10-13 06:44:21,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 06:44:21,877 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:21,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 06:44:21,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:44:21,877 INFO L87 Difference]: Start difference. First operand 278 states and 312 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:22,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:22,216 INFO L93 Difference]: Finished difference Result 574 states and 602 transitions. [2021-10-13 06:44:22,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 06:44:22,217 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-13 06:44:22,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:22,220 INFO L225 Difference]: With dead ends: 574 [2021-10-13 06:44:22,221 INFO L226 Difference]: Without dead ends: 574 [2021-10-13 06:44:22,221 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 56.3ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-10-13 06:44:22,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-10-13 06:44:22,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 278. [2021-10-13 06:44:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 167 states have (on average 1.8622754491017963) internal successors, (311), 277 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:22,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 311 transitions. [2021-10-13 06:44:22,230 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 311 transitions. Word has length 22 [2021-10-13 06:44:22,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:22,231 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 311 transitions. [2021-10-13 06:44:22,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:22,231 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 311 transitions. [2021-10-13 06:44:22,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 06:44:22,233 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:22,233 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:22,233 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-13 06:44:22,234 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:22,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:22,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1806081044, now seen corresponding path program 1 times [2021-10-13 06:44:22,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:22,236 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004688836] [2021-10-13 06:44:22,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:22,237 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:22,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:22,338 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:22,338 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004688836] [2021-10-13 06:44:22,338 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004688836] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:22,338 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:22,339 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 06:44:22,339 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446872274] [2021-10-13 06:44:22,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 06:44:22,339 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:22,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 06:44:22,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-13 06:44:22,340 INFO L87 Difference]: Start difference. First operand 278 states and 311 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:23,021 INFO L93 Difference]: Finished difference Result 670 states and 707 transitions. [2021-10-13 06:44:23,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 06:44:23,022 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 06:44:23,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:23,026 INFO L225 Difference]: With dead ends: 670 [2021-10-13 06:44:23,026 INFO L226 Difference]: Without dead ends: 670 [2021-10-13 06:44:23,026 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 84.7ms TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-10-13 06:44:23,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-10-13 06:44:23,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 279. [2021-10-13 06:44:23,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 168 states have (on average 1.8630952380952381) internal successors, (313), 278 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 313 transitions. [2021-10-13 06:44:23,036 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 313 transitions. Word has length 24 [2021-10-13 06:44:23,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:23,036 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 313 transitions. [2021-10-13 06:44:23,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,036 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 313 transitions. [2021-10-13 06:44:23,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 06:44:23,037 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:23,037 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:23,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-13 06:44:23,038 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:23,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:23,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1806081043, now seen corresponding path program 1 times [2021-10-13 06:44:23,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:23,039 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954301853] [2021-10-13 06:44:23,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:23,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:23,167 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:23,167 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954301853] [2021-10-13 06:44:23,167 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954301853] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:23,167 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:23,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 06:44:23,168 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38801054] [2021-10-13 06:44:23,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 06:44:23,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:23,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 06:44:23,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:44:23,169 INFO L87 Difference]: Start difference. First operand 279 states and 313 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:23,807 INFO L93 Difference]: Finished difference Result 635 states and 667 transitions. [2021-10-13 06:44:23,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 06:44:23,808 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 06:44:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:23,811 INFO L225 Difference]: With dead ends: 635 [2021-10-13 06:44:23,811 INFO L226 Difference]: Without dead ends: 635 [2021-10-13 06:44:23,812 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 118.9ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-10-13 06:44:23,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-10-13 06:44:23,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 279. [2021-10-13 06:44:23,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 278 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 312 transitions. [2021-10-13 06:44:23,823 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 312 transitions. Word has length 24 [2021-10-13 06:44:23,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:23,823 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 312 transitions. [2021-10-13 06:44:23,823 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:23,824 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 312 transitions. [2021-10-13 06:44:23,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 06:44:23,826 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:23,826 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:23,826 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-13 06:44:23,826 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:23,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:23,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1006190094, now seen corresponding path program 1 times [2021-10-13 06:44:23,827 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:23,827 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923030829] [2021-10-13 06:44:23,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:23,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:23,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:23,915 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:23,915 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:23,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923030829] [2021-10-13 06:44:23,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923030829] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:23,916 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:23,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-13 06:44:23,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797493459] [2021-10-13 06:44:23,917 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-13 06:44:23,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:23,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-13 06:44:23,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-13 06:44:23,918 INFO L87 Difference]: Start difference. First operand 279 states and 312 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:24,555 INFO L93 Difference]: Finished difference Result 668 states and 705 transitions. [2021-10-13 06:44:24,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-13 06:44:24,556 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 06:44:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:24,559 INFO L225 Difference]: With dead ends: 668 [2021-10-13 06:44:24,559 INFO L226 Difference]: Without dead ends: 668 [2021-10-13 06:44:24,560 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 82.8ms TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-10-13 06:44:24,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-10-13 06:44:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 279. [2021-10-13 06:44:24,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 168 states have (on average 1.8511904761904763) internal successors, (311), 278 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 311 transitions. [2021-10-13 06:44:24,571 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 311 transitions. Word has length 24 [2021-10-13 06:44:24,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:24,572 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 311 transitions. [2021-10-13 06:44:24,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:24,572 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 311 transitions. [2021-10-13 06:44:24,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-13 06:44:24,575 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:24,576 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:24,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-13 06:44:24,576 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:24,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:24,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1006190095, now seen corresponding path program 1 times [2021-10-13 06:44:24,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:24,577 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972556499] [2021-10-13 06:44:24,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:24,577 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-13 06:44:24,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-13 06:44:24,709 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-13 06:44:24,709 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972556499] [2021-10-13 06:44:24,710 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972556499] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-13 06:44:24,710 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-13 06:44:24,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-13 06:44:24,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428796443] [2021-10-13 06:44:24,713 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-13 06:44:24,713 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-13 06:44:24,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-13 06:44:24,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-13 06:44:24,714 INFO L87 Difference]: Start difference. First operand 279 states and 311 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:25,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-13 06:44:25,339 INFO L93 Difference]: Finished difference Result 633 states and 665 transitions. [2021-10-13 06:44:25,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-13 06:44:25,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-10-13 06:44:25,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-13 06:44:25,343 INFO L225 Difference]: With dead ends: 633 [2021-10-13 06:44:25,344 INFO L226 Difference]: Without dead ends: 633 [2021-10-13 06:44:25,344 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 113.5ms TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-10-13 06:44:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2021-10-13 06:44:25,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 279. [2021-10-13 06:44:25,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 168 states have (on average 1.8452380952380953) internal successors, (310), 278 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:25,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 310 transitions. [2021-10-13 06:44:25,352 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 310 transitions. Word has length 24 [2021-10-13 06:44:25,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-13 06:44:25,353 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 310 transitions. [2021-10-13 06:44:25,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-13 06:44:25,353 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 310 transitions. [2021-10-13 06:44:25,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-13 06:44:25,354 INFO L504 BasicCegarLoop]: Found error trace [2021-10-13 06:44:25,354 INFO L512 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-13 06:44:25,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-13 06:44:25,354 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-10-13 06:44:25,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-13 06:44:25,355 INFO L82 PathProgramCache]: Analyzing trace with hash -477088755, now seen corresponding path program 1 times [2021-10-13 06:44:25,355 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-13 06:44:25,355 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755552839] [2021-10-13 06:44:25,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-13 06:44:25,356 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-13 06:44:25,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 06:44:25,376 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-13 06:44:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-13 06:44:25,414 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-13 06:44:25,415 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-13 06:44:25,416 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 06:44:25,417 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-13 06:44:25,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-13 06:44:25,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-13 06:44:25,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-13 06:44:25,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-13 06:44:25,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-13 06:44:25,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-13 06:44:25,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-13 06:44:25,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 06:44:25,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-13 06:44:25,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-10-13 06:44:25,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 06:44:25,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-13 06:44:25,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-13 06:44:25,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 06:44:25,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-13 06:44:25,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-13 06:44:25,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 06:44:25,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-13 06:44:25,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-10-13 06:44:25,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-13 06:44:25,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-13 06:44:25,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 06:44:25,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-13 06:44:25,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-10-13 06:44:25,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 06:44:25,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-13 06:44:25,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-13 06:44:25,423 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 06:44:25,423 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-10-13 06:44:25,423 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-13 06:44:25,423 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 06:44:25,423 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-13 06:44:25,424 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-13 06:44:25,424 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-10-13 06:44:25,424 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-13 06:44:25,424 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-13 06:44:25,424 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-13 06:44:25,424 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-10-13 06:44:25,425 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-10-13 06:44:25,425 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-10-13 06:44:25,425 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-13 06:44:25,425 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-13 06:44:25,425 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-10-13 06:44:25,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-13 06:44:25,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-13 06:44:25,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-10-13 06:44:25,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-10-13 06:44:25,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-10-13 06:44:25,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-10-13 06:44:25,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-10-13 06:44:25,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-10-13 06:44:25,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-10-13 06:44:25,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-10-13 06:44:25,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-10-13 06:44:25,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-10-13 06:44:25,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-10-13 06:44:25,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-10-13 06:44:25,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-10-13 06:44:25,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-10-13 06:44:25,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-10-13 06:44:25,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-10-13 06:44:25,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-10-13 06:44:25,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-10-13 06:44:25,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-10-13 06:44:25,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-10-13 06:44:25,429 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION [2021-10-13 06:44:25,430 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-10-13 06:44:25,430 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION [2021-10-13 06:44:25,430 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION [2021-10-13 06:44:25,430 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-10-13 06:44:25,430 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-10-13 06:44:25,431 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION [2021-10-13 06:44:25,431 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-10-13 06:44:25,431 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-10-13 06:44:25,431 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-10-13 06:44:25,431 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION [2021-10-13 06:44:25,431 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-10-13 06:44:25,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-10-13 06:44:25,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATION [2021-10-13 06:44:25,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATION [2021-10-13 06:44:25,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATION [2021-10-13 06:44:25,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-10-13 06:44:25,432 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATION [2021-10-13 06:44:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-10-13 06:44:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-10-13 06:44:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATION [2021-10-13 06:44:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-10-13 06:44:25,433 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATION [2021-10-13 06:44:25,434 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-10-13 06:44:25,434 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-10-13 06:44:25,434 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATION [2021-10-13 06:44:25,434 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-10-13 06:44:25,434 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATION [2021-10-13 06:44:25,434 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95REQUIRES_VIOLATION [2021-10-13 06:44:25,435 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-10-13 06:44:25,435 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATION [2021-10-13 06:44:25,435 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98REQUIRES_VIOLATION [2021-10-13 06:44:25,435 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99REQUIRES_VIOLATION [2021-10-13 06:44:25,435 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100REQUIRES_VIOLATION [2021-10-13 06:44:25,436 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:44:25,436 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:44:25,436 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:44:25,436 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 06:44:25,436 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105REQUIRES_VIOLATION [2021-10-13 06:44:25,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-10-13 06:44:25,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 06:44:25,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108REQUIRES_VIOLATION [2021-10-13 06:44:25,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-10-13 06:44:25,437 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 06:44:25,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111REQUIRES_VIOLATION [2021-10-13 06:44:25,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-10-13 06:44:25,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-10-13 06:44:25,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114REQUIRES_VIOLATION [2021-10-13 06:44:25,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115REQUIRES_VIOLATION [2021-10-13 06:44:25,438 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-10-13 06:44:25,439 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117REQUIRES_VIOLATION [2021-10-13 06:44:25,439 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118REQUIRES_VIOLATION [2021-10-13 06:44:25,439 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 06:44:25,439 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120REQUIRES_VIOLATION [2021-10-13 06:44:25,439 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-10-13 06:44:25,440 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:44:25,440 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:44:25,440 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:44:25,440 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125REQUIRES_VIOLATION [2021-10-13 06:44:25,440 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126REQUIRES_VIOLATION [2021-10-13 06:44:25,440 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:44:25,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:44:25,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONMEMORY_FREE [2021-10-13 06:44:25,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONMEMORY_LEAK [2021-10-13 06:44:25,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-13 06:44:25,448 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-13 06:44:25,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 06:44:25 BoogieIcfgContainer [2021-10-13 06:44:25,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-13 06:44:25,484 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-13 06:44:25,484 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-13 06:44:25,484 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-13 06:44:25,485 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:44:17" (3/4) ... [2021-10-13 06:44:25,487 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-13 06:44:25,541 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/witness.graphml [2021-10-13 06:44:25,541 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-13 06:44:25,543 INFO L168 Benchmark]: Toolchain (without parser) took 10290.46 ms. Allocated memory was 98.6 MB in the beginning and 172.0 MB in the end (delta: 73.4 MB). Free memory was 69.0 MB in the beginning and 123.1 MB in the end (delta: -54.1 MB). Peak memory consumption was 20.6 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:25,543 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 98.6 MB. Free memory is still 67.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-13 06:44:25,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 619.40 ms. Allocated memory is still 98.6 MB. Free memory was 68.8 MB in the beginning and 51.2 MB in the end (delta: 17.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:25,544 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.09 ms. Allocated memory is still 98.6 MB. Free memory was 51.2 MB in the beginning and 48.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:25,545 INFO L168 Benchmark]: Boogie Preprocessor took 105.95 ms. Allocated memory was 98.6 MB in the beginning and 132.1 MB in the end (delta: 33.6 MB). Free memory was 48.4 MB in the beginning and 107.1 MB in the end (delta: -58.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:25,545 INFO L168 Benchmark]: RCFGBuilder took 1313.04 ms. Allocated memory is still 132.1 MB. Free memory was 107.1 MB in the beginning and 99.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 43.1 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:25,546 INFO L168 Benchmark]: TraceAbstraction took 8121.76 ms. Allocated memory was 132.1 MB in the beginning and 172.0 MB in the end (delta: 39.8 MB). Free memory was 99.1 MB in the beginning and 126.3 MB in the end (delta: -27.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:25,546 INFO L168 Benchmark]: Witness Printer took 57.50 ms. Allocated memory is still 172.0 MB. Free memory was 125.2 MB in the beginning and 123.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-13 06:44:25,548 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 98.6 MB. Free memory is still 67.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 619.40 ms. Allocated memory is still 98.6 MB. Free memory was 68.8 MB in the beginning and 51.2 MB in the end (delta: 17.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 64.09 ms. Allocated memory is still 98.6 MB. Free memory was 51.2 MB in the beginning and 48.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 105.95 ms. Allocated memory was 98.6 MB in the beginning and 132.1 MB in the end (delta: 33.6 MB). Free memory was 48.4 MB in the beginning and 107.1 MB in the end (delta: -58.7 MB). Peak memory consumption was 9.4 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1313.04 ms. Allocated memory is still 132.1 MB. Free memory was 107.1 MB in the beginning and 99.1 MB in the end (delta: 8.0 MB). Peak memory consumption was 43.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8121.76 ms. Allocated memory was 132.1 MB in the beginning and 172.0 MB in the end (delta: 39.8 MB). Free memory was 99.1 MB in the beginning and 126.3 MB in the end (delta: -27.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 16.1 GB. * Witness Printer took 57.50 ms. Allocated memory is still 172.0 MB. Free memory was 125.2 MB in the beginning and 123.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L638] struct list *data = ((void *)0); [L639] COND TRUE __VERIFIER_nondet_int() [L640] struct node *node = malloc(sizeof *node); [L641] COND FALSE !(!node) [L643] node->next = node [L644] node->value = __VERIFIER_nondet_int() [L645] struct list *item = malloc(sizeof *item); [L646] COND FALSE !(!item) [L648] item->slist = node [L649] item->next = data [L650] data = item [L639] COND FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) [L615] COND FALSE !(!(shape)) [L616] shape->next [L616] COND FALSE !(shape->next) [L622] COND FALSE !(!(shape)) [L623] EXPR shape->next [L623] COND FALSE !(!(shape->next == ((void *)0))) [L624] EXPR shape->slist [L624] COND FALSE !(!(shape->slist)) [L625] EXPR shape->slist [L625] EXPR shape->slist->next [L625] COND TRUE !(shape->slist->next == ((void *)0)) [L565] reach_error() - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 255 locations, 131 error locations. Started 1 CEGAR loops. OverallTime: 8007.3ms, OverallIterations: 19, TraceHistogramMax: 2, EmptinessCheckTime: 44.1ms, AutomataDifference: 6132.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 23.2ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3876 SDtfs, 12370 SDslu, 6932 SDs, 0 SdLazy, 5417 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4098.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 707.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=10, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 217.2ms AutomataMinimizationTime, 18 MinimizatonAttempts, 4186 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 56.9ms SsaConstructionTime, 225.9ms SatisfiabilityAnalysisTime, 937.2ms InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 1759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 24/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-13 06:44:25,609 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_03279ce3-2102-4ca2-bf07-9c61b64c411c/bin/utaipan-q2qaUkNPG8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...