./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 9da06905288f50cb44b9fcf3eb01ce9d3ae2a7ce975483c1902e3cc7a41605c5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:34:16,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:34:16,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:34:16,801 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:34:16,802 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:34:16,803 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:34:16,805 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:34:16,807 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:34:16,809 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:34:16,810 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:34:16,811 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:34:16,813 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:34:16,814 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:34:16,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:34:16,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:34:16,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:34:16,819 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:34:16,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:34:16,822 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:34:16,824 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:34:16,826 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:34:16,835 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:34:16,837 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:34:16,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:34:16,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:34:16,853 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:34:16,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:34:16,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:34:16,855 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:34:16,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:34:16,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:34:16,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:34:16,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:34:16,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:34:16,863 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:34:16,864 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:34:16,865 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:34:16,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:34:16,867 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:34:16,869 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:34:16,872 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:34:16,873 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-11-25 23:34:16,909 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:34:16,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:34:16,913 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:34:16,914 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:34:16,915 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:34:16,915 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:34:16,916 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:34:16,916 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:34:16,916 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:34:16,917 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:34:16,918 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:34:16,918 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:34:16,918 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:34:16,919 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:34:16,919 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:34:16,919 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:34:16,920 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:34:16,920 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:34:16,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:34:16,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:34:16,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:34:16,922 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:34:16,922 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:34:16,922 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:34:16,923 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:34:16,924 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:34:16,924 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:34:16,924 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:34:16,925 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:34:16,925 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:34:16,925 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:34:16,926 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:34:16,926 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:34:16,926 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:34:16,927 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:34:16,927 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:34:16,927 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:34:16,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:34:16,928 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:34:16,928 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur/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_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9da06905288f50cb44b9fcf3eb01ce9d3ae2a7ce975483c1902e3cc7a41605c5 [2022-11-25 23:34:17,250 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:34:17,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:34:17,291 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:34:17,292 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:34:17,293 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:34:17,294 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i [2022-11-25 23:34:20,429 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:34:20,709 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:34:20,710 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/sv-benchmarks/c/termination-memory-alloca/b.15-alloca.i [2022-11-25 23:34:20,723 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur/data/de31e707d/946a0277cbca458ab6a5d2c7ab0826c2/FLAGd02716b07 [2022-11-25 23:34:20,750 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur/data/de31e707d/946a0277cbca458ab6a5d2c7ab0826c2 [2022-11-25 23:34:20,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:34:20,755 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:34:20,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:34:20,757 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:34:20,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:34:20,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:34:20" (1/1) ... [2022-11-25 23:34:20,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5728977f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:34:20, skipping insertion in model container [2022-11-25 23:34:20,764 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:34:20" (1/1) ... [2022-11-25 23:34:20,775 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:34:20,812 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:34:21,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:34:21,197 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:34:21,238 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:34:21,264 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:34:21,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:34:21 WrapperNode [2022-11-25 23:34:21,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:34:21,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:34:21,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:34:21,266 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:34:21,275 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:34:21" (1/1) ... [2022-11-25 23:34:21,287 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:34:21" (1/1) ... [2022-11-25 23:34:21,311 INFO L138 Inliner]: procedures = 111, calls = 30, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 88 [2022-11-25 23:34:21,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:34:21,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:34:21,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:34:21,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:34:21,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:34:21" (1/1) ... [2022-11-25 23:34:21,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:34:21" (1/1) ... [2022-11-25 23:34:21,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:34:21" (1/1) ... [2022-11-25 23:34:21,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:34:21" (1/1) ... [2022-11-25 23:34:21,330 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:34:21" (1/1) ... [2022-11-25 23:34:21,334 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:34:21" (1/1) ... [2022-11-25 23:34:21,335 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:34:21" (1/1) ... [2022-11-25 23:34:21,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:34:21" (1/1) ... [2022-11-25 23:34:21,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:34:21,340 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:34:21,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:34:21,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:34:21,342 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:34:21" (1/1) ... [2022-11-25 23:34:21,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:34:21,360 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:34:21,377 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:34:21,383 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:34:21,440 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:34:21,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:34:21,440 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:34:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:34:21,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:34:21,444 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:34:21,553 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:34:21,556 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:34:21,960 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:34:22,008 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:34:22,008 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 23:34:22,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:34:22 BoogieIcfgContainer [2022-11-25 23:34:22,011 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:34:22,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:34:22,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:34:22,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:34:22,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:34:20" (1/3) ... [2022-11-25 23:34:22,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581176dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:34:22, skipping insertion in model container [2022-11-25 23:34:22,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:34:21" (2/3) ... [2022-11-25 23:34:22,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@581176dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:34:22, skipping insertion in model container [2022-11-25 23:34:22,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:34:22" (3/3) ... [2022-11-25 23:34:22,021 INFO L112 eAbstractionObserver]: Analyzing ICFG b.15-alloca.i [2022-11-25 23:34:22,041 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:34:22,042 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-11-25 23:34:22,106 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:34:22,112 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6573b31, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:34:22,113 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-25 23:34:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 20 states have (on average 2.8) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-25 23:34:22,122 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:34:22,122 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-25 23:34:22,123 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 23:34:22,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:34:22,129 INFO L85 PathProgramCache]: Analyzing trace with hash 3879, now seen corresponding path program 1 times [2022-11-25 23:34:22,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:34:22,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276275430] [2022-11-25 23:34:22,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:22,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:34:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:22,729 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:34:22,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276275430] [2022-11-25 23:34:22,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276275430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:34:22,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:34:22,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:34:22,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912118549] [2022-11-25 23:34:22,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:34:22,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:34:22,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:34:22,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:34:22,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:22,776 INFO L87 Difference]: Start difference. First operand has 52 states, 20 states have (on average 2.8) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:22,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:34:22,863 INFO L93 Difference]: Finished difference Result 47 states and 49 transitions. [2022-11-25 23:34:22,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:34:22,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-25 23:34:22,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:34:22,875 INFO L225 Difference]: With dead ends: 47 [2022-11-25 23:34:22,876 INFO L226 Difference]: Without dead ends: 46 [2022-11-25 23:34:22,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:22,881 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:34:22,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 17 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:34:22,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-25 23:34:22,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-25 23:34:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 20 states have (on average 2.4) internal successors, (48), 45 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-11-25 23:34:22,920 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 2 [2022-11-25 23:34:22,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:34:22,921 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-11-25 23:34:22,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-11-25 23:34:22,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-25 23:34:22,922 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:34:22,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-25 23:34:22,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:34:22,923 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 23:34:22,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:34:22,924 INFO L85 PathProgramCache]: Analyzing trace with hash 3880, now seen corresponding path program 1 times [2022-11-25 23:34:22,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:34:22,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19127558] [2022-11-25 23:34:22,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:22,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:34:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:23,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:23,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:34:23,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19127558] [2022-11-25 23:34:23,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19127558] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:34:23,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:34:23,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:34:23,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782438657] [2022-11-25 23:34:23,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:34:23,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:34:23,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:34:23,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:34:23,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:23,120 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:23,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:34:23,217 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-11-25 23:34:23,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:34:23,217 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-11-25 23:34:23,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:34:23,218 INFO L225 Difference]: With dead ends: 41 [2022-11-25 23:34:23,219 INFO L226 Difference]: Without dead ends: 41 [2022-11-25 23:34:23,219 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:23,221 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:34:23,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 17 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:34:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-25 23:34:23,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-25 23:34:23,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 20 states have (on average 2.15) internal successors, (43), 40 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:23,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-11-25 23:34:23,231 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 2 [2022-11-25 23:34:23,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:34:23,234 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-11-25 23:34:23,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:23,236 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-11-25 23:34:23,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:34:23,236 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:34:23,236 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:34:23,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:34:23,238 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 23:34:23,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:34:23,242 INFO L85 PathProgramCache]: Analyzing trace with hash 120225, now seen corresponding path program 1 times [2022-11-25 23:34:23,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:34:23,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972193220] [2022-11-25 23:34:23,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:23,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:34:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:23,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:23,509 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:34:23,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972193220] [2022-11-25 23:34:23,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972193220] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:34:23,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:34:23,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:34:23,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062667444] [2022-11-25 23:34:23,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:34:23,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:34:23,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:34:23,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:34:23,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:23,517 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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) [2022-11-25 23:34:23,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:34:23,602 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2022-11-25 23:34:23,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:34:23,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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 [2022-11-25 23:34:23,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:34:23,604 INFO L225 Difference]: With dead ends: 36 [2022-11-25 23:34:23,604 INFO L226 Difference]: Without dead ends: 36 [2022-11-25 23:34:23,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:23,612 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:34:23,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 12 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:34:23,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-25 23:34:23,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-11-25 23:34:23,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.9) internal successors, (38), 35 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:23,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-11-25 23:34:23,624 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 3 [2022-11-25 23:34:23,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:34:23,625 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-11-25 23:34:23,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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) [2022-11-25 23:34:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-11-25 23:34:23,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:34:23,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:34:23,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:34:23,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:34:23,627 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 23:34:23,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:34:23,632 INFO L85 PathProgramCache]: Analyzing trace with hash 120226, now seen corresponding path program 1 times [2022-11-25 23:34:23,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:34:23,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694656600] [2022-11-25 23:34:23,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:23,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:34:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:23,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:23,871 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:34:23,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694656600] [2022-11-25 23:34:23,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694656600] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:34:23,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:34:23,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:34:23,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547998107] [2022-11-25 23:34:23,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:34:23,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:34:23,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:34:23,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:34:23,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:23,874 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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) [2022-11-25 23:34:23,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:34:23,933 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2022-11-25 23:34:23,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:34:23,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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 [2022-11-25 23:34:23,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:34:23,936 INFO L225 Difference]: With dead ends: 31 [2022-11-25 23:34:23,937 INFO L226 Difference]: Without dead ends: 31 [2022-11-25 23:34:23,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:23,940 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:34:23,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 12 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:34:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-25 23:34:23,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-11-25 23:34:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.65) internal successors, (33), 30 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-11-25 23:34:23,952 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 3 [2022-11-25 23:34:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:34:23,953 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-11-25 23:34:23,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 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) [2022-11-25 23:34:23,954 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-11-25 23:34:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:34:23,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:34:23,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:34:23,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:34:23,955 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 23:34:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:34:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash 3726954, now seen corresponding path program 1 times [2022-11-25 23:34:23,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:34:23,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356977715] [2022-11-25 23:34:23,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:23,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:34:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:24,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:24,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:34:24,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356977715] [2022-11-25 23:34:24,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356977715] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:34:24,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:34:24,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:34:24,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939060697] [2022-11-25 23:34:24,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:34:24,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:34:24,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:34:24,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:34:24,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:24,085 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:24,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:34:24,136 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-11-25 23:34:24,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:34:24,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 23:34:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:34:24,137 INFO L225 Difference]: With dead ends: 28 [2022-11-25 23:34:24,137 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 23:34:24,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:24,141 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:34:24,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 9 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:34:24,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 23:34:24,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-25 23:34:24,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.5) internal successors, (30), 27 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) [2022-11-25 23:34:24,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-11-25 23:34:24,150 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 4 [2022-11-25 23:34:24,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:34:24,150 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-11-25 23:34:24,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:24,151 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-11-25 23:34:24,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-25 23:34:24,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:34:24,151 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-25 23:34:24,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:34:24,152 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 23:34:24,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:34:24,153 INFO L85 PathProgramCache]: Analyzing trace with hash 3726955, now seen corresponding path program 1 times [2022-11-25 23:34:24,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:34:24,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048617536] [2022-11-25 23:34:24,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:24,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:34:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:24,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:24,263 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:34:24,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048617536] [2022-11-25 23:34:24,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048617536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:34:24,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:34:24,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:34:24,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024707113] [2022-11-25 23:34:24,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:34:24,264 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:34:24,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:34:24,265 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:34:24,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:24,265 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:24,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:34:24,300 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-11-25 23:34:24,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:34:24,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-25 23:34:24,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:34:24,301 INFO L225 Difference]: With dead ends: 25 [2022-11-25 23:34:24,301 INFO L226 Difference]: Without dead ends: 25 [2022-11-25 23:34:24,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:24,303 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:34:24,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 9 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:34:24,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-11-25 23:34:24,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-11-25 23:34:24,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.35) internal successors, (27), 24 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) [2022-11-25 23:34:24,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-11-25 23:34:24,306 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 4 [2022-11-25 23:34:24,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:34:24,307 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-11-25 23:34:24,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:24,307 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-11-25 23:34:24,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:34:24,308 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:34:24,308 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:34:24,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:34:24,309 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 23:34:24,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:34:24,309 INFO L85 PathProgramCache]: Analyzing trace with hash 115535556, now seen corresponding path program 1 times [2022-11-25 23:34:24,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:34:24,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324595744] [2022-11-25 23:34:24,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:24,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:34:24,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:24,350 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:34:24,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324595744] [2022-11-25 23:34:24,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324595744] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:34:24,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:34:24,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:34:24,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806409226] [2022-11-25 23:34:24,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:34:24,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:34:24,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:34:24,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:34:24,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:24,353 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:24,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:34:24,389 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-11-25 23:34:24,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:34:24,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:34:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:34:24,390 INFO L225 Difference]: With dead ends: 23 [2022-11-25 23:34:24,390 INFO L226 Difference]: Without dead ends: 23 [2022-11-25 23:34:24,391 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:24,394 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:34:24,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 7 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:34:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-25 23:34:24,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-25 23:34:24,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.25) internal successors, (25), 22 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) [2022-11-25 23:34:24,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-11-25 23:34:24,399 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 5 [2022-11-25 23:34:24,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:34:24,399 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-11-25 23:34:24,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:24,400 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-11-25 23:34:24,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:34:24,400 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:34:24,400 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:34:24,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:34:24,401 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 23:34:24,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:34:24,401 INFO L85 PathProgramCache]: Analyzing trace with hash 115535557, now seen corresponding path program 1 times [2022-11-25 23:34:24,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:34:24,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552159507] [2022-11-25 23:34:24,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:24,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:34:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:24,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:24,508 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:34:24,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552159507] [2022-11-25 23:34:24,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552159507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:34:24,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:34:24,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:34:24,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187759341] [2022-11-25 23:34:24,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:34:24,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:34:24,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:34:24,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:34:24,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:24,511 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:24,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:34:24,543 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-11-25 23:34:24,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:34:24,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:34:24,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:34:24,546 INFO L225 Difference]: With dead ends: 21 [2022-11-25 23:34:24,546 INFO L226 Difference]: Without dead ends: 21 [2022-11-25 23:34:24,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:34:24,550 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:34:24,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 7 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:34:24,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-25 23:34:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-25 23:34:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-11-25 23:34:24,558 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 5 [2022-11-25 23:34:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:34:24,559 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-11-25 23:34:24,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-11-25 23:34:24,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-25 23:34:24,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:34:24,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:34:24,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:34:24,561 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-11-25 23:34:24,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:34:24,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1368380493, now seen corresponding path program 1 times [2022-11-25 23:34:24,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:34:24,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606098660] [2022-11-25 23:34:24,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:34:24,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:34:24,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:34:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:34:25,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:34:25,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606098660] [2022-11-25 23:34:25,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606098660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:34:25,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:34:25,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:34:25,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325750418] [2022-11-25 23:34:25,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:34:25,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:34:25,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:34:25,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:34:25,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:34:25,229 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:25,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:34:25,287 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-11-25 23:34:25,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:34:25,290 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-25 23:34:25,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:34:25,291 INFO L225 Difference]: With dead ends: 20 [2022-11-25 23:34:25,291 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 23:34:25,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:34:25,294 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 27 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:34:25,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 12 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:34:25,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 23:34:25,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 23:34:25,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:25,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 23:34:25,296 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2022-11-25 23:34:25,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:34:25,296 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 23:34:25,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:34:25,297 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 23:34:25,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 23:34:25,300 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 31 remaining) [2022-11-25 23:34:25,300 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2022-11-25 23:34:25,301 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2022-11-25 23:34:25,301 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2022-11-25 23:34:25,301 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2022-11-25 23:34:25,302 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2022-11-25 23:34:25,303 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2022-11-25 23:34:25,303 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2022-11-25 23:34:25,303 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2022-11-25 23:34:25,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2022-11-25 23:34:25,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2022-11-25 23:34:25,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2022-11-25 23:34:25,304 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2022-11-25 23:34:25,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2022-11-25 23:34:25,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2022-11-25 23:34:25,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2022-11-25 23:34:25,305 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2022-11-25 23:34:25,306 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2022-11-25 23:34:25,306 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2022-11-25 23:34:25,306 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2022-11-25 23:34:25,306 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2022-11-25 23:34:25,307 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2022-11-25 23:34:25,307 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2022-11-25 23:34:25,307 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2022-11-25 23:34:25,307 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2022-11-25 23:34:25,308 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2022-11-25 23:34:25,308 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2022-11-25 23:34:25,308 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2022-11-25 23:34:25,308 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2022-11-25 23:34:25,309 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2022-11-25 23:34:25,309 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (0 of 31 remaining) [2022-11-25 23:34:25,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 23:34:25,313 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:34:25,316 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 23:34:25,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 11:34:25 BoogieIcfgContainer [2022-11-25 23:34:25,320 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 23:34:25,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 23:34:25,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 23:34:25,321 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 23:34:25,321 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:34:22" (3/4) ... [2022-11-25 23:34:25,325 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 23:34:25,337 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-25 23:34:25,337 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2022-11-25 23:34:25,338 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 23:34:25,338 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 23:34:25,377 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-25 23:34:25,377 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 23:34:25,378 INFO L158 Benchmark]: Toolchain (without parser) took 4623.21ms. Allocated memory was 161.5MB in the beginning and 220.2MB in the end (delta: 58.7MB). Free memory was 115.0MB in the beginning and 95.1MB in the end (delta: 19.9MB). Peak memory consumption was 80.3MB. Max. memory is 16.1GB. [2022-11-25 23:34:25,378 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory is still 58.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:34:25,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 508.39ms. Allocated memory is still 161.5MB. Free memory was 114.6MB in the beginning and 99.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 23:34:25,379 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.16ms. Allocated memory is still 161.5MB. Free memory was 99.0MB in the beginning and 97.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:34:25,380 INFO L158 Benchmark]: Boogie Preprocessor took 27.07ms. Allocated memory is still 161.5MB. Free memory was 97.0MB in the beginning and 95.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 23:34:25,380 INFO L158 Benchmark]: RCFGBuilder took 671.60ms. Allocated memory was 161.5MB in the beginning and 220.2MB in the end (delta: 58.7MB). Free memory was 95.7MB in the beginning and 184.4MB in the end (delta: -88.6MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. [2022-11-25 23:34:25,380 INFO L158 Benchmark]: TraceAbstraction took 3305.43ms. Allocated memory is still 220.2MB. Free memory was 183.3MB in the beginning and 98.3MB in the end (delta: 85.0MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. [2022-11-25 23:34:25,381 INFO L158 Benchmark]: Witness Printer took 57.42ms. Allocated memory is still 220.2MB. Free memory was 98.3MB in the beginning and 95.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 23:34:25,383 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.30ms. Allocated memory is still 109.1MB. Free memory is still 58.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 508.39ms. Allocated memory is still 161.5MB. Free memory was 114.6MB in the beginning and 99.0MB in the end (delta: 15.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.16ms. Allocated memory is still 161.5MB. Free memory was 99.0MB in the beginning and 97.0MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.07ms. Allocated memory is still 161.5MB. Free memory was 97.0MB in the beginning and 95.7MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 671.60ms. Allocated memory was 161.5MB in the beginning and 220.2MB in the end (delta: 58.7MB). Free memory was 95.7MB in the beginning and 184.4MB in the end (delta: -88.6MB). Peak memory consumption was 20.4MB. Max. memory is 16.1GB. * TraceAbstraction took 3305.43ms. Allocated memory is still 220.2MB. Free memory was 183.3MB in the beginning and 98.3MB in the end (delta: 85.0MB). Peak memory consumption was 85.0MB. Max. memory is 16.1GB. * Witness Printer took 57.42ms. Allocated memory is still 220.2MB. Free memory was 98.3MB in the beginning and 95.1MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 565]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 266 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 266 mSDsluCounter, 102 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 22 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 219 IncrementalHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 22 mSolverCounterUnsat, 96 mSDtfsCounter, 219 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 30 ConstructedInterpolants, 0 QuantifiedInterpolants, 534 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-25 23:34:25,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_530f6760-5edf-498b-880b-3f90066fc880/bin/utaipan-ByfvJB40ur/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 Result: TRUE