./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8 --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 f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 01:13:22,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 01:13:22,561 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 01:13:22,602 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 01:13:22,603 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 01:13:22,604 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 01:13:22,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 01:13:22,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 01:13:22,613 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 01:13:22,614 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 01:13:22,616 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 01:13:22,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 01:13:22,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 01:13:22,621 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 01:13:22,623 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 01:13:22,625 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 01:13:22,627 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 01:13:22,628 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 01:13:22,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 01:13:22,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 01:13:22,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 01:13:22,639 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 01:13:22,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 01:13:22,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 01:13:22,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 01:13:22,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 01:13:22,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 01:13:22,650 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 01:13:22,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 01:13:22,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 01:13:22,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 01:13:22,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 01:13:22,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 01:13:22,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 01:13:22,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 01:13:22,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 01:13:22,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 01:13:22,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 01:13:22,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 01:13:22,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 01:13:22,664 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 01:13:22,666 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-07 01:13:22,704 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 01:13:22,707 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 01:13:22,709 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 01:13:22,711 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 01:13:22,711 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 01:13:22,712 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 01:13:22,712 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 01:13:22,713 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 01:13:22,713 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 01:13:22,713 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 01:13:22,715 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 01:13:22,715 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 01:13:22,715 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 01:13:22,716 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 01:13:22,716 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 01:13:22,717 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-07 01:13:22,717 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-07 01:13:22,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 01:13:22,718 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 01:13:22,718 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-07 01:13:22,719 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 01:13:22,719 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 01:13:22,719 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 01:13:22,719 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-07 01:13:22,720 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-07 01:13:22,720 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 01:13:22,723 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 01:13:22,723 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 01:13:22,724 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 01:13:22,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 01:13:22,724 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 01:13:22,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:13:22,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 01:13:22,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 01:13:22,726 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 01:13:22,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 01:13:22,727 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 01:13:22,727 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 01:13:22,727 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_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/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_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8 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 -> f8d14145608efc0a8f321a178564faff63399ecbab28641c0c2971fec318068f [2021-11-07 01:13:23,063 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 01:13:23,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 01:13:23,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 01:13:23,105 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 01:13:23,106 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 01:13:23,107 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2021-11-07 01:13:23,214 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/data/b7b98194f/afba096ef6c94e4c9a33745887b785f3/FLAG8853545f2 [2021-11-07 01:13:23,907 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 01:13:23,919 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i [2021-11-07 01:13:23,938 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/data/b7b98194f/afba096ef6c94e4c9a33745887b785f3/FLAG8853545f2 [2021-11-07 01:13:24,112 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/data/b7b98194f/afba096ef6c94e4c9a33745887b785f3 [2021-11-07 01:13:24,115 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 01:13:24,117 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 01:13:24,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 01:13:24,120 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 01:13:24,124 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 01:13:24,125 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:13:24" (1/1) ... [2021-11-07 01:13:24,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8584607 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:24, skipping insertion in model container [2021-11-07 01:13:24,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 01:13:24" (1/1) ... [2021-11-07 01:13:24,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 01:13:24,196 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 01:13:24,620 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_f3020194-753d-4bdf-ae36-429c1aadbe29/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2021-11-07 01:13:24,669 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:13:24,681 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 01:13:24,710 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_f3020194-753d-4bdf-ae36-429c1aadbe29/sv-benchmarks/c/heap-manipulation/sll_to_dll_rev-1.i[22636,22649] [2021-11-07 01:13:24,750 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 01:13:24,783 INFO L208 MainTranslator]: Completed translation [2021-11-07 01:13:24,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:24 WrapperNode [2021-11-07 01:13:24,784 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 01:13:24,785 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 01:13:24,785 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 01:13:24,785 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 01:13:24,793 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:24" (1/1) ... [2021-11-07 01:13:24,809 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:24" (1/1) ... [2021-11-07 01:13:24,861 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 01:13:24,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 01:13:24,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 01:13:24,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 01:13:24,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:24" (1/1) ... [2021-11-07 01:13:24,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:24" (1/1) ... [2021-11-07 01:13:24,886 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:24" (1/1) ... [2021-11-07 01:13:24,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:24" (1/1) ... [2021-11-07 01:13:24,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:24" (1/1) ... [2021-11-07 01:13:24,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:24" (1/1) ... [2021-11-07 01:13:24,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:24" (1/1) ... [2021-11-07 01:13:24,934 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 01:13:24,935 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 01:13:24,935 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 01:13:24,941 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 01:13:24,944 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:24" (1/1) ... [2021-11-07 01:13:24,964 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 01:13:24,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 01:13:25,014 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 01:13:25,065 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 01:13:25,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-07 01:13:25,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-07 01:13:25,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 01:13:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-07 01:13:25,086 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-07 01:13:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-11-07 01:13:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 01:13:25,087 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 01:13:25,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 01:13:26,584 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 01:13:26,584 INFO L299 CfgBuilder]: Removed 137 assume(true) statements. [2021-11-07 01:13:26,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:13:26 BoogieIcfgContainer [2021-11-07 01:13:26,587 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 01:13:26,589 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 01:13:26,589 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 01:13:26,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 01:13:26,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 01:13:24" (1/3) ... [2021-11-07 01:13:26,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516fe6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:13:26, skipping insertion in model container [2021-11-07 01:13:26,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 01:13:24" (2/3) ... [2021-11-07 01:13:26,595 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@516fe6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 01:13:26, skipping insertion in model container [2021-11-07 01:13:26,595 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:13:26" (3/3) ... [2021-11-07 01:13:26,596 INFO L111 eAbstractionObserver]: Analyzing ICFG sll_to_dll_rev-1.i [2021-11-07 01:13:26,602 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 01:13:26,602 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 138 error locations. [2021-11-07 01:13:26,651 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 01:13:26,658 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 01:13:26,658 INFO L340 AbstractCegarLoop]: Starting to check reachability of 138 error locations. [2021-11-07 01:13:26,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 144 states have (on average 2.5208333333333335) internal successors, (363), 282 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:26,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-07 01:13:26,687 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:26,688 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-07 01:13:26,688 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:26,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:26,695 INFO L85 PathProgramCache]: Analyzing trace with hash 883824, now seen corresponding path program 1 times [2021-11-07 01:13:26,706 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:26,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19419636] [2021-11-07 01:13:26,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:26,708 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:26,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:26,935 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:26,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19419636] [2021-11-07 01:13:26,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19419636] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:26,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:26,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:13:26,939 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384905635] [2021-11-07 01:13:26,944 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:13:26,945 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:26,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:13:26,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:13:26,971 INFO L87 Difference]: Start difference. First operand has 283 states, 144 states have (on average 2.5208333333333335) internal successors, (363), 282 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:27,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:27,312 INFO L93 Difference]: Finished difference Result 278 states and 290 transitions. [2021-11-07 01:13:27,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:13:27,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-11-07 01:13:27,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:27,334 INFO L225 Difference]: With dead ends: 278 [2021-11-07 01:13:27,334 INFO L226 Difference]: Without dead ends: 277 [2021-11-07 01:13:27,336 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:13:27,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-11-07 01:13:27,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 276. [2021-11-07 01:13:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 144 states have (on average 2.0) internal successors, (288), 275 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:27,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 288 transitions. [2021-11-07 01:13:27,399 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 288 transitions. Word has length 3 [2021-11-07 01:13:27,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:27,399 INFO L470 AbstractCegarLoop]: Abstraction has 276 states and 288 transitions. [2021-11-07 01:13:27,400 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:27,400 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 288 transitions. [2021-11-07 01:13:27,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-11-07 01:13:27,400 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:27,400 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-11-07 01:13:27,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 01:13:27,401 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:27,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:27,404 INFO L85 PathProgramCache]: Analyzing trace with hash 883825, now seen corresponding path program 1 times [2021-11-07 01:13:27,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:27,405 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045530813] [2021-11-07 01:13:27,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:27,405 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:27,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:27,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:27,516 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:27,516 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045530813] [2021-11-07 01:13:27,516 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045530813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:27,516 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:27,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:13:27,517 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42034384] [2021-11-07 01:13:27,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 01:13:27,518 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:27,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 01:13:27,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:13:27,519 INFO L87 Difference]: Start difference. First operand 276 states and 288 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:27,708 INFO L93 Difference]: Finished difference Result 271 states and 283 transitions. [2021-11-07 01:13:27,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:13:27,709 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-11-07 01:13:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:27,711 INFO L225 Difference]: With dead ends: 271 [2021-11-07 01:13:27,711 INFO L226 Difference]: Without dead ends: 271 [2021-11-07 01:13:27,712 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 01:13:27,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2021-11-07 01:13:27,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2021-11-07 01:13:27,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 144 states have (on average 1.9583333333333333) internal successors, (282), 269 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 282 transitions. [2021-11-07 01:13:27,743 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 282 transitions. Word has length 3 [2021-11-07 01:13:27,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:27,743 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 282 transitions. [2021-11-07 01:13:27,743 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:27,744 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 282 transitions. [2021-11-07 01:13:27,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-07 01:13:27,744 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:27,745 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-07 01:13:27,746 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 01:13:27,749 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:27,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:27,750 INFO L85 PathProgramCache]: Analyzing trace with hash 849381547, now seen corresponding path program 1 times [2021-11-07 01:13:27,751 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:27,751 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548898493] [2021-11-07 01:13:27,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:27,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:27,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:27,884 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:27,884 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548898493] [2021-11-07 01:13:27,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548898493] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:27,884 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:27,885 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:13:27,885 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048165306] [2021-11-07 01:13:27,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:13:27,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:27,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:13:27,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:13:27,887 INFO L87 Difference]: Start difference. First operand 270 states and 282 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-11-07 01:13:28,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:28,176 INFO L93 Difference]: Finished difference Result 262 states and 274 transitions. [2021-11-07 01:13:28,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:13:28,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-11-07 01:13:28,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:28,179 INFO L225 Difference]: With dead ends: 262 [2021-11-07 01:13:28,179 INFO L226 Difference]: Without dead ends: 262 [2021-11-07 01:13:28,179 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:13:28,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-11-07 01:13:28,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2021-11-07 01:13:28,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 144 states have (on average 1.8958333333333333) internal successors, (273), 260 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:28,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 273 transitions. [2021-11-07 01:13:28,193 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 273 transitions. Word has length 5 [2021-11-07 01:13:28,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:28,194 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 273 transitions. [2021-11-07 01:13:28,194 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 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-11-07 01:13:28,194 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 273 transitions. [2021-11-07 01:13:28,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-07 01:13:28,194 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:28,195 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-07 01:13:28,195 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 01:13:28,195 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:28,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:28,196 INFO L85 PathProgramCache]: Analyzing trace with hash 849381548, now seen corresponding path program 1 times [2021-11-07 01:13:28,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:28,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438043931] [2021-11-07 01:13:28,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:28,197 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:28,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:28,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:28,312 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:28,312 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438043931] [2021-11-07 01:13:28,318 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438043931] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:28,319 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:28,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:13:28,319 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113324429] [2021-11-07 01:13:28,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:13:28,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:28,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:13:28,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:13:28,321 INFO L87 Difference]: Start difference. First operand 261 states and 273 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-07 01:13:28,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:28,667 INFO L93 Difference]: Finished difference Result 253 states and 265 transitions. [2021-11-07 01:13:28,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 01:13:28,668 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-07 01:13:28,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:28,670 INFO L225 Difference]: With dead ends: 253 [2021-11-07 01:13:28,670 INFO L226 Difference]: Without dead ends: 253 [2021-11-07 01:13:28,672 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:13:28,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2021-11-07 01:13:28,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 252. [2021-11-07 01:13:28,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 144 states have (on average 1.8333333333333333) 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-11-07 01:13:28,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2021-11-07 01:13:28,681 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 5 [2021-11-07 01:13:28,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:28,681 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2021-11-07 01:13:28,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 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-11-07 01:13:28,682 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2021-11-07 01:13:28,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-07 01:13:28,682 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:28,682 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-07 01:13:28,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 01:13:28,683 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:28,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:28,684 INFO L85 PathProgramCache]: Analyzing trace with hash 561024176, now seen corresponding path program 1 times [2021-11-07 01:13:28,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:28,685 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976083158] [2021-11-07 01:13:28,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:28,685 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:28,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:28,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:28,758 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:28,758 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976083158] [2021-11-07 01:13:28,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976083158] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:28,758 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:28,759 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:13:28,759 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189046619] [2021-11-07 01:13:28,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:13:28,761 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:28,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:13:28,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:13:28,762 INFO L87 Difference]: Start difference. First operand 252 states and 264 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-11-07 01:13:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:29,003 INFO L93 Difference]: Finished difference Result 250 states and 262 transitions. [2021-11-07 01:13:29,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:13:29,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-11-07 01:13:29,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:29,005 INFO L225 Difference]: With dead ends: 250 [2021-11-07 01:13:29,005 INFO L226 Difference]: Without dead ends: 250 [2021-11-07 01:13:29,006 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:13:29,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2021-11-07 01:13:29,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2021-11-07 01:13:29,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 144 states have (on average 1.8125) internal successors, (261), 248 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:29,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 261 transitions. [2021-11-07 01:13:29,012 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 261 transitions. Word has length 6 [2021-11-07 01:13:29,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:29,013 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 261 transitions. [2021-11-07 01:13:29,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-11-07 01:13:29,013 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 261 transitions. [2021-11-07 01:13:29,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-07 01:13:29,014 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:29,014 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-07 01:13:29,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 01:13:29,014 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:29,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:29,015 INFO L85 PathProgramCache]: Analyzing trace with hash 561024177, now seen corresponding path program 1 times [2021-11-07 01:13:29,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:29,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634542616] [2021-11-07 01:13:29,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:29,016 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:29,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:29,080 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:29,081 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634542616] [2021-11-07 01:13:29,081 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634542616] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:29,081 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:29,081 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:13:29,082 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313235181] [2021-11-07 01:13:29,082 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:13:29,082 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:29,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:13:29,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:13:29,083 INFO L87 Difference]: Start difference. First operand 249 states and 261 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-11-07 01:13:29,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:29,247 INFO L93 Difference]: Finished difference Result 247 states and 259 transitions. [2021-11-07 01:13:29,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:13:29,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-11-07 01:13:29,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:29,256 INFO L225 Difference]: With dead ends: 247 [2021-11-07 01:13:29,257 INFO L226 Difference]: Without dead ends: 247 [2021-11-07 01:13:29,257 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:13:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-11-07 01:13:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 246. [2021-11-07 01:13:29,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 144 states have (on average 1.7916666666666667) internal successors, (258), 245 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:29,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 258 transitions. [2021-11-07 01:13:29,266 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 258 transitions. Word has length 6 [2021-11-07 01:13:29,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:29,267 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 258 transitions. [2021-11-07 01:13:29,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-11-07 01:13:29,268 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 258 transitions. [2021-11-07 01:13:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:13:29,268 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:29,269 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:13:29,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 01:13:29,269 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:29,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:29,270 INFO L85 PathProgramCache]: Analyzing trace with hash -654503221, now seen corresponding path program 1 times [2021-11-07 01:13:29,270 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:29,278 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900665529] [2021-11-07 01:13:29,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:29,278 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:29,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:29,434 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:29,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900665529] [2021-11-07 01:13:29,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900665529] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:29,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:29,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:13:29,434 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517914629] [2021-11-07 01:13:29,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:13:29,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:29,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:13:29,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:13:29,435 INFO L87 Difference]: Start difference. First operand 246 states and 258 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:29,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:29,734 INFO L93 Difference]: Finished difference Result 245 states and 257 transitions. [2021-11-07 01:13:29,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:13:29,735 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-07 01:13:29,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:29,736 INFO L225 Difference]: With dead ends: 245 [2021-11-07 01:13:29,737 INFO L226 Difference]: Without dead ends: 245 [2021-11-07 01:13:29,737 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:13:29,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-11-07 01:13:29,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2021-11-07 01:13:29,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 144 states have (on average 1.7847222222222223) internal successors, (257), 244 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:29,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 257 transitions. [2021-11-07 01:13:29,750 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 257 transitions. Word has length 10 [2021-11-07 01:13:29,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:29,750 INFO L470 AbstractCegarLoop]: Abstraction has 245 states and 257 transitions. [2021-11-07 01:13:29,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:29,751 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 257 transitions. [2021-11-07 01:13:29,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-11-07 01:13:29,751 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:29,751 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:13:29,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 01:13:29,752 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:29,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:29,753 INFO L85 PathProgramCache]: Analyzing trace with hash -654503222, now seen corresponding path program 1 times [2021-11-07 01:13:29,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:29,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499194697] [2021-11-07 01:13:29,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:29,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:29,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:29,863 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:29,863 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499194697] [2021-11-07 01:13:29,863 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499194697] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:29,864 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:29,864 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 01:13:29,864 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129274013] [2021-11-07 01:13:29,865 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-11-07 01:13:29,865 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:29,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-11-07 01:13:29,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:13:29,866 INFO L87 Difference]: Start difference. First operand 245 states and 257 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:30,067 INFO L93 Difference]: Finished difference Result 244 states and 256 transitions. [2021-11-07 01:13:30,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:13:30,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-11-07 01:13:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:30,070 INFO L225 Difference]: With dead ends: 244 [2021-11-07 01:13:30,070 INFO L226 Difference]: Without dead ends: 244 [2021-11-07 01:13:30,070 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:13:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2021-11-07 01:13:30,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2021-11-07 01:13:30,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 144 states have (on average 1.7777777777777777) internal successors, (256), 243 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-11-07 01:13:30,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 256 transitions. [2021-11-07 01:13:30,076 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 256 transitions. Word has length 10 [2021-11-07 01:13:30,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:30,077 INFO L470 AbstractCegarLoop]: Abstraction has 244 states and 256 transitions. [2021-11-07 01:13:30,077 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:30,077 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 256 transitions. [2021-11-07 01:13:30,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 01:13:30,077 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:30,078 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:13:30,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 01:13:30,078 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:30,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:30,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1226462896, now seen corresponding path program 1 times [2021-11-07 01:13:30,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:30,079 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591264344] [2021-11-07 01:13:30,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:30,079 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:30,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:30,226 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:30,227 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591264344] [2021-11-07 01:13:30,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591264344] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:30,227 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:30,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-07 01:13:30,227 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716651946] [2021-11-07 01:13:30,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-07 01:13:30,228 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:30,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-07 01:13:30,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:13:30,229 INFO L87 Difference]: Start difference. First operand 244 states and 256 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:30,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:30,508 INFO L93 Difference]: Finished difference Result 243 states and 255 transitions. [2021-11-07 01:13:30,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 01:13:30,509 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-07 01:13:30,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:30,512 INFO L225 Difference]: With dead ends: 243 [2021-11-07 01:13:30,512 INFO L226 Difference]: Without dead ends: 243 [2021-11-07 01:13:30,513 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:13:30,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2021-11-07 01:13:30,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2021-11-07 01:13:30,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 242 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:30,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 255 transitions. [2021-11-07 01:13:30,521 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 255 transitions. Word has length 14 [2021-11-07 01:13:30,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:30,521 INFO L470 AbstractCegarLoop]: Abstraction has 243 states and 255 transitions. [2021-11-07 01:13:30,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:30,522 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 255 transitions. [2021-11-07 01:13:30,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-11-07 01:13:30,523 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:30,523 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:13:30,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-07 01:13:30,523 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:30,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:30,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1226462897, now seen corresponding path program 1 times [2021-11-07 01:13:30,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:30,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148219679] [2021-11-07 01:13:30,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:30,527 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:30,698 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:30,701 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148219679] [2021-11-07 01:13:30,701 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148219679] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:30,702 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:30,702 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 01:13:30,702 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556297796] [2021-11-07 01:13:30,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 01:13:30,703 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:30,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 01:13:30,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:13:30,705 INFO L87 Difference]: Start difference. First operand 243 states and 255 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:31,002 INFO L93 Difference]: Finished difference Result 242 states and 254 transitions. [2021-11-07 01:13:31,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:13:31,003 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-11-07 01:13:31,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:31,005 INFO L225 Difference]: With dead ends: 242 [2021-11-07 01:13:31,005 INFO L226 Difference]: Without dead ends: 242 [2021-11-07 01:13:31,005 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 01:13:31,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-11-07 01:13:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-11-07 01:13:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 144 states have (on average 1.7638888888888888) internal successors, (254), 241 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:31,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 254 transitions. [2021-11-07 01:13:31,013 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 254 transitions. Word has length 14 [2021-11-07 01:13:31,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:31,013 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 254 transitions. [2021-11-07 01:13:31,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 254 transitions. [2021-11-07 01:13:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:13:31,015 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:31,015 INFO L513 BasicCegarLoop]: trace histogram [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-11-07 01:13:31,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-07 01:13:31,015 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:31,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:31,017 INFO L85 PathProgramCache]: Analyzing trace with hash 640226691, now seen corresponding path program 1 times [2021-11-07 01:13:31,017 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:31,017 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224836961] [2021-11-07 01:13:31,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:31,018 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:31,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:31,171 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:31,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224836961] [2021-11-07 01:13:31,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224836961] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:31,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:31,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:13:31,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907278498] [2021-11-07 01:13:31,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:13:31,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:31,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:13:31,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:13:31,177 INFO L87 Difference]: Start difference. First operand 242 states and 254 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 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-11-07 01:13:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:31,423 INFO L93 Difference]: Finished difference Result 245 states and 258 transitions. [2021-11-07 01:13:31,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:13:31,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 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-11-07 01:13:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:31,425 INFO L225 Difference]: With dead ends: 245 [2021-11-07 01:13:31,425 INFO L226 Difference]: Without dead ends: 245 [2021-11-07 01:13:31,426 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:13:31,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2021-11-07 01:13:31,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 235. [2021-11-07 01:13:31,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 144 states have (on average 1.7152777777777777) internal successors, (247), 234 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 247 transitions. [2021-11-07 01:13:31,431 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 247 transitions. Word has length 24 [2021-11-07 01:13:31,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:31,432 INFO L470 AbstractCegarLoop]: Abstraction has 235 states and 247 transitions. [2021-11-07 01:13:31,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 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-11-07 01:13:31,432 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 247 transitions. [2021-11-07 01:13:31,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-07 01:13:31,433 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:31,433 INFO L513 BasicCegarLoop]: trace histogram [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-11-07 01:13:31,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 01:13:31,433 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr41REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:31,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:31,434 INFO L85 PathProgramCache]: Analyzing trace with hash 640226692, now seen corresponding path program 1 times [2021-11-07 01:13:31,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:31,434 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242800329] [2021-11-07 01:13:31,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:31,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:31,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:31,552 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:31,552 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242800329] [2021-11-07 01:13:31,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242800329] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:31,552 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:31,552 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:13:31,553 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247840441] [2021-11-07 01:13:31,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:13:31,553 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:31,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:13:31,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:13:31,554 INFO L87 Difference]: Start difference. First operand 235 states and 247 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 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-11-07 01:13:31,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:31,794 INFO L93 Difference]: Finished difference Result 238 states and 251 transitions. [2021-11-07 01:13:31,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:13:31,795 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 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-11-07 01:13:31,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:31,796 INFO L225 Difference]: With dead ends: 238 [2021-11-07 01:13:31,796 INFO L226 Difference]: Without dead ends: 238 [2021-11-07 01:13:31,797 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:13:31,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2021-11-07 01:13:31,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 228. [2021-11-07 01:13:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 144 states have (on average 1.6666666666666667) internal successors, (240), 227 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:31,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 240 transitions. [2021-11-07 01:13:31,803 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 240 transitions. Word has length 24 [2021-11-07 01:13:31,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:31,804 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 240 transitions. [2021-11-07 01:13:31,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 4 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-11-07 01:13:31,804 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 240 transitions. [2021-11-07 01:13:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:13:31,805 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:31,805 INFO L513 BasicCegarLoop]: trace histogram [1, 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-11-07 01:13:31,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 01:13:31,806 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:31,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:31,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1627808933, now seen corresponding path program 1 times [2021-11-07 01:13:31,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:31,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631771155] [2021-11-07 01:13:31,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:31,807 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:31,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:31,915 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:31,915 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631771155] [2021-11-07 01:13:31,915 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631771155] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:31,916 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:31,916 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:13:31,916 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160968546] [2021-11-07 01:13:31,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:13:31,917 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:31,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:13:31,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:13:31,918 INFO L87 Difference]: Start difference. First operand 228 states and 240 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:32,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:32,195 INFO L93 Difference]: Finished difference Result 231 states and 244 transitions. [2021-11-07 01:13:32,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:13:32,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 01:13:32,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:32,198 INFO L225 Difference]: With dead ends: 231 [2021-11-07 01:13:32,198 INFO L226 Difference]: Without dead ends: 231 [2021-11-07 01:13:32,199 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-11-07 01:13:32,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2021-11-07 01:13:32,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 221. [2021-11-07 01:13:32,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 144 states have (on average 1.6180555555555556) internal successors, (233), 220 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:32,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 233 transitions. [2021-11-07 01:13:32,205 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 233 transitions. Word has length 25 [2021-11-07 01:13:32,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:32,206 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 233 transitions. [2021-11-07 01:13:32,206 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:32,206 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 233 transitions. [2021-11-07 01:13:32,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-11-07 01:13:32,207 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:32,207 INFO L513 BasicCegarLoop]: trace histogram [1, 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-11-07 01:13:32,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 01:13:32,208 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:32,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:32,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1627808932, now seen corresponding path program 1 times [2021-11-07 01:13:32,208 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:32,209 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978895053] [2021-11-07 01:13:32,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:32,209 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:32,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:32,314 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:32,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978895053] [2021-11-07 01:13:32,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978895053] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:32,315 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:32,315 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 01:13:32,315 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896421193] [2021-11-07 01:13:32,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-07 01:13:32,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:32,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-07 01:13:32,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-11-07 01:13:32,317 INFO L87 Difference]: Start difference. First operand 221 states and 233 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:32,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:32,547 INFO L93 Difference]: Finished difference Result 224 states and 237 transitions. [2021-11-07 01:13:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 01:13:32,548 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-11-07 01:13:32,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:32,549 INFO L225 Difference]: With dead ends: 224 [2021-11-07 01:13:32,550 INFO L226 Difference]: Without dead ends: 224 [2021-11-07 01:13:32,550 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-11-07 01:13:32,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2021-11-07 01:13:32,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 214. [2021-11-07 01:13:32,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 144 states have (on average 1.5694444444444444) internal successors, (226), 213 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:32,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 226 transitions. [2021-11-07 01:13:32,556 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 226 transitions. Word has length 25 [2021-11-07 01:13:32,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:32,556 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 226 transitions. [2021-11-07 01:13:32,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:32,557 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 226 transitions. [2021-11-07 01:13:32,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-11-07 01:13:32,558 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:32,558 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 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-11-07 01:13:32,558 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 01:13:32,558 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:32,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:32,559 INFO L85 PathProgramCache]: Analyzing trace with hash -955589745, now seen corresponding path program 1 times [2021-11-07 01:13:32,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:32,559 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823946152] [2021-11-07 01:13:32,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:32,560 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:32,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:33,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:33,256 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:33,256 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823946152] [2021-11-07 01:13:33,256 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823946152] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:33,256 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:33,257 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2021-11-07 01:13:33,257 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212194356] [2021-11-07 01:13:33,257 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-07 01:13:33,257 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:33,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-07 01:13:33,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-07 01:13:33,259 INFO L87 Difference]: Start difference. First operand 214 states and 226 transitions. Second operand has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:35,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:35,300 INFO L93 Difference]: Finished difference Result 406 states and 429 transitions. [2021-11-07 01:13:35,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:13:35,301 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 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 27 [2021-11-07 01:13:35,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:35,304 INFO L225 Difference]: With dead ends: 406 [2021-11-07 01:13:35,304 INFO L226 Difference]: Without dead ends: 406 [2021-11-07 01:13:35,305 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2021-11-07 01:13:35,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2021-11-07 01:13:35,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 226. [2021-11-07 01:13:35,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 225 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:35,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 239 transitions. [2021-11-07 01:13:35,318 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 239 transitions. Word has length 27 [2021-11-07 01:13:35,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:35,318 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 239 transitions. [2021-11-07 01:13:35,319 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5) internal successors, (27), 17 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 239 transitions. [2021-11-07 01:13:35,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 01:13:35,328 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:35,328 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 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-11-07 01:13:35,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-07 01:13:35,329 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:35,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:35,329 INFO L85 PathProgramCache]: Analyzing trace with hash 801448723, now seen corresponding path program 1 times [2021-11-07 01:13:35,329 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:35,333 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415883758] [2021-11-07 01:13:35,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:35,333 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:35,869 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:35,870 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415883758] [2021-11-07 01:13:35,870 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415883758] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:35,870 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:35,870 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-07 01:13:35,870 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099860149] [2021-11-07 01:13:35,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:13:35,871 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:35,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:13:35,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:13:35,872 INFO L87 Difference]: Start difference. First operand 226 states and 239 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:37,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:37,614 INFO L93 Difference]: Finished difference Result 488 states and 518 transitions. [2021-11-07 01:13:37,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-11-07 01:13:37,615 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-07 01:13:37,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:37,618 INFO L225 Difference]: With dead ends: 488 [2021-11-07 01:13:37,618 INFO L226 Difference]: Without dead ends: 488 [2021-11-07 01:13:37,619 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=238, Invalid=952, Unknown=0, NotChecked=0, Total=1190 [2021-11-07 01:13:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-11-07 01:13:37,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 268. [2021-11-07 01:13:37,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 198 states have (on average 1.5101010101010102) internal successors, (299), 267 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:37,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 299 transitions. [2021-11-07 01:13:37,635 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 299 transitions. Word has length 29 [2021-11-07 01:13:37,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:37,636 INFO L470 AbstractCegarLoop]: Abstraction has 268 states and 299 transitions. [2021-11-07 01:13:37,637 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:37,637 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 299 transitions. [2021-11-07 01:13:37,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 01:13:37,639 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:37,640 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-11-07 01:13:37,640 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-07 01:13:37,640 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:37,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:37,641 INFO L85 PathProgramCache]: Analyzing trace with hash -924887149, now seen corresponding path program 1 times [2021-11-07 01:13:37,641 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:37,641 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472044434] [2021-11-07 01:13:37,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:37,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:37,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:38,427 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:38,428 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472044434] [2021-11-07 01:13:38,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472044434] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:38,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:38,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2021-11-07 01:13:38,428 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228502653] [2021-11-07 01:13:38,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2021-11-07 01:13:38,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:38,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2021-11-07 01:13:38,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2021-11-07 01:13:38,430 INFO L87 Difference]: Start difference. First operand 268 states and 299 transitions. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:40,045 INFO L93 Difference]: Finished difference Result 416 states and 455 transitions. [2021-11-07 01:13:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-11-07 01:13:40,046 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 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 30 [2021-11-07 01:13:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:40,048 INFO L225 Difference]: With dead ends: 416 [2021-11-07 01:13:40,049 INFO L226 Difference]: Without dead ends: 416 [2021-11-07 01:13:40,049 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=141, Invalid=615, Unknown=0, NotChecked=0, Total=756 [2021-11-07 01:13:40,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2021-11-07 01:13:40,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 267. [2021-11-07 01:13:40,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 198 states have (on average 1.5) internal successors, (297), 266 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:40,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 297 transitions. [2021-11-07 01:13:40,057 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 297 transitions. Word has length 30 [2021-11-07 01:13:40,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:40,057 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 297 transitions. [2021-11-07 01:13:40,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:40,057 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 297 transitions. [2021-11-07 01:13:40,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-11-07 01:13:40,058 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:40,058 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 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-11-07 01:13:40,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-07 01:13:40,059 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:40,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:40,059 INFO L85 PathProgramCache]: Analyzing trace with hash -924887148, now seen corresponding path program 1 times [2021-11-07 01:13:40,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:40,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873430797] [2021-11-07 01:13:40,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:40,060 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:40,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 01:13:40,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 01:13:40,724 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 01:13:40,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873430797] [2021-11-07 01:13:40,724 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873430797] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 01:13:40,724 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 01:13:40,724 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2021-11-07 01:13:40,724 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827320905] [2021-11-07 01:13:40,725 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2021-11-07 01:13:40,725 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 01:13:40,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2021-11-07 01:13:40,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=234, Unknown=0, NotChecked=0, Total=272 [2021-11-07 01:13:40,726 INFO L87 Difference]: Start difference. First operand 267 states and 297 transitions. Second operand has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 01:13:42,886 INFO L93 Difference]: Finished difference Result 445 states and 484 transitions. [2021-11-07 01:13:42,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-11-07 01:13:42,886 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 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 30 [2021-11-07 01:13:42,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 01:13:42,889 INFO L225 Difference]: With dead ends: 445 [2021-11-07 01:13:42,889 INFO L226 Difference]: Without dead ends: 445 [2021-11-07 01:13:42,889 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=166, Invalid=704, Unknown=0, NotChecked=0, Total=870 [2021-11-07 01:13:42,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2021-11-07 01:13:42,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 271. [2021-11-07 01:13:42,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 202 states have (on average 1.49009900990099) internal successors, (301), 270 states have internal predecessors, (301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:42,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 301 transitions. [2021-11-07 01:13:42,897 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 301 transitions. Word has length 30 [2021-11-07 01:13:42,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 01:13:42,897 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 301 transitions. [2021-11-07 01:13:42,897 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.875) internal successors, (30), 16 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 01:13:42,897 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 301 transitions. [2021-11-07 01:13:42,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2021-11-07 01:13:42,898 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 01:13:42,898 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-07 01:13:42,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-07 01:13:42,899 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 134 more)] === [2021-11-07 01:13:42,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 01:13:42,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1077683325, now seen corresponding path program 1 times [2021-11-07 01:13:42,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 01:13:42,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478472614] [2021-11-07 01:13:42,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 01:13:42,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 01:13:42,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:13:42,970 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 01:13:43,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 01:13:43,090 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 01:13:43,090 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 01:13:43,091 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,093 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-07 01:13:43,093 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-07 01:13:43,094 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-07 01:13:43,094 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-07 01:13:43,094 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-11-07 01:13:43,094 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-11-07 01:13:43,094 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-11-07 01:13:43,095 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-11-07 01:13:43,095 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-11-07 01:13:43,095 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-11-07 01:13:43,095 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-11-07 01:13:43,095 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-11-07 01:13:43,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-11-07 01:13:43,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-11-07 01:13:43,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-11-07 01:13:43,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-11-07 01:13:43,096 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-11-07 01:13:43,097 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-11-07 01:13:43,097 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-11-07 01:13:43,097 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-11-07 01:13:43,097 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-11-07 01:13:43,097 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-11-07 01:13:43,098 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-11-07 01:13:43,098 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-11-07 01:13:43,098 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-11-07 01:13:43,098 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-11-07 01:13:43,098 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-11-07 01:13:43,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-11-07 01:13:43,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-11-07 01:13:43,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-11-07 01:13:43,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-11-07 01:13:43,099 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-11-07 01:13:43,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-11-07 01:13:43,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-11-07 01:13:43,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-11-07 01:13:43,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-11-07 01:13:43,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-11-07 01:13:43,100 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-11-07 01:13:43,101 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-11-07 01:13:43,101 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-11-07 01:13:43,101 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-11-07 01:13:43,101 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-11-07 01:13:43,101 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-11-07 01:13:43,102 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-11-07 01:13:43,102 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,102 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,102 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-11-07 01:13:43,102 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-11-07 01:13:43,103 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-11-07 01:13:43,103 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-11-07 01:13:43,103 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-11-07 01:13:43,103 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-11-07 01:13:43,103 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-11-07 01:13:43,103 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-11-07 01:13:43,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-11-07 01:13:43,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-11-07 01:13:43,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-11-07 01:13:43,104 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-11-07 01:13:43,105 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,105 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-11-07 01:13:43,105 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-11-07 01:13:43,105 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-11-07 01:13:43,105 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-11-07 01:13:43,106 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-11-07 01:13:43,106 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-11-07 01:13:43,106 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION [2021-11-07 01:13:43,106 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-11-07 01:13:43,106 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-11-07 01:13:43,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-11-07 01:13:43,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,107 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-11-07 01:13:43,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-11-07 01:13:43,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-11-07 01:13:43,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION [2021-11-07 01:13:43,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-11-07 01:13:43,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-11-07 01:13:43,108 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATION [2021-11-07 01:13:43,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-11-07 01:13:43,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,109 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-11-07 01:13:43,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-11-07 01:13:43,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATION [2021-11-07 01:13:43,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-11-07 01:13:43,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATION [2021-11-07 01:13:43,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-11-07 01:13:43,110 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-11-07 01:13:43,111 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATION [2021-11-07 01:13:43,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-11-07 01:13:43,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATION [2021-11-07 01:13:43,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95REQUIRES_VIOLATION [2021-11-07 01:13:43,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-11-07 01:13:43,112 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATION [2021-11-07 01:13:43,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98REQUIRES_VIOLATION [2021-11-07 01:13:43,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101REQUIRES_VIOLATION [2021-11-07 01:13:43,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102REQUIRES_VIOLATION [2021-11-07 01:13:43,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,113 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104REQUIRES_VIOLATION [2021-11-07 01:13:43,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105REQUIRES_VIOLATION [2021-11-07 01:13:43,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-11-07 01:13:43,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107REQUIRES_VIOLATION [2021-11-07 01:13:43,114 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108REQUIRES_VIOLATION [2021-11-07 01:13:43,115 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-11-07 01:13:43,115 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,115 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,115 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-11-07 01:13:43,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-11-07 01:13:43,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115REQUIRES_VIOLATION [2021-11-07 01:13:43,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-11-07 01:13:43,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117REQUIRES_VIOLATION [2021-11-07 01:13:43,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118REQUIRES_VIOLATION [2021-11-07 01:13:43,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119REQUIRES_VIOLATION [2021-11-07 01:13:43,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120REQUIRES_VIOLATION [2021-11-07 01:13:43,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-11-07 01:13:43,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122REQUIRES_VIOLATION [2021-11-07 01:13:43,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123REQUIRES_VIOLATION [2021-11-07 01:13:43,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124REQUIRES_VIOLATION [2021-11-07 01:13:43,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127REQUIRES_VIOLATION [2021-11-07 01:13:43,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128REQUIRES_VIOLATION [2021-11-07 01:13:43,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130REQUIRES_VIOLATION [2021-11-07 01:13:43,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr131REQUIRES_VIOLATION [2021-11-07 01:13:43,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr132REQUIRES_VIOLATION [2021-11-07 01:13:43,120 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr133REQUIRES_VIOLATION [2021-11-07 01:13:43,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr134ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 01:13:43,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr135ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 01:13:43,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr136ASSERT_VIOLATIONMEMORY_FREE [2021-11-07 01:13:43,121 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr137ASSERT_VIOLATIONMEMORY_LEAK [2021-11-07 01:13:43,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-07 01:13:43,125 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 01:13:43,131 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 01:13:43,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 01:13:43 BoogieIcfgContainer [2021-11-07 01:13:43,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 01:13:43,211 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 01:13:43,211 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 01:13:43,211 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 01:13:43,212 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 01:13:26" (3/4) ... [2021-11-07 01:13:43,214 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 01:13:43,287 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 01:13:43,287 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 01:13:43,289 INFO L168 Benchmark]: Toolchain (without parser) took 19170.40 ms. Allocated memory was 96.5 MB in the beginning and 207.6 MB in the end (delta: 111.1 MB). Free memory was 60.7 MB in the beginning and 80.2 MB in the end (delta: -19.5 MB). Peak memory consumption was 91.0 MB. Max. memory is 16.1 GB. [2021-11-07 01:13:43,289 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 96.5 MB. Free memory was 66.7 MB in the beginning and 66.7 MB in the end (delta: 25.4 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 01:13:43,290 INFO L168 Benchmark]: CACSL2BoogieTranslator took 664.66 ms. Allocated memory is still 96.5 MB. Free memory was 60.5 MB in the beginning and 65.2 MB in the end (delta: -4.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-07 01:13:43,290 INFO L168 Benchmark]: Boogie Procedure Inliner took 85.00 ms. Allocated memory is still 96.5 MB. Free memory was 65.2 MB in the beginning and 62.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 01:13:43,291 INFO L168 Benchmark]: Boogie Preprocessor took 63.81 ms. Allocated memory is still 96.5 MB. Free memory was 62.0 MB in the beginning and 59.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-07 01:13:43,291 INFO L168 Benchmark]: RCFGBuilder took 1652.54 ms. Allocated memory was 96.5 MB in the beginning and 123.7 MB in the end (delta: 27.3 MB). Free memory was 59.0 MB in the beginning and 58.1 MB in the end (delta: 843.6 kB). Peak memory consumption was 29.7 MB. Max. memory is 16.1 GB. [2021-11-07 01:13:43,292 INFO L168 Benchmark]: TraceAbstraction took 16620.38 ms. Allocated memory was 123.7 MB in the beginning and 207.6 MB in the end (delta: 83.9 MB). Free memory was 57.3 MB in the beginning and 85.4 MB in the end (delta: -28.1 MB). Peak memory consumption was 55.4 MB. Max. memory is 16.1 GB. [2021-11-07 01:13:43,292 INFO L168 Benchmark]: Witness Printer took 76.64 ms. Allocated memory is still 207.6 MB. Free memory was 85.4 MB in the beginning and 80.2 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-11-07 01:13:43,295 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.40 ms. Allocated memory is still 96.5 MB. Free memory was 66.7 MB in the beginning and 66.7 MB in the end (delta: 25.4 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 664.66 ms. Allocated memory is still 96.5 MB. Free memory was 60.5 MB in the beginning and 65.2 MB in the end (delta: -4.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 85.00 ms. Allocated memory is still 96.5 MB. Free memory was 65.2 MB in the beginning and 62.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 63.81 ms. Allocated memory is still 96.5 MB. Free memory was 62.0 MB in the beginning and 59.0 MB in the end (delta: 3.0 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1652.54 ms. Allocated memory was 96.5 MB in the beginning and 123.7 MB in the end (delta: 27.3 MB). Free memory was 59.0 MB in the beginning and 58.1 MB in the end (delta: 843.6 kB). Peak memory consumption was 29.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 16620.38 ms. Allocated memory was 123.7 MB in the beginning and 207.6 MB in the end (delta: 83.9 MB). Free memory was 57.3 MB in the beginning and 85.4 MB in the end (delta: -28.1 MB). Peak memory consumption was 55.4 MB. Max. memory is 16.1 GB. * Witness Printer took 76.64 ms. Allocated memory is still 207.6 MB. Free memory was 85.4 MB in the beginning and 80.2 MB in the end (delta: 5.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L639] const struct node *p1, *p2; [L588] struct node *list = ((void *)0); [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node [L591] COND FALSE !(__VERIFIER_nondet_int()) [L592] EXPR \read(*list) [L592] *pp2 = list [L593] COND FALSE !(__VERIFIER_nondet_int()) [L595] EXPR \read(*list) [L595] *pp1 = list [L573] struct node *ptr = malloc(sizeof *ptr); [L574] COND FALSE !(!ptr) [L576] ptr->next = ((void *)0) [L577] ptr->prev = ((void *)0) [L578] return ptr; [L582] struct node *node = alloc_node(); [L583] EXPR \read(**ppnode) [L583] node->next = *ppnode [L584] *ppnode = node [L598] COND FALSE !(__VERIFIER_nondet_int()) [L599] EXPR \read(*list) [L599] return list; [L588] struct node *list = ((void *)0); [L599] return list; [L640] struct node *list = create_sll(&p1, &p2); [L642] \read(*p1) [L642] \read(*p2) [L626] COND FALSE !(!(beg)) [L627] COND FALSE !(!(end)) [L628] EXPR beg->next [L628] beg = beg->next [L628] COND TRUE end != beg [L629] COND TRUE !(beg) [L565] reach_error() - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: 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: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 592]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: 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: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 595]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 576]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 577]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 583]: 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: 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: 642]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 642]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 642]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 642]: 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: 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: 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: 643]: 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: 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: 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 603]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 603]: 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: 647]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 647]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 647]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 647]: 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: 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: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: 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: 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 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: 612]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 612]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 613]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 614]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 651]: 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 652]: 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: 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: 628]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 628]: 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: 621]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 621]: 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: 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: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 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: 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: 657]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 657]: 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 free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 637]: 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, 283 locations, 138 error locations. Started 1 CEGAR loops. OverallTime: 16.4s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3046 SDtfs, 5744 SDslu, 9413 SDs, 0 SdLazy, 7941 SolverSat, 532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 183 GetRequests, 14 SyntacticMatches, 7 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=283occurred in iteration=0, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 769 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 323 NumberOfCodeBlocks, 323 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 272 ConstructedInterpolants, 0 QuantifiedInterpolants, 3934 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-11-07 01:13:43,372 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3020194-753d-4bdf-ae36-429c1aadbe29/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)