./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/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_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lh-reducer.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/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 32bit --witnessprinter.graph.data.programhash 9e5c7c8f34d0399e1ec13072e237ea7df9536407415bc8e3ff2e61c34b30de96 --- 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-26 00:52:55,129 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:52:55,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:52:55,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:52:55,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:52:55,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:52:55,171 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:52:55,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:52:55,178 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:52:55,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:52:55,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:52:55,188 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:52:55,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:52:55,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:52:55,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:52:55,196 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:52:55,198 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:52:55,199 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:52:55,201 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:52:55,208 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:52:55,210 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:52:55,212 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:52:55,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:52:55,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:52:55,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:52:55,226 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:52:55,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:52:55,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:52:55,228 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:52:55,229 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:52:55,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:52:55,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:52:55,233 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:52:55,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:52:55,237 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:52:55,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:52:55,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:52:55,239 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:52:55,239 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:52:55,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:52:55,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:52:55,242 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2022-11-26 00:52:55,281 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:52:55,284 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:52:55,285 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:52:55,285 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:52:55,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:52:55,287 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:52:55,287 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:52:55,287 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:52:55,287 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:52:55,288 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:52:55,289 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:52:55,289 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:52:55,289 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:52:55,289 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:52:55,290 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:52:55,290 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:52:55,290 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:52:55,290 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:52:55,292 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-26 00:52:55,292 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-26 00:52:55,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:52:55,292 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-26 00:52:55,293 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:52:55,293 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:52:55,293 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-26 00:52:55,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:52:55,294 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-26 00:52:55,294 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-26 00:52:55,294 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-26 00:52:55,295 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:52:55,295 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 00:52:55,295 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-26 00:52:55,295 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:52:55,296 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:52:55,296 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:52:55,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:52:55,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:52:55,297 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:52:55,297 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:52:55,297 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:52:55,297 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:52:55,297 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:52:55,298 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_a376cde6-9587-454f-9781-0935f9f407c9/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_a376cde6-9587-454f-9781-0935f9f407c9/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9e5c7c8f34d0399e1ec13072e237ea7df9536407415bc8e3ff2e61c34b30de96 [2022-11-26 00:52:55,623 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:52:55,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:52:55,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:52:55,667 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:52:55,668 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:52:55,669 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lh-reducer.c [2022-11-26 00:52:58,787 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:52:59,102 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:52:59,105 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lh-reducer.c [2022-11-26 00:52:59,117 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/data/2c48454cb/0b5eb7912f9644b28797490a729dbb15/FLAG8545a4d30 [2022-11-26 00:52:59,136 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/data/2c48454cb/0b5eb7912f9644b28797490a729dbb15 [2022-11-26 00:52:59,142 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:52:59,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:52:59,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:52:59,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:52:59,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:52:59,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:52:59" (1/1) ... [2022-11-26 00:52:59,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22364a70 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:59, skipping insertion in model container [2022-11-26 00:52:59,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:52:59" (1/1) ... [2022-11-26 00:52:59,160 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:52:59,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:52:59,420 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lh-reducer.c[8507,8520] [2022-11-26 00:52:59,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:52:59,437 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:52:59,543 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/sv-benchmarks/c/loop-industry-pattern/aiob_4.c.v+lh-reducer.c[8507,8520] [2022-11-26 00:52:59,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:52:59,561 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:52:59,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:59 WrapperNode [2022-11-26 00:52:59,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:52:59,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:52:59,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:52:59,563 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:52:59,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:59" (1/1) ... [2022-11-26 00:52:59,585 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:59" (1/1) ... [2022-11-26 00:52:59,625 INFO L138 Inliner]: procedures = 17, calls = 203, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 373 [2022-11-26 00:52:59,626 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:52:59,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:52:59,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:52:59,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:52:59,637 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:59" (1/1) ... [2022-11-26 00:52:59,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:59" (1/1) ... [2022-11-26 00:52:59,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:59" (1/1) ... [2022-11-26 00:52:59,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:59" (1/1) ... [2022-11-26 00:52:59,666 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:59" (1/1) ... [2022-11-26 00:52:59,669 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:59" (1/1) ... [2022-11-26 00:52:59,671 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:59" (1/1) ... [2022-11-26 00:52:59,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:59" (1/1) ... [2022-11-26 00:52:59,678 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:52:59,679 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:52:59,679 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:52:59,679 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:52:59,680 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:59" (1/1) ... [2022-11-26 00:52:59,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:52:59,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:52:59,717 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:52:59,739 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:52:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-26 00:52:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure fopen [2022-11-26 00:52:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:52:59,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:52:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 00:52:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:52:59,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:52:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 00:52:59,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 00:52:59,890 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:52:59,892 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:53:00,766 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:53:00,878 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:53:00,879 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-26 00:53:00,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:53:00 BoogieIcfgContainer [2022-11-26 00:53:00,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:53:00,884 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:53:00,884 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:53:00,888 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:53:00,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:52:59" (1/3) ... [2022-11-26 00:53:00,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c72e953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:53:00, skipping insertion in model container [2022-11-26 00:53:00,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:52:59" (2/3) ... [2022-11-26 00:53:00,890 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c72e953 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:53:00, skipping insertion in model container [2022-11-26 00:53:00,890 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:53:00" (3/3) ... [2022-11-26 00:53:00,891 INFO L112 eAbstractionObserver]: Analyzing ICFG aiob_4.c.v+lh-reducer.c [2022-11-26 00:53:00,915 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:53:00,915 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 86 error locations. [2022-11-26 00:53:00,989 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:53:00,997 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;@5700a172, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:53:00,998 INFO L358 AbstractCegarLoop]: Starting to check reachability of 86 error locations. [2022-11-26 00:53:01,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 52 states have (on average 2.769230769230769) internal successors, (144), 138 states have internal predecessors, (144), 0 states have call successors, (0), 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-26 00:53:01,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:53:01,013 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:01,014 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:53:01,015 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-26 00:53:01,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:01,024 INFO L85 PathProgramCache]: Analyzing trace with hash 233883, now seen corresponding path program 1 times [2022-11-26 00:53:01,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:01,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083269047] [2022-11-26 00:53:01,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:01,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:01,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:01,331 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-26 00:53:01,332 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:01,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083269047] [2022-11-26 00:53:01,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083269047] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:01,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:01,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:53:01,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475230538] [2022-11-26 00:53:01,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:01,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:53:01,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:01,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:53:01,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:53:01,385 INFO L87 Difference]: Start difference. First operand has 139 states, 52 states have (on average 2.769230769230769) internal successors, (144), 138 states have internal predecessors, (144), 0 states have call successors, (0), 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 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:01,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:01,693 INFO L93 Difference]: Finished difference Result 140 states and 143 transitions. [2022-11-26 00:53:01,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:53:01,695 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-26 00:53:01,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:01,707 INFO L225 Difference]: With dead ends: 140 [2022-11-26 00:53:01,707 INFO L226 Difference]: Without dead ends: 138 [2022-11-26 00:53:01,709 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:53:01,713 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 124 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:01,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 115 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:53:01,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-11-26 00:53:01,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-11-26 00:53:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 52 states have (on average 2.6923076923076925) internal successors, (140), 137 states have internal predecessors, (140), 0 states have call successors, (0), 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-26 00:53:01,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 140 transitions. [2022-11-26 00:53:01,756 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 140 transitions. Word has length 3 [2022-11-26 00:53:01,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:01,757 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 140 transitions. [2022-11-26 00:53:01,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:01,758 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 140 transitions. [2022-11-26 00:53:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:53:01,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:01,758 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:53:01,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:53:01,759 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-26 00:53:01,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:01,760 INFO L85 PathProgramCache]: Analyzing trace with hash 233749, now seen corresponding path program 1 times [2022-11-26 00:53:01,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:01,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055783608] [2022-11-26 00:53:01,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:01,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:01,840 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-26 00:53:01,840 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:01,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055783608] [2022-11-26 00:53:01,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055783608] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:01,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:01,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:53:01,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502745669] [2022-11-26 00:53:01,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:01,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:53:01,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:01,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:53:01,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:53:01,844 INFO L87 Difference]: Start difference. First operand 138 states and 140 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:02,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:02,093 INFO L93 Difference]: Finished difference Result 97 states and 99 transitions. [2022-11-26 00:53:02,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:53:02,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-26 00:53:02,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:02,095 INFO L225 Difference]: With dead ends: 97 [2022-11-26 00:53:02,095 INFO L226 Difference]: Without dead ends: 97 [2022-11-26 00:53:02,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:53:02,097 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 185 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:02,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 10 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:53:02,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-11-26 00:53:02,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-11-26 00:53:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 52 states have (on average 1.9038461538461537) internal successors, (99), 96 states have internal predecessors, (99), 0 states have call successors, (0), 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-26 00:53:02,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2022-11-26 00:53:02,105 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 3 [2022-11-26 00:53:02,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:02,106 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2022-11-26 00:53:02,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:02,106 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2022-11-26 00:53:02,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 00:53:02,107 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:02,107 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 00:53:02,107 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:53:02,108 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-26 00:53:02,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:02,108 INFO L85 PathProgramCache]: Analyzing trace with hash 233750, now seen corresponding path program 1 times [2022-11-26 00:53:02,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:02,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427230574] [2022-11-26 00:53:02,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:02,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:02,291 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-26 00:53:02,292 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:02,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427230574] [2022-11-26 00:53:02,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427230574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:02,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:02,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:53:02,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285946252] [2022-11-26 00:53:02,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:02,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:53:02,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:02,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:53:02,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:53:02,297 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:02,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:02,530 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-11-26 00:53:02,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:53:02,532 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-26 00:53:02,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:02,532 INFO L225 Difference]: With dead ends: 56 [2022-11-26 00:53:02,532 INFO L226 Difference]: Without dead ends: 56 [2022-11-26 00:53:02,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:53:02,534 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 96 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:02,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 23 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:53:02,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-26 00:53:02,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-26 00:53:02,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 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-26 00:53:02,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-11-26 00:53:02,539 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 3 [2022-11-26 00:53:02,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:02,539 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-11-26 00:53:02,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 00:53:02,540 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-11-26 00:53:02,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-26 00:53:02,541 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:02,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:02,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:53:02,542 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-26 00:53:02,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:02,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2091433265, now seen corresponding path program 1 times [2022-11-26 00:53:02,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:02,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866987832] [2022-11-26 00:53:02,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:02,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:02,945 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-26 00:53:02,946 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:02,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866987832] [2022-11-26 00:53:02,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866987832] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:02,946 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:02,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:53:02,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742315809] [2022-11-26 00:53:02,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:02,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:53:02,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:02,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:53:02,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:53:02,951 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-26 00:53:03,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:03,100 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2022-11-26 00:53:03,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:53:03,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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) Word has length 48 [2022-11-26 00:53:03,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:03,102 INFO L225 Difference]: With dead ends: 67 [2022-11-26 00:53:03,102 INFO L226 Difference]: Without dead ends: 67 [2022-11-26 00:53:03,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:53:03,104 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 61 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:03,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 37 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:53:03,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-26 00:53:03,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 59. [2022-11-26 00:53:03,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 58 states have internal predecessors, (61), 0 states have call successors, (0), 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-26 00:53:03,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 61 transitions. [2022-11-26 00:53:03,115 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 61 transitions. Word has length 48 [2022-11-26 00:53:03,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:03,116 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 61 transitions. [2022-11-26 00:53:03,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 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-26 00:53:03,116 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 61 transitions. [2022-11-26 00:53:03,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-26 00:53:03,117 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:03,118 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:03,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:53:03,118 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-26 00:53:03,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:03,119 INFO L85 PathProgramCache]: Analyzing trace with hash -2091448138, now seen corresponding path program 1 times [2022-11-26 00:53:03,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:03,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795824641] [2022-11-26 00:53:03,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:03,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:03,343 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-26 00:53:03,343 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:03,343 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795824641] [2022-11-26 00:53:03,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795824641] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:03,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:03,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:53:03,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412722364] [2022-11-26 00:53:03,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:03,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:53:03,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:03,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:53:03,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:53:03,347 INFO L87 Difference]: Start difference. First operand 59 states and 61 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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-26 00:53:03,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:03,458 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-11-26 00:53:03,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:53:03,460 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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) Word has length 48 [2022-11-26 00:53:03,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:03,461 INFO L225 Difference]: With dead ends: 59 [2022-11-26 00:53:03,461 INFO L226 Difference]: Without dead ends: 59 [2022-11-26 00:53:03,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-26 00:53:03,462 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 13 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:03,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 20 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:53:03,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-26 00:53:03,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-26 00:53:03,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 58 states have internal predecessors, (60), 0 states have call successors, (0), 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-26 00:53:03,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2022-11-26 00:53:03,468 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 48 [2022-11-26 00:53:03,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:03,468 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2022-11-26 00:53:03,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 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-26 00:53:03,469 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-11-26 00:53:03,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-26 00:53:03,470 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:03,470 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:03,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:53:03,471 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-26 00:53:03,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:03,472 INFO L85 PathProgramCache]: Analyzing trace with hash -2091448095, now seen corresponding path program 1 times [2022-11-26 00:53:03,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:03,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318310557] [2022-11-26 00:53:03,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:03,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:03,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:03,734 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-26 00:53:03,734 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:03,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318310557] [2022-11-26 00:53:03,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318310557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:03,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:03,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:53:03,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055628578] [2022-11-26 00:53:03,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:03,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:53:03,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:03,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:53:03,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:53:03,738 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 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-26 00:53:03,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:03,871 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-11-26 00:53:03,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:53:03,872 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 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) Word has length 48 [2022-11-26 00:53:03,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:03,873 INFO L225 Difference]: With dead ends: 58 [2022-11-26 00:53:03,873 INFO L226 Difference]: Without dead ends: 58 [2022-11-26 00:53:03,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:53:03,874 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:03,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 17 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:53:03,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-26 00:53:03,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-26 00:53:03,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.0727272727272728) internal successors, (59), 57 states have internal predecessors, (59), 0 states have call successors, (0), 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-26 00:53:03,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2022-11-26 00:53:03,878 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 48 [2022-11-26 00:53:03,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:03,878 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2022-11-26 00:53:03,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 16.0) internal successors, (48), 4 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-26 00:53:03,879 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2022-11-26 00:53:03,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-26 00:53:03,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:03,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:03,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:53:03,881 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-26 00:53:03,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:03,881 INFO L85 PathProgramCache]: Analyzing trace with hash -2091448094, now seen corresponding path program 1 times [2022-11-26 00:53:03,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:03,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447499901] [2022-11-26 00:53:03,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:03,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:04,326 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-26 00:53:04,326 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:04,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447499901] [2022-11-26 00:53:04,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447499901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:04,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:04,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:53:04,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681634200] [2022-11-26 00:53:04,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:04,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:53:04,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:04,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:53:04,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:53:04,329 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 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-26 00:53:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:04,578 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2022-11-26 00:53:04,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-26 00:53:04,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 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) Word has length 48 [2022-11-26 00:53:04,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:04,580 INFO L225 Difference]: With dead ends: 59 [2022-11-26 00:53:04,580 INFO L226 Difference]: Without dead ends: 59 [2022-11-26 00:53:04,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:53:04,581 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:04,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:53:04,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-26 00:53:04,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 57. [2022-11-26 00:53:04,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 55 states have (on average 1.0545454545454545) internal successors, (58), 56 states have internal predecessors, (58), 0 states have call successors, (0), 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-26 00:53:04,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-11-26 00:53:04,585 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 48 [2022-11-26 00:53:04,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:04,586 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-11-26 00:53:04,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 12.0) internal successors, (48), 5 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-26 00:53:04,586 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-11-26 00:53:04,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-26 00:53:04,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:04,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:04,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:53:04,588 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-26 00:53:04,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:04,589 INFO L85 PathProgramCache]: Analyzing trace with hash 163080429, now seen corresponding path program 1 times [2022-11-26 00:53:04,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:04,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388860430] [2022-11-26 00:53:04,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:04,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:05,238 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-26 00:53:05,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:05,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388860430] [2022-11-26 00:53:05,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388860430] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:53:05,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:53:05,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 00:53:05,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471831180] [2022-11-26 00:53:05,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:53:05,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 00:53:05,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:53:05,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 00:53:05,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:53:05,242 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 6 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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-26 00:53:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:53:05,403 INFO L93 Difference]: Finished difference Result 56 states and 57 transitions. [2022-11-26 00:53:05,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:53:05,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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 50 [2022-11-26 00:53:05,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:53:05,405 INFO L225 Difference]: With dead ends: 56 [2022-11-26 00:53:05,405 INFO L226 Difference]: Without dead ends: 55 [2022-11-26 00:53:05,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-26 00:53:05,406 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 9 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:53:05,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 21 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:53:05,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-26 00:53:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-26 00:53:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.0185185185185186) internal successors, (55), 54 states have internal predecessors, (55), 0 states have call successors, (0), 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-26 00:53:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2022-11-26 00:53:05,410 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 50 [2022-11-26 00:53:05,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:53:05,410 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2022-11-26 00:53:05,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 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-26 00:53:05,411 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2022-11-26 00:53:05,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-11-26 00:53:05,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:53:05,412 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:53:05,412 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:53:05,412 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-26 00:53:05,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:53:05,413 INFO L85 PathProgramCache]: Analyzing trace with hash 796293954, now seen corresponding path program 1 times [2022-11-26 00:53:05,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:53:05,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795050916] [2022-11-26 00:53:05,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:05,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:53:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:05,682 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:05,682 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:53:05,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795050916] [2022-11-26 00:53:05,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795050916] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:53:05,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681007984] [2022-11-26 00:53:05,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:53:05,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:53:05,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:53:05,687 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:53:05,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:53:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:53:06,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-26 00:53:06,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:53:06,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:06,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:53:06,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:53:06,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681007984] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:53:06,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [342558573] [2022-11-26 00:53:06,277 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-26 00:53:06,278 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:53:06,282 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:53:06,289 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:53:06,290 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:53:06,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:06,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:06,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:06,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:06,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:06,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:06,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2022-11-26 00:53:06,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:53:06,588 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:53:06,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-26 00:53:06,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-26 00:53:06,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-26 00:53:06,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-26 00:53:06,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-26 00:53:06,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-26 00:53:07,051 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-26 00:53:07,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-26 00:53:07,188 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-11-26 00:53:07,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-11-26 00:53:07,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2022-11-26 00:53:07,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2022-11-26 00:53:07,544 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 62 [2022-11-26 00:53:07,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 62 [2022-11-26 00:53:07,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 70 [2022-11-26 00:53:07,770 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 70 [2022-11-26 00:53:07,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 78 [2022-11-26 00:53:07,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 78 [2022-11-26 00:53:08,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 86 [2022-11-26 00:53:08,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 86 [2022-11-26 00:53:08,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-11-26 00:53:08,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-11-26 00:53:08,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2022-11-26 00:53:08,717 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2022-11-26 00:53:08,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 110 [2022-11-26 00:53:08,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 110 [2022-11-26 00:53:09,101 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 105 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 118 [2022-11-26 00:53:09,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 105 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 118 [2022-11-26 00:53:09,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 15 select indices, 15 select index equivalence classes, 120 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 126 [2022-11-26 00:53:09,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 15 select indices, 15 select index equivalence classes, 120 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 126 [2022-11-26 00:53:09,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 16 select indices, 16 select index equivalence classes, 136 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 134 [2022-11-26 00:53:09,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 16 select indices, 16 select index equivalence classes, 136 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 134 [2022-11-26 00:53:09,883 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 17 select indices, 17 select index equivalence classes, 153 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 142 [2022-11-26 00:53:09,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 17 select indices, 17 select index equivalence classes, 153 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 142 [2022-11-26 00:53:10,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 18 select indices, 18 select index equivalence classes, 171 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 150 [2022-11-26 00:53:10,237 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 18 select indices, 18 select index equivalence classes, 171 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 150 [2022-11-26 00:53:10,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 19 select indices, 19 select index equivalence classes, 190 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 158 [2022-11-26 00:53:10,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 19 select indices, 19 select index equivalence classes, 190 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 158 [2022-11-26 00:53:10,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 20 select indices, 20 select index equivalence classes, 210 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 166 [2022-11-26 00:53:10,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 20 select indices, 20 select index equivalence classes, 210 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 166 [2022-11-26 00:53:11,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 21 select indices, 21 select index equivalence classes, 231 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 174 [2022-11-26 00:53:11,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 21 select indices, 21 select index equivalence classes, 231 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 174 [2022-11-26 00:53:11,337 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 22 select indices, 22 select index equivalence classes, 253 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 182 [2022-11-26 00:53:11,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 22 select indices, 22 select index equivalence classes, 253 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 182 [2022-11-26 00:53:11,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 23 select indices, 23 select index equivalence classes, 276 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 190 [2022-11-26 00:53:11,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 23 select indices, 23 select index equivalence classes, 276 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 190 [2022-11-26 00:53:11,994 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 24 select indices, 24 select index equivalence classes, 300 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 198 [2022-11-26 00:53:12,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 24 select indices, 24 select index equivalence classes, 300 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 198 [2022-11-26 00:53:12,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 25 select indices, 25 select index equivalence classes, 325 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 206 [2022-11-26 00:53:12,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 25 select indices, 25 select index equivalence classes, 325 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 206 [2022-11-26 00:53:12,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 26 select indices, 26 select index equivalence classes, 351 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 214 [2022-11-26 00:53:12,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 26 select indices, 26 select index equivalence classes, 351 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 214 [2022-11-26 00:53:13,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 27 select indices, 27 select index equivalence classes, 378 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 222 [2022-11-26 00:53:13,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 27 select indices, 27 select index equivalence classes, 378 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 222 [2022-11-26 00:53:13,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 28 select indices, 28 select index equivalence classes, 406 disjoint index pairs (out of 378 index pairs), introduced 28 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 230 [2022-11-26 00:53:13,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 28 select indices, 28 select index equivalence classes, 406 disjoint index pairs (out of 378 index pairs), introduced 28 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 230 [2022-11-26 00:53:13,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 29 select indices, 29 select index equivalence classes, 435 disjoint index pairs (out of 406 index pairs), introduced 29 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 238 [2022-11-26 00:53:14,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 29 select indices, 29 select index equivalence classes, 435 disjoint index pairs (out of 406 index pairs), introduced 29 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 238 [2022-11-26 00:53:14,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 30 select indices, 30 select index equivalence classes, 465 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 246 [2022-11-26 00:53:14,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 30 select indices, 30 select index equivalence classes, 465 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 246 [2022-11-26 00:53:14,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 31 select indices, 31 select index equivalence classes, 496 disjoint index pairs (out of 465 index pairs), introduced 31 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 254 [2022-11-26 00:53:14,890 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 31 select indices, 31 select index equivalence classes, 496 disjoint index pairs (out of 465 index pairs), introduced 31 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 254 [2022-11-26 00:53:15,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 32 select indices, 32 select index equivalence classes, 528 disjoint index pairs (out of 496 index pairs), introduced 32 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 262 [2022-11-26 00:53:15,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 32 select indices, 32 select index equivalence classes, 528 disjoint index pairs (out of 496 index pairs), introduced 32 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 262 [2022-11-26 00:53:15,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 33 select indices, 33 select index equivalence classes, 561 disjoint index pairs (out of 528 index pairs), introduced 33 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 270 [2022-11-26 00:53:15,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 33 select indices, 33 select index equivalence classes, 561 disjoint index pairs (out of 528 index pairs), introduced 33 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 270 [2022-11-26 00:53:16,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 34 select indices, 34 select index equivalence classes, 595 disjoint index pairs (out of 561 index pairs), introduced 34 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 278 [2022-11-26 00:53:16,267 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 34 select indices, 34 select index equivalence classes, 595 disjoint index pairs (out of 561 index pairs), introduced 34 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 278 [2022-11-26 00:53:16,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 35 select indices, 35 select index equivalence classes, 630 disjoint index pairs (out of 595 index pairs), introduced 35 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 286 [2022-11-26 00:53:16,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 35 select indices, 35 select index equivalence classes, 630 disjoint index pairs (out of 595 index pairs), introduced 35 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 286 [2022-11-26 00:53:16,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 36 select indices, 36 select index equivalence classes, 666 disjoint index pairs (out of 630 index pairs), introduced 36 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 294 [2022-11-26 00:53:17,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 36 select indices, 36 select index equivalence classes, 666 disjoint index pairs (out of 630 index pairs), introduced 36 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 294 [2022-11-26 00:53:17,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 37 select indices, 37 select index equivalence classes, 703 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 302 [2022-11-26 00:53:17,548 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 37 select indices, 37 select index equivalence classes, 703 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 302 [2022-11-26 00:53:18,019 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 38 select indices, 38 select index equivalence classes, 741 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 310 [2022-11-26 00:53:18,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 38 select indices, 38 select index equivalence classes, 741 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 310 [2022-11-26 00:53:18,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 39 select indices, 39 select index equivalence classes, 780 disjoint index pairs (out of 741 index pairs), introduced 39 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 318 [2022-11-26 00:53:18,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 39 select indices, 39 select index equivalence classes, 780 disjoint index pairs (out of 741 index pairs), introduced 39 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 318 [2022-11-26 00:53:19,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:19,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:19,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:19,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:19,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:19,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:19,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:19,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:19,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:19,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:19,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:19,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:19,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:53:19,231 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 30 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 67 [2022-11-26 00:53:19,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 40 select indices, 40 select index equivalence classes, 820 disjoint index pairs (out of 780 index pairs), introduced 40 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 570 [2022-11-26 00:53:19,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 40 select indices, 40 select index equivalence classes, 820 disjoint index pairs (out of 780 index pairs), introduced 40 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 570 [2022-11-26 00:53:22,567 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:55:05,835 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1686#(and (<= 0 |ULTIMATE.start_main_~__tmp_1~0#1.offset|) (<= 0 ~Id_MCDC_93~0) (<= 0 |ULTIMATE.start_main_~__tmp_1~0#1.base|) (<= 0 |ULTIMATE.start_main_~#main__Id_MCDC_119~0#1.base|) (<= |ULTIMATE.start_main_~__tmp_1~0#1.offset| 0) (not (< (mod ~Id_MCDC_93~0 4294967296) 42)) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89__Id_MCDC_96~0#1|) (<= 0 |ULTIMATE.start_main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset|) (<= 0 |ULTIMATE.start_main_~#Id_MCDC_89__Id_MCDC_95~0#1.base|) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89__Id_MCDC_88~0#1.base|) (= |ULTIMATE.start_main_~main__Id_MCDC_116~0#1| 0) (<= 0 |ULTIMATE.start_main_~#main__Id_MCDC_119~0#1.offset|) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89__Id_MCDC_88~0#1.offset|) (= |ULTIMATE.start_main_~main__Id_MCDC_115~0#1| 0) (<= |ULTIMATE.start_main_~Id_MCDC_89__Id_MCDC_88~0#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~1#1| |ULTIMATE.start_main_~__tmp_3~0#1|) (= |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~1#1| 0) (<= |ULTIMATE.start_main_~#main__Id_MCDC_119~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~0#1| 0) (= ~__return_main~0 0) (<= |ULTIMATE.start_main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-26 00:55:05,835 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:55:05,836 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:55:05,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-11-26 00:55:05,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802847336] [2022-11-26 00:55:05,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:55:05,837 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-26 00:55:05,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:55:05,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-26 00:55:05,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1071, Invalid=2121, Unknown=0, NotChecked=0, Total=3192 [2022-11-26 00:55:05,840 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 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-26 00:55:06,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:55:06,147 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2022-11-26 00:55:06,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-26 00:55:06,148 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 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 54 [2022-11-26 00:55:06,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:55:06,149 INFO L225 Difference]: With dead ends: 76 [2022-11-26 00:55:06,149 INFO L226 Difference]: Without dead ends: 76 [2022-11-26 00:55:06,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 106 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 846 ImplicationChecksByTransitivity, 103.4s TimeCoverageRelationStatistics Valid=1120, Invalid=2786, Unknown=0, NotChecked=0, Total=3906 [2022-11-26 00:55:06,152 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 126 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 00:55:06,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 33 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 00:55:06,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-26 00:55:06,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2022-11-26 00:55:06,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.0138888888888888) internal successors, (73), 72 states have internal predecessors, (73), 0 states have call successors, (0), 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-26 00:55:06,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2022-11-26 00:55:06,162 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 54 [2022-11-26 00:55:06,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:55:06,162 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2022-11-26 00:55:06,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 0 states have call successors, (0), 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-26 00:55:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2022-11-26 00:55:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-11-26 00:55:06,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:55:06,164 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:55:06,176 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-26 00:55:06,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:55:06,372 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 83 more)] === [2022-11-26 00:55:06,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:55:06,372 INFO L85 PathProgramCache]: Analyzing trace with hash -1746233573, now seen corresponding path program 2 times [2022-11-26 00:55:06,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:55:06,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424329535] [2022-11-26 00:55:06,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:55:06,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:55:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:55:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:55:06,827 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:55:06,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424329535] [2022-11-26 00:55:06,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424329535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:55:06,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240757762] [2022-11-26 00:55:06,828 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 00:55:06,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:55:06,829 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:55:06,830 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:55:06,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:55:07,463 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 00:55:07,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 00:55:07,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-26 00:55:07,473 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:55:07,616 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 00:55:07,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 19 [2022-11-26 00:55:07,766 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-26 00:55:07,766 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:55:08,718 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-26 00:55:08,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240757762] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:55:08,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1219445375] [2022-11-26 00:55:08,725 INFO L159 IcfgInterpreter]: Started Sifa with 52 locations of interest [2022-11-26 00:55:08,725 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:55:08,726 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:55:08,726 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:55:08,726 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:55:08,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:08,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:08,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:08,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:08,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:08,780 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:08,781 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 22 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2022-11-26 00:55:08,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:55:08,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-26 00:55:08,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-26 00:55:08,899 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-11-26 00:55:08,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-26 00:55:08,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-26 00:55:09,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-26 00:55:09,058 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 30 [2022-11-26 00:55:09,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-26 00:55:09,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 38 [2022-11-26 00:55:09,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-11-26 00:55:09,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 46 [2022-11-26 00:55:09,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2022-11-26 00:55:09,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 54 [2022-11-26 00:55:09,422 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 62 [2022-11-26 00:55:09,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 62 [2022-11-26 00:55:09,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 70 [2022-11-26 00:55:09,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 70 [2022-11-26 00:55:09,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 78 [2022-11-26 00:55:09,724 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 9 select indices, 9 select index equivalence classes, 45 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 78 [2022-11-26 00:55:09,812 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 86 [2022-11-26 00:55:09,852 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 10 select indices, 10 select index equivalence classes, 55 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 86 [2022-11-26 00:55:09,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-11-26 00:55:10,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 11 select indices, 11 select index equivalence classes, 66 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 94 [2022-11-26 00:55:10,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2022-11-26 00:55:10,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 12 select indices, 12 select index equivalence classes, 78 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 102 [2022-11-26 00:55:10,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 110 [2022-11-26 00:55:10,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 13 select indices, 13 select index equivalence classes, 91 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 110 [2022-11-26 00:55:10,472 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 105 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 118 [2022-11-26 00:55:10,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 14 select indices, 14 select index equivalence classes, 105 disjoint index pairs (out of 91 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 118 [2022-11-26 00:55:10,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 15 select indices, 15 select index equivalence classes, 120 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 126 [2022-11-26 00:55:10,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 15 select indices, 15 select index equivalence classes, 120 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 126 [2022-11-26 00:55:10,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 16 select indices, 16 select index equivalence classes, 136 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 134 [2022-11-26 00:55:10,965 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 16 select indices, 16 select index equivalence classes, 136 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 134 [2022-11-26 00:55:11,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 17 select indices, 17 select index equivalence classes, 153 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 142 [2022-11-26 00:55:11,161 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 17 select indices, 17 select index equivalence classes, 153 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 142 [2022-11-26 00:55:11,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 18 select indices, 18 select index equivalence classes, 171 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 150 [2022-11-26 00:55:11,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 18 select indices, 18 select index equivalence classes, 171 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 150 [2022-11-26 00:55:11,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 19 select indices, 19 select index equivalence classes, 190 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 158 [2022-11-26 00:55:11,665 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 19 select indices, 19 select index equivalence classes, 190 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 158 [2022-11-26 00:55:11,853 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 20 select indices, 20 select index equivalence classes, 210 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 166 [2022-11-26 00:55:11,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 20 select indices, 20 select index equivalence classes, 210 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 166 [2022-11-26 00:55:12,124 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 21 select indices, 21 select index equivalence classes, 231 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 174 [2022-11-26 00:55:12,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 21 select indices, 21 select index equivalence classes, 231 disjoint index pairs (out of 210 index pairs), introduced 21 new quantified variables, introduced 0 case distinctions, treesize of input 112 treesize of output 174 [2022-11-26 00:55:12,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 22 select indices, 22 select index equivalence classes, 253 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 182 [2022-11-26 00:55:12,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 22 select indices, 22 select index equivalence classes, 253 disjoint index pairs (out of 231 index pairs), introduced 22 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 182 [2022-11-26 00:55:12,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 23 select indices, 23 select index equivalence classes, 276 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 190 [2022-11-26 00:55:12,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 23 select indices, 23 select index equivalence classes, 276 disjoint index pairs (out of 253 index pairs), introduced 23 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 190 [2022-11-26 00:55:13,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 24 select indices, 24 select index equivalence classes, 300 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 198 [2022-11-26 00:55:13,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 24 select indices, 24 select index equivalence classes, 300 disjoint index pairs (out of 276 index pairs), introduced 24 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 198 [2022-11-26 00:55:13,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 25 select indices, 25 select index equivalence classes, 325 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 206 [2022-11-26 00:55:13,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 25 select indices, 25 select index equivalence classes, 325 disjoint index pairs (out of 300 index pairs), introduced 25 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 206 [2022-11-26 00:55:13,669 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 26 select indices, 26 select index equivalence classes, 351 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 214 [2022-11-26 00:55:13,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 26 select indices, 26 select index equivalence classes, 351 disjoint index pairs (out of 325 index pairs), introduced 26 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 214 [2022-11-26 00:55:14,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 27 select indices, 27 select index equivalence classes, 378 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 222 [2022-11-26 00:55:14,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 27 select indices, 27 select index equivalence classes, 378 disjoint index pairs (out of 351 index pairs), introduced 27 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 222 [2022-11-26 00:55:14,364 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 28 select indices, 28 select index equivalence classes, 406 disjoint index pairs (out of 378 index pairs), introduced 28 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 230 [2022-11-26 00:55:14,462 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 28 select indices, 28 select index equivalence classes, 406 disjoint index pairs (out of 378 index pairs), introduced 28 new quantified variables, introduced 0 case distinctions, treesize of input 147 treesize of output 230 [2022-11-26 00:55:14,711 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 29 select indices, 29 select index equivalence classes, 435 disjoint index pairs (out of 406 index pairs), introduced 29 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 238 [2022-11-26 00:55:14,829 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 29 select indices, 29 select index equivalence classes, 435 disjoint index pairs (out of 406 index pairs), introduced 29 new quantified variables, introduced 0 case distinctions, treesize of input 152 treesize of output 238 [2022-11-26 00:55:15,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 30 select indices, 30 select index equivalence classes, 465 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 246 [2022-11-26 00:55:15,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 30 select indices, 30 select index equivalence classes, 465 disjoint index pairs (out of 435 index pairs), introduced 30 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 246 [2022-11-26 00:55:15,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 31 select indices, 31 select index equivalence classes, 496 disjoint index pairs (out of 465 index pairs), introduced 31 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 254 [2022-11-26 00:55:15,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 31 select indices, 31 select index equivalence classes, 496 disjoint index pairs (out of 465 index pairs), introduced 31 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 254 [2022-11-26 00:55:15,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 32 select indices, 32 select index equivalence classes, 528 disjoint index pairs (out of 496 index pairs), introduced 32 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 262 [2022-11-26 00:55:15,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 32 select indices, 32 select index equivalence classes, 528 disjoint index pairs (out of 496 index pairs), introduced 32 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 262 [2022-11-26 00:55:16,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 33 select indices, 33 select index equivalence classes, 561 disjoint index pairs (out of 528 index pairs), introduced 33 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 270 [2022-11-26 00:55:16,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 33 select indices, 33 select index equivalence classes, 561 disjoint index pairs (out of 528 index pairs), introduced 33 new quantified variables, introduced 0 case distinctions, treesize of input 172 treesize of output 270 [2022-11-26 00:55:16,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 34 select indices, 34 select index equivalence classes, 595 disjoint index pairs (out of 561 index pairs), introduced 34 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 278 [2022-11-26 00:55:16,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 34 select indices, 34 select index equivalence classes, 595 disjoint index pairs (out of 561 index pairs), introduced 34 new quantified variables, introduced 0 case distinctions, treesize of input 177 treesize of output 278 [2022-11-26 00:55:17,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 35 select indices, 35 select index equivalence classes, 630 disjoint index pairs (out of 595 index pairs), introduced 35 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 286 [2022-11-26 00:55:17,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 35 select indices, 35 select index equivalence classes, 630 disjoint index pairs (out of 595 index pairs), introduced 35 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 286 [2022-11-26 00:55:17,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 36 select indices, 36 select index equivalence classes, 666 disjoint index pairs (out of 630 index pairs), introduced 36 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 294 [2022-11-26 00:55:17,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 36 select indices, 36 select index equivalence classes, 666 disjoint index pairs (out of 630 index pairs), introduced 36 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 294 [2022-11-26 00:55:17,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 37 select indices, 37 select index equivalence classes, 703 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 302 [2022-11-26 00:55:18,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 37 select indices, 37 select index equivalence classes, 703 disjoint index pairs (out of 666 index pairs), introduced 37 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 302 [2022-11-26 00:55:18,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 38 select indices, 38 select index equivalence classes, 741 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 310 [2022-11-26 00:55:18,518 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 38 select indices, 38 select index equivalence classes, 741 disjoint index pairs (out of 703 index pairs), introduced 38 new quantified variables, introduced 0 case distinctions, treesize of input 197 treesize of output 310 [2022-11-26 00:55:18,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 39 select indices, 39 select index equivalence classes, 780 disjoint index pairs (out of 741 index pairs), introduced 39 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 318 [2022-11-26 00:55:19,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 39 select indices, 39 select index equivalence classes, 780 disjoint index pairs (out of 741 index pairs), introduced 39 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 318 [2022-11-26 00:55:19,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:19,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:19,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:19,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:19,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:19,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:19,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:19,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:19,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:19,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:19,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:19,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:19,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 00:55:19,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 8 select indices, 8 select index equivalence classes, 30 disjoint index pairs (out of 28 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 67 [2022-11-26 00:55:19,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 40 select indices, 40 select index equivalence classes, 820 disjoint index pairs (out of 780 index pairs), introduced 40 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 570 [2022-11-26 00:55:19,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 40 select indices, 40 select index equivalence classes, 820 disjoint index pairs (out of 780 index pairs), introduced 40 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 570 [2022-11-26 00:55:22,415 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:57:10,512 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2343#(and (<= 0 |ULTIMATE.start_main_~__tmp_1~0#1.offset|) (<= 0 ~Id_MCDC_93~0) (<= 0 |ULTIMATE.start_main_~__tmp_1~0#1.base|) (<= 0 |ULTIMATE.start_main_~#main__Id_MCDC_119~0#1.base|) (<= |ULTIMATE.start_main_~__tmp_1~0#1.offset| 0) (not (< (mod ~Id_MCDC_93~0 4294967296) 42)) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89__Id_MCDC_96~0#1|) (<= 0 |ULTIMATE.start_main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset|) (<= 0 |ULTIMATE.start_main_~#Id_MCDC_89__Id_MCDC_95~0#1.base|) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89__Id_MCDC_88~0#1.base|) (= |ULTIMATE.start_main_~main__Id_MCDC_116~0#1| 0) (<= 0 |ULTIMATE.start_main_~#main__Id_MCDC_119~0#1.offset|) (<= 0 |ULTIMATE.start_main_~Id_MCDC_89__Id_MCDC_88~0#1.offset|) (= |ULTIMATE.start_main_~main__Id_MCDC_115~0#1| 0) (<= |ULTIMATE.start_main_~Id_MCDC_89__Id_MCDC_88~0#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~1#1| |ULTIMATE.start_main_~__tmp_3~0#1|) (= |ULTIMATE.start_main_~__VERIFIER_assert__Id_MCDC_92~1#1| 0) (<= |ULTIMATE.start_main_~#main__Id_MCDC_119~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |ULTIMATE.start_main_~Id_MCDC_89____CPAchecker_TMP_1~0#1| 0) (= ~__return_main~0 0) (<= |ULTIMATE.start_main_~#Id_MCDC_89__Id_MCDC_95~0#1.offset| 0) (= |#NULL.base| 0))' at error location [2022-11-26 00:57:10,512 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 00:57:10,513 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:57:10,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 22 [2022-11-26 00:57:10,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994920997] [2022-11-26 00:57:10,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 00:57:10,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-26 00:57:10,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:57:10,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-26 00:57:10,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1144, Invalid=3686, Unknown=0, NotChecked=0, Total=4830 [2022-11-26 00:57:10,516 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 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-26 00:57:12,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:57:12,213 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2022-11-26 00:57:12,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-26 00:57:12,214 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 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 72 [2022-11-26 00:57:12,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:57:12,214 INFO L225 Difference]: With dead ends: 84 [2022-11-26 00:57:12,214 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:57:12,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 148 SyntacticMatches, 6 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2397 ImplicationChecksByTransitivity, 109.6s TimeCoverageRelationStatistics Valid=1536, Invalid=6654, Unknown=0, NotChecked=0, Total=8190 [2022-11-26 00:57:12,217 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 214 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-26 00:57:12,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 42 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-26 00:57:12,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:57:12,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:57:12,219 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-26 00:57:12,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:57:12,219 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 72 [2022-11-26 00:57:12,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:57:12,219 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:57:12,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 4.7272727272727275) internal successors, (104), 22 states have internal predecessors, (104), 0 states have call successors, (0), 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-26 00:57:12,220 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:57:12,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:57:12,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 86 remaining) [2022-11-26 00:57:12,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 86 remaining) [2022-11-26 00:57:12,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 86 remaining) [2022-11-26 00:57:12,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 86 remaining) [2022-11-26 00:57:12,223 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 86 remaining) [2022-11-26 00:57:12,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 86 remaining) [2022-11-26 00:57:12,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 86 remaining) [2022-11-26 00:57:12,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 86 remaining) [2022-11-26 00:57:12,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 86 remaining) [2022-11-26 00:57:12,224 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 86 remaining) [2022-11-26 00:57:12,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 86 remaining) [2022-11-26 00:57:12,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 86 remaining) [2022-11-26 00:57:12,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 86 remaining) [2022-11-26 00:57:12,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 86 remaining) [2022-11-26 00:57:12,225 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 86 remaining) [2022-11-26 00:57:12,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 86 remaining) [2022-11-26 00:57:12,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 86 remaining) [2022-11-26 00:57:12,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 86 remaining) [2022-11-26 00:57:12,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 86 remaining) [2022-11-26 00:57:12,226 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 86 remaining) [2022-11-26 00:57:12,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 86 remaining) [2022-11-26 00:57:12,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 86 remaining) [2022-11-26 00:57:12,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 86 remaining) [2022-11-26 00:57:12,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 86 remaining) [2022-11-26 00:57:12,227 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 86 remaining) [2022-11-26 00:57:12,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 86 remaining) [2022-11-26 00:57:12,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 86 remaining) [2022-11-26 00:57:12,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 86 remaining) [2022-11-26 00:57:12,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 86 remaining) [2022-11-26 00:57:12,228 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 86 remaining) [2022-11-26 00:57:12,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 86 remaining) [2022-11-26 00:57:12,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 86 remaining) [2022-11-26 00:57:12,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 86 remaining) [2022-11-26 00:57:12,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 86 remaining) [2022-11-26 00:57:12,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 86 remaining) [2022-11-26 00:57:12,229 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 86 remaining) [2022-11-26 00:57:12,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 86 remaining) [2022-11-26 00:57:12,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 86 remaining) [2022-11-26 00:57:12,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 86 remaining) [2022-11-26 00:57:12,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 86 remaining) [2022-11-26 00:57:12,230 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 86 remaining) [2022-11-26 00:57:12,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 86 remaining) [2022-11-26 00:57:12,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 86 remaining) [2022-11-26 00:57:12,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 86 remaining) [2022-11-26 00:57:12,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 86 remaining) [2022-11-26 00:57:12,231 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 86 remaining) [2022-11-26 00:57:12,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 86 remaining) [2022-11-26 00:57:12,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 86 remaining) [2022-11-26 00:57:12,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 86 remaining) [2022-11-26 00:57:12,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 86 remaining) [2022-11-26 00:57:12,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 86 remaining) [2022-11-26 00:57:12,232 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 86 remaining) [2022-11-26 00:57:12,233 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 86 remaining) [2022-11-26 00:57:12,233 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 86 remaining) [2022-11-26 00:57:12,233 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 86 remaining) [2022-11-26 00:57:12,233 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 86 remaining) [2022-11-26 00:57:12,233 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 86 remaining) [2022-11-26 00:57:12,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 86 remaining) [2022-11-26 00:57:12,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 86 remaining) [2022-11-26 00:57:12,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 86 remaining) [2022-11-26 00:57:12,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 86 remaining) [2022-11-26 00:57:12,234 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 86 remaining) [2022-11-26 00:57:12,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr62REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 86 remaining) [2022-11-26 00:57:12,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 86 remaining) [2022-11-26 00:57:12,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 86 remaining) [2022-11-26 00:57:12,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 86 remaining) [2022-11-26 00:57:12,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 86 remaining) [2022-11-26 00:57:12,235 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 86 remaining) [2022-11-26 00:57:12,236 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr68REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 86 remaining) [2022-11-26 00:57:12,236 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr69REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 86 remaining) [2022-11-26 00:57:12,236 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 86 remaining) [2022-11-26 00:57:12,236 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 86 remaining) [2022-11-26 00:57:12,236 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 86 remaining) [2022-11-26 00:57:12,237 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 86 remaining) [2022-11-26 00:57:12,237 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 86 remaining) [2022-11-26 00:57:12,237 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 86 remaining) [2022-11-26 00:57:12,237 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 86 remaining) [2022-11-26 00:57:12,237 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 86 remaining) [2022-11-26 00:57:12,238 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 86 remaining) [2022-11-26 00:57:12,238 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 86 remaining) [2022-11-26 00:57:12,238 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 86 remaining) [2022-11-26 00:57:12,238 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr81REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 86 remaining) [2022-11-26 00:57:12,238 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 86 remaining) [2022-11-26 00:57:12,239 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 86 remaining) [2022-11-26 00:57:12,239 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_LEAK (1 of 86 remaining) [2022-11-26 00:57:12,239 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_LEAK (0 of 86 remaining) [2022-11-26 00:57:12,255 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:57:12,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-26 00:57:12,449 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:57:12,451 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:57:12,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:57:12 BoogieIcfgContainer [2022-11-26 00:57:12,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:57:12,455 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:57:12,455 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:57:12,455 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:57:12,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:53:00" (3/4) ... [2022-11-26 00:57:12,458 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:57:12,472 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 63 nodes and edges [2022-11-26 00:57:12,472 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-26 00:57:12,473 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-11-26 00:57:12,474 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:57:12,474 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:57:12,686 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:57:12,686 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:57:12,687 INFO L158 Benchmark]: Toolchain (without parser) took 253543.08ms. Allocated memory was 176.2MB in the beginning and 734.0MB in the end (delta: 557.8MB). Free memory was 128.8MB in the beginning and 502.3MB in the end (delta: -373.5MB). Peak memory consumption was 186.8MB. Max. memory is 16.1GB. [2022-11-26 00:57:12,687 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 134.2MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:57:12,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 415.46ms. Allocated memory is still 176.2MB. Free memory was 128.8MB in the beginning and 112.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-26 00:57:12,688 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.19ms. Allocated memory is still 176.2MB. Free memory was 112.0MB in the beginning and 108.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:57:12,688 INFO L158 Benchmark]: Boogie Preprocessor took 51.50ms. Allocated memory is still 176.2MB. Free memory was 108.4MB in the beginning and 105.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:57:12,688 INFO L158 Benchmark]: RCFGBuilder took 1203.19ms. Allocated memory is still 176.2MB. Free memory was 105.4MB in the beginning and 121.1MB in the end (delta: -15.7MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. [2022-11-26 00:57:12,689 INFO L158 Benchmark]: TraceAbstraction took 251570.27ms. Allocated memory was 176.2MB in the beginning and 734.0MB in the end (delta: 557.8MB). Free memory was 120.0MB in the beginning and 515.7MB in the end (delta: -395.6MB). Peak memory consumption was 162.6MB. Max. memory is 16.1GB. [2022-11-26 00:57:12,690 INFO L158 Benchmark]: Witness Printer took 231.06ms. Allocated memory is still 734.0MB. Free memory was 515.7MB in the beginning and 502.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-26 00:57:12,692 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.21ms. Allocated memory is still 134.2MB. Free memory is still 78.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 415.46ms. Allocated memory is still 176.2MB. Free memory was 128.8MB in the beginning and 112.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.19ms. Allocated memory is still 176.2MB. Free memory was 112.0MB in the beginning and 108.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.50ms. Allocated memory is still 176.2MB. Free memory was 108.4MB in the beginning and 105.4MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1203.19ms. Allocated memory is still 176.2MB. Free memory was 105.4MB in the beginning and 121.1MB in the end (delta: -15.7MB). Peak memory consumption was 45.1MB. Max. memory is 16.1GB. * TraceAbstraction took 251570.27ms. Allocated memory was 176.2MB in the beginning and 734.0MB in the end (delta: 557.8MB). Free memory was 120.0MB in the beginning and 515.7MB in the end (delta: -395.6MB). Peak memory consumption was 162.6MB. Max. memory is 16.1GB. * Witness Printer took 231.06ms. Allocated memory is still 734.0MB. Free memory was 515.7MB in the beginning and 502.3MB in the end (delta: 13.4MB). Peak memory consumption was 12.6MB. 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: -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: -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: 221]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 130]: 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, 139 locations, 86 error locations. Started 1 CEGAR loops. OverallTime: 251.5s, OverallIterations: 10, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 852 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 852 mSDsluCounter, 342 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 193 mSDsCounter, 113 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1756 IncrementalHoareTripleChecker+Invalid, 1869 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 113 mSolverCounterUnsat, 149 mSDtfsCounter, 1756 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 445 GetRequests, 261 SyntacticMatches, 10 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3244 ImplicationChecksByTransitivity, 213.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=139occurred in iteration=0, InterpolantAutomatonStates: 69, 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, 10 MinimizatonAttempts, 13 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 503 NumberOfCodeBlocks, 491 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 615 ConstructedInterpolants, 19 QuantifiedInterpolants, 2722 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1946 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 14 InterpolantComputations, 8 PerfectInterpolantSequences, 51/153 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 86 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-11-26 00:57:12,737 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a376cde6-9587-454f-9781-0935f9f407c9/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE