./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5142bd1a70b277e6c0e9690abed85caa4ceacf811cc7ce059063d386607411a7 --- 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-2329fc7 [2022-12-14 15:24:49,995 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:24:49,997 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:24:50,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:24:50,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:24:50,016 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:24:50,017 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:24:50,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:24:50,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:24:50,021 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:24:50,022 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:24:50,023 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:24:50,023 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:24:50,024 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:24:50,025 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:24:50,026 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:24:50,027 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:24:50,028 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:24:50,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:24:50,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:24:50,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:24:50,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:24:50,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:24:50,035 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:24:50,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:24:50,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:24:50,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:24:50,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:24:50,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:24:50,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:24:50,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:24:50,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:24:50,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:24:50,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:24:50,044 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:24:50,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:24:50,045 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:24:50,045 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:24:50,045 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:24:50,046 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:24:50,046 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:24:50,047 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-12-14 15:24:50,066 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:24:50,066 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:24:50,066 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:24:50,067 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:24:50,067 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:24:50,067 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:24:50,068 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:24:50,068 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:24:50,068 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:24:50,068 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:24:50,068 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:24:50,069 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:24:50,069 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:24:50,069 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:24:50,069 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:24:50,069 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:24:50,069 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:24:50,070 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:24:50,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 15:24:50,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 15:24:50,071 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:24:50,071 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:24:50,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:24:50,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:24:50,071 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 15:24:50,071 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 15:24:50,072 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 15:24:50,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:24:50,072 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 15:24:50,072 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:24:50,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:24:50,072 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:24:50,072 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:24:50,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:24:50,073 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:24:50,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:24:50,073 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:24:50,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:24:50,074 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:24:50,074 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_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/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_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5142bd1a70b277e6c0e9690abed85caa4ceacf811cc7ce059063d386607411a7 [2022-12-14 15:24:50,271 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:24:50,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:24:50,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:24:50,293 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:24:50,294 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:24:50,295 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca-1.i [2022-12-14 15:24:52,911 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:24:53,078 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:24:53,078 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/sv-benchmarks/c/termination-memory-alloca/cstrpbrk-alloca-1.i [2022-12-14 15:24:53,088 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/data/0bc64ab6c/cc711b2d1fce4f679cffc6b3acf7f53a/FLAG32a72ff0e [2022-12-14 15:24:53,099 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/data/0bc64ab6c/cc711b2d1fce4f679cffc6b3acf7f53a [2022-12-14 15:24:53,101 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:24:53,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:24:53,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:24:53,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:24:53,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:24:53,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:24:53" (1/1) ... [2022-12-14 15:24:53,107 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7524f700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:53, skipping insertion in model container [2022-12-14 15:24:53,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:24:53" (1/1) ... [2022-12-14 15:24:53,113 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:24:53,140 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:24:53,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:24:53,342 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:24:53,367 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:24:53,383 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:24:53,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:53 WrapperNode [2022-12-14 15:24:53,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:24:53,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:24:53,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:24:53,384 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:24:53,389 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:53" (1/1) ... [2022-12-14 15:24:53,398 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:53" (1/1) ... [2022-12-14 15:24:53,412 INFO L138 Inliner]: procedures = 111, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 79 [2022-12-14 15:24:53,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:24:53,413 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:24:53,413 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:24:53,413 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:24:53,419 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:53" (1/1) ... [2022-12-14 15:24:53,419 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:53" (1/1) ... [2022-12-14 15:24:53,421 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:53" (1/1) ... [2022-12-14 15:24:53,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:53" (1/1) ... [2022-12-14 15:24:53,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:53" (1/1) ... [2022-12-14 15:24:53,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:53" (1/1) ... [2022-12-14 15:24:53,428 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:53" (1/1) ... [2022-12-14 15:24:53,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:53" (1/1) ... [2022-12-14 15:24:53,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:24:53,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:24:53,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:24:53,431 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:24:53,432 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:53" (1/1) ... [2022-12-14 15:24:53,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:24:53,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:24:53,456 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:24:53,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:24:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 15:24:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 15:24:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 15:24:53,484 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:24:53,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:24:53,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:24:53,564 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:24:53,565 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:24:53,716 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:24:53,752 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:24:53,752 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-12-14 15:24:53,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:24:53 BoogieIcfgContainer [2022-12-14 15:24:53,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:24:53,757 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:24:53,757 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:24:53,760 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:24:53,760 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:24:53" (1/3) ... [2022-12-14 15:24:53,761 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67411837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:24:53, skipping insertion in model container [2022-12-14 15:24:53,761 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:24:53" (2/3) ... [2022-12-14 15:24:53,762 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67411837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:24:53, skipping insertion in model container [2022-12-14 15:24:53,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:24:53" (3/3) ... [2022-12-14 15:24:53,763 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrpbrk-alloca-1.i [2022-12-14 15:24:53,780 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:24:53,780 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2022-12-14 15:24:53,824 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:24:53,831 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;@42e8258a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:24:53,831 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2022-12-14 15:24:53,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 15 states have (on average 2.4) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 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-12-14 15:24:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 15:24:53,840 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:53,841 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 15:24:53,841 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:24:53,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash 3923, now seen corresponding path program 1 times [2022-12-14 15:24:53,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:53,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406108482] [2022-12-14 15:24:53,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:53,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:54,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:54,110 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:54,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406108482] [2022-12-14 15:24:54,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406108482] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:54,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:54,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:24:54,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94853688] [2022-12-14 15:24:54,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:54,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:54,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:54,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:54,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:54,149 INFO L87 Difference]: Start difference. First operand has 31 states, 15 states have (on average 2.4) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:54,204 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-12-14 15:24:54,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:54,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 15:24:54,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:54,212 INFO L225 Difference]: With dead ends: 30 [2022-12-14 15:24:54,212 INFO L226 Difference]: Without dead ends: 29 [2022-12-14 15:24:54,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:54,216 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:54,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 15 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:24:54,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-12-14 15:24:54,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-12-14 15:24:54,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 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-12-14 15:24:54,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-12-14 15:24:54,240 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 2 [2022-12-14 15:24:54,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:54,241 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-12-14 15:24:54,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,241 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-12-14 15:24:54,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-12-14 15:24:54,242 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:54,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-12-14 15:24:54,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 15:24:54,243 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:24:54,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:54,243 INFO L85 PathProgramCache]: Analyzing trace with hash 3924, now seen corresponding path program 1 times [2022-12-14 15:24:54,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:54,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952049344] [2022-12-14 15:24:54,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:54,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:54,466 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:54,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952049344] [2022-12-14 15:24:54,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952049344] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:54,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:54,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:24:54,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769727836] [2022-12-14 15:24:54,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:54,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:54,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:54,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:54,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:54,469 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:54,501 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2022-12-14 15:24:54,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:54,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2022-12-14 15:24:54,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:54,502 INFO L225 Difference]: With dead ends: 28 [2022-12-14 15:24:54,502 INFO L226 Difference]: Without dead ends: 28 [2022-12-14 15:24:54,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:54,503 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 30 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:54,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 16 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:24:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-12-14 15:24:54,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-12-14 15:24:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 2.066666666666667) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-14 15:24:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-12-14 15:24:54,508 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 2 [2022-12-14 15:24:54,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:54,508 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-12-14 15:24:54,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-12-14 15:24:54,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 15:24:54,509 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:54,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 15:24:54,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 15:24:54,510 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:24:54,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:54,510 INFO L85 PathProgramCache]: Analyzing trace with hash 121602, now seen corresponding path program 1 times [2022-12-14 15:24:54,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:54,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229286258] [2022-12-14 15:24:54,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:54,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:54,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:54,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:54,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:54,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229286258] [2022-12-14 15:24:54,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229286258] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:54,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:54,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:24:54,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688234939] [2022-12-14 15:24:54,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:54,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:54,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:54,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:54,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:54,571 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:54,596 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-12-14 15:24:54,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:54,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 15:24:54,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:54,597 INFO L225 Difference]: With dead ends: 27 [2022-12-14 15:24:54,597 INFO L226 Difference]: Without dead ends: 27 [2022-12-14 15:24:54,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:54,599 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:54,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 14 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:24:54,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-12-14 15:24:54,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-12-14 15:24:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 2.0) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-12-14 15:24:54,603 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 3 [2022-12-14 15:24:54,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:54,603 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-12-14 15:24:54,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-12-14 15:24:54,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 15:24:54,604 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:54,604 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 15:24:54,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 15:24:54,604 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:24:54,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:54,605 INFO L85 PathProgramCache]: Analyzing trace with hash 121603, now seen corresponding path program 1 times [2022-12-14 15:24:54,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:54,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224421902] [2022-12-14 15:24:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:54,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:54,685 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:54,686 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:54,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224421902] [2022-12-14 15:24:54,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224421902] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:54,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:54,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 15:24:54,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851104212] [2022-12-14 15:24:54,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:54,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:54,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:54,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:54,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:54,688 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:54,713 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-12-14 15:24:54,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:54,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 15:24:54,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:54,714 INFO L225 Difference]: With dead ends: 26 [2022-12-14 15:24:54,714 INFO L226 Difference]: Without dead ends: 26 [2022-12-14 15:24:54,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:54,715 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:54,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 15 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:24:54,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-12-14 15:24:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-12-14 15:24:54,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-12-14 15:24:54,717 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 3 [2022-12-14 15:24:54,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:54,718 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-12-14 15:24:54,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,718 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-12-14 15:24:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 15:24:54,718 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:54,718 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 15:24:54,718 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 15:24:54,718 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:24:54,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:54,719 INFO L85 PathProgramCache]: Analyzing trace with hash 3771797, now seen corresponding path program 1 times [2022-12-14 15:24:54,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:54,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569855584] [2022-12-14 15:24:54,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:54,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:54,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:54,752 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:54,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569855584] [2022-12-14 15:24:54,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569855584] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:54,752 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:54,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:24:54,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782362808] [2022-12-14 15:24:54,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:54,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:24:54,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:54,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:24:54,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:24:54,754 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:54,790 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-12-14 15:24:54,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:24:54,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 15:24:54,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:54,791 INFO L225 Difference]: With dead ends: 24 [2022-12-14 15:24:54,792 INFO L226 Difference]: Without dead ends: 24 [2022-12-14 15:24:54,792 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-12-14 15:24:54,793 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 44 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:54,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 11 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:24:54,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-12-14 15:24:54,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-12-14 15:24:54,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.8) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-12-14 15:24:54,795 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 4 [2022-12-14 15:24:54,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:54,795 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-12-14 15:24:54,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,795 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-12-14 15:24:54,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 15:24:54,796 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:54,796 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 15:24:54,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 15:24:54,796 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:24:54,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:54,796 INFO L85 PathProgramCache]: Analyzing trace with hash 3771798, now seen corresponding path program 1 times [2022-12-14 15:24:54,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:54,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296800070] [2022-12-14 15:24:54,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:54,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:54,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:54,863 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:54,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296800070] [2022-12-14 15:24:54,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296800070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:54,863 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:54,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:24:54,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479537996] [2022-12-14 15:24:54,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:54,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:24:54,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:54,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:24:54,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:24:54,865 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:54,918 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-12-14 15:24:54,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:24:54,918 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 15:24:54,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:54,919 INFO L225 Difference]: With dead ends: 43 [2022-12-14 15:24:54,919 INFO L226 Difference]: Without dead ends: 43 [2022-12-14 15:24:54,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-12-14 15:24:54,920 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 115 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:54,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 24 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:24:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-12-14 15:24:54,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2022-12-14 15:24:54,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-14 15:24:54,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-12-14 15:24:54,923 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 4 [2022-12-14 15:24:54,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:54,924 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-12-14 15:24:54,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.0) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:54,924 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-12-14 15:24:54,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 15:24:54,924 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:54,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:54,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 15:24:54,925 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:24:54,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:54,925 INFO L85 PathProgramCache]: Analyzing trace with hash 696459362, now seen corresponding path program 1 times [2022-12-14 15:24:54,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:54,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316280880] [2022-12-14 15:24:54,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:54,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:54,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:54,982 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:54,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316280880] [2022-12-14 15:24:54,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316280880] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:54,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:54,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:24:54,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430532930] [2022-12-14 15:24:54,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:54,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:24:54,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:54,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:24:54,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:24:54,984 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-12-14 15:24:55,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:55,020 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-12-14 15:24:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:24:55,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-12-14 15:24:55,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:55,021 INFO L225 Difference]: With dead ends: 26 [2022-12-14 15:24:55,021 INFO L226 Difference]: Without dead ends: 26 [2022-12-14 15:24:55,021 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-12-14 15:24:55,022 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:55,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 14 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:24:55,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-12-14 15:24:55,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-12-14 15:24:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 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-12-14 15:24:55,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-12-14 15:24:55,025 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 7 [2022-12-14 15:24:55,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:55,025 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-12-14 15:24:55,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-12-14 15:24:55,025 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-12-14 15:24:55,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 15:24:55,026 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:55,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:55,026 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 15:24:55,026 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:24:55,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:55,027 INFO L85 PathProgramCache]: Analyzing trace with hash 696459363, now seen corresponding path program 1 times [2022-12-14 15:24:55,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:55,027 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439139043] [2022-12-14 15:24:55,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:55,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:55,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:55,170 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:55,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439139043] [2022-12-14 15:24:55,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439139043] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:55,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:55,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:24:55,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884543152] [2022-12-14 15:24:55,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:55,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 15:24:55,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:55,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 15:24:55,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:24:55,172 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-12-14 15:24:55,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:55,238 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-12-14 15:24:55,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 15:24:55,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-12-14 15:24:55,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:55,239 INFO L225 Difference]: With dead ends: 37 [2022-12-14 15:24:55,239 INFO L226 Difference]: Without dead ends: 37 [2022-12-14 15:24:55,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 15:24:55,240 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 77 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:55,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 20 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:24:55,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-12-14 15:24:55,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2022-12-14 15:24:55,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 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-12-14 15:24:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-12-14 15:24:55,243 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 7 [2022-12-14 15:24:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:55,244 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-12-14 15:24:55,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 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-12-14 15:24:55,244 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-12-14 15:24:55,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-12-14 15:24:55,244 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:55,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:55,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 15:24:55,245 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:24:55,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:55,245 INFO L85 PathProgramCache]: Analyzing trace with hash 115336708, now seen corresponding path program 1 times [2022-12-14 15:24:55,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:55,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381752778] [2022-12-14 15:24:55,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:55,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:55,368 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:55,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381752778] [2022-12-14 15:24:55,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381752778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:55,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:55,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:24:55,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964230859] [2022-12-14 15:24:55,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:55,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:24:55,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:55,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:24:55,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:24:55,370 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:55,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:55,392 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-12-14 15:24:55,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:24:55,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-12-14 15:24:55,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:55,393 INFO L225 Difference]: With dead ends: 28 [2022-12-14 15:24:55,393 INFO L226 Difference]: Without dead ends: 25 [2022-12-14 15:24:55,393 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-12-14 15:24:55,394 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 16 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:55,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:24:55,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-12-14 15:24:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-12-14 15:24:55,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 20 states have (on average 1.45) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:55,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-12-14 15:24:55,395 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 8 [2022-12-14 15:24:55,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:55,396 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-12-14 15:24:55,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-12-14 15:24:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 15:24:55,396 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:55,396 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:55,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-14 15:24:55,396 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:24:55,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:55,397 INFO L85 PathProgramCache]: Analyzing trace with hash -764729450, now seen corresponding path program 1 times [2022-12-14 15:24:55,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:55,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434575340] [2022-12-14 15:24:55,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:55,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:55,415 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:55,416 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:55,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434575340] [2022-12-14 15:24:55,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434575340] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:55,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:55,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:24:55,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40773554] [2022-12-14 15:24:55,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:55,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 15:24:55,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:55,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 15:24:55,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 15:24:55,417 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:55,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:55,433 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-12-14 15:24:55,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 15:24:55,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 15:24:55,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:55,434 INFO L225 Difference]: With dead ends: 27 [2022-12-14 15:24:55,434 INFO L226 Difference]: Without dead ends: 27 [2022-12-14 15:24:55,434 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-12-14 15:24:55,434 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:55,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:24:55,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-12-14 15:24:55,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-12-14 15:24:55,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 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-12-14 15:24:55,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-12-14 15:24:55,436 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2022-12-14 15:24:55,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:55,436 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-12-14 15:24:55,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:55,436 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-12-14 15:24:55,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-12-14 15:24:55,437 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:55,437 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:55,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-14 15:24:55,437 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:24:55,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:55,437 INFO L85 PathProgramCache]: Analyzing trace with hash 2063036645, now seen corresponding path program 1 times [2022-12-14 15:24:55,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:55,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317858095] [2022-12-14 15:24:55,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:55,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:55,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:55,665 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:55,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317858095] [2022-12-14 15:24:55,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317858095] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:24:55,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1239956307] [2022-12-14 15:24:55,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:55,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:24:55,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:24:55,666 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:24:55,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 15:24:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:55,731 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 29 conjunts are in the unsatisfiable core [2022-12-14 15:24:55,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:24:55,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2022-12-14 15:24:55,963 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:24:55,964 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 32 treesize of output 29 [2022-12-14 15:24:56,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:56,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:24:56,259 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-12-14 15:24:56,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 15:24:56,273 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-12-14 15:24:56,285 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:56,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1239956307] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:24:56,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2000047953] [2022-12-14 15:24:56,302 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-12-14 15:24:56,303 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:24:56,307 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:24:56,312 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:24:56,312 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:24:56,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:24:56,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 15:24:56,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2022-12-14 15:24:56,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:24:56,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 24 [2022-12-14 15:24:56,756 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:24:58,543 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '721#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.base|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-12-14 15:24:58,543 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:24:58,543 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:24:58,544 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-12-14 15:24:58,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202892953] [2022-12-14 15:24:58,544 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:24:58,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-12-14 15:24:58,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:58,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-12-14 15:24:58,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=631, Unknown=0, NotChecked=0, Total=756 [2022-12-14 15:24:58,545 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:59,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:59,037 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-12-14 15:24:59,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-14 15:24:59,038 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-12-14 15:24:59,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:59,039 INFO L225 Difference]: With dead ends: 44 [2022-12-14 15:24:59,039 INFO L226 Difference]: Without dead ends: 44 [2022-12-14 15:24:59,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=236, Invalid=1024, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 15:24:59,040 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 196 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:59,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 14 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 15:24:59,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-14 15:24:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 24. [2022-12-14 15:24:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 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-12-14 15:24:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-12-14 15:24:59,042 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 11 [2022-12-14 15:24:59,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:59,042 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-12-14 15:24:59,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 1.7647058823529411) internal successors, (30), 17 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:59,042 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-12-14 15:24:59,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-12-14 15:24:59,043 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:59,043 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:59,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:24:59,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 15:24:59,244 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:24:59,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash -465631564, now seen corresponding path program 1 times [2022-12-14 15:24:59,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:59,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242021381] [2022-12-14 15:24:59,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:59,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:59,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:59,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:59,306 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:59,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242021381] [2022-12-14 15:24:59,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242021381] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:24:59,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:24:59,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 15:24:59,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224373990] [2022-12-14 15:24:59,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:24:59,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 15:24:59,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:24:59,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 15:24:59,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-12-14 15:24:59,307 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:59,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:24:59,375 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-12-14 15:24:59,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 15:24:59,375 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-12-14 15:24:59,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:24:59,376 INFO L225 Difference]: With dead ends: 26 [2022-12-14 15:24:59,376 INFO L226 Difference]: Without dead ends: 23 [2022-12-14 15:24:59,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2022-12-14 15:24:59,376 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 30 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:24:59,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 20 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:24:59,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-12-14 15:24:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-12-14 15:24:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:59,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-12-14 15:24:59,378 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 12 [2022-12-14 15:24:59,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:24:59,378 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-12-14 15:24:59,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:24:59,378 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-12-14 15:24:59,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 15:24:59,378 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:24:59,378 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:24:59,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-14 15:24:59,379 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:24:59,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:24:59,379 INFO L85 PathProgramCache]: Analyzing trace with hash -1696712637, now seen corresponding path program 1 times [2022-12-14 15:24:59,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:24:59,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016310017] [2022-12-14 15:24:59,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:59,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:24:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:59,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:24:59,600 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:24:59,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016310017] [2022-12-14 15:24:59,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016310017] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:24:59,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663417549] [2022-12-14 15:24:59,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:24:59,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:24:59,600 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:24:59,601 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:24:59,602 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 15:24:59,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:24:59,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 42 conjunts are in the unsatisfiable core [2022-12-14 15:24:59,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:24:59,668 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 15:24:59,689 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 15:24:59,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 19 [2022-12-14 15:25:00,043 INFO L321 Elim1Store]: treesize reduction 3, result has 92.7 percent of original size [2022-12-14 15:25:00,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 51 [2022-12-14 15:25:00,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:00,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:25:00,350 WARN L837 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_cstrpbrk_~s~0#1.offset| Int) (|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_22| Int) (v_ArrVal_131 (Array Int Int)) (|ULTIMATE.start_cstrpbrk_~s~0#1.base| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetString2~0#1.base| v_ArrVal_131))) (let ((.cse0 (select (select .cse1 |ULTIMATE.start_cstrpbrk_~s~0#1.base|) |ULTIMATE.start_cstrpbrk_~s~0#1.offset|))) (or (not (= .cse0 (select (select .cse1 |c_ULTIMATE.start_main_~nondetString1~0#1.base|) |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_22|))) (not (<= 0 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_22|)) (<= (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_22| 2) (select |c_#length| |c_ULTIMATE.start_main_~nondetString1~0#1.base|)) (= .cse0 0) (< |c_ULTIMATE.start_main_~nondetString1~0#1.offset| |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_22|))))) is different from false [2022-12-14 15:25:00,369 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:25:00,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 40 [2022-12-14 15:25:00,388 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:25:00,389 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 103 treesize of output 114 [2022-12-14 15:25:00,402 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:25:00,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 64 treesize of output 62 [2022-12-14 15:25:00,411 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 15:25:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:00,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663417549] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:25:00,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1992854119] [2022-12-14 15:25:00,625 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 15:25:00,625 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:25:00,625 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:25:00,625 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:25:00,625 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:25:00,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:25:00,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 15:25:00,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2022-12-14 15:25:00,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:25:00,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 24 [2022-12-14 15:25:01,256 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:25:03,725 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '980#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-12-14 15:25:03,725 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:25:03,725 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:25:03,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 9, 9] total 24 [2022-12-14 15:25:03,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637659828] [2022-12-14 15:25:03,726 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:25:03,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 15:25:03,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:03,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 15:25:03,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1102, Unknown=1, NotChecked=68, Total=1332 [2022-12-14 15:25:03,728 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 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-12-14 15:25:05,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:05,069 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2022-12-14 15:25:05,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-14 15:25:05,069 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 15:25:05,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:05,069 INFO L225 Difference]: With dead ends: 64 [2022-12-14 15:25:05,070 INFO L226 Difference]: Without dead ends: 64 [2022-12-14 15:25:05,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=500, Invalid=2259, Unknown=1, NotChecked=102, Total=2862 [2022-12-14 15:25:05,071 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 272 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:05,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 29 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 189 Invalid, 0 Unknown, 28 Unchecked, 0.2s Time] [2022-12-14 15:25:05,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-12-14 15:25:05,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2022-12-14 15:25:05,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 47 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:25:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2022-12-14 15:25:05,073 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 13 [2022-12-14 15:25:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:05,073 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2022-12-14 15:25:05,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.56) internal successors, (39), 25 states have internal predecessors, (39), 0 states have call successors, (0), 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-12-14 15:25:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2022-12-14 15:25:05,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-14 15:25:05,073 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:05,073 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:25:05,078 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 15:25:05,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-12-14 15:25:05,275 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:25:05,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:05,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1626058855, now seen corresponding path program 2 times [2022-12-14 15:25:05,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:05,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667808673] [2022-12-14 15:25:05,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:05,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:05,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:05,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:05,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667808673] [2022-12-14 15:25:05,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667808673] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:25:05,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86806447] [2022-12-14 15:25:05,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:25:05,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:25:05,631 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:25:05,632 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:25:05,632 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 15:25:05,683 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 15:25:05,684 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:25:05,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 15:25:05,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:05,698 INFO L321 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2022-12-14 15:25:05,699 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 1 case distinctions, treesize of input 11 treesize of output 17 [2022-12-14 15:25:05,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 18 treesize of output 14 [2022-12-14 15:25:06,098 INFO L321 Elim1Store]: treesize reduction 18, result has 53.8 percent of original size [2022-12-14 15:25:06,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 32 [2022-12-14 15:25:06,157 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:06,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:25:06,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2022-12-14 15:25:06,488 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:25:06,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 35 treesize of output 39 [2022-12-14 15:25:06,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:06,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86806447] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:25:06,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [909023123] [2022-12-14 15:25:06,541 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2022-12-14 15:25:06,541 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:25:06,541 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:25:06,541 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:25:06,541 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:25:06,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:25:06,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 15:25:06,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2022-12-14 15:25:06,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:25:06,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 24 [2022-12-14 15:25:06,745 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:25:08,639 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1250#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.base|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_~s~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~s~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~s~0#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-12-14 15:25:08,640 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:25:08,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:25:08,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 9] total 26 [2022-12-14 15:25:08,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191012958] [2022-12-14 15:25:08,640 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:25:08,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-12-14 15:25:08,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:08,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-12-14 15:25:08,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1224, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 15:25:08,642 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 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-12-14 15:25:10,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:10,152 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-12-14 15:25:10,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-12-14 15:25:10,153 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-12-14 15:25:10,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:10,153 INFO L225 Difference]: With dead ends: 80 [2022-12-14 15:25:10,153 INFO L226 Difference]: Without dead ends: 80 [2022-12-14 15:25:10,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=487, Invalid=2165, Unknown=0, NotChecked=0, Total=2652 [2022-12-14 15:25:10,155 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 165 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:10,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 9 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 15:25:10,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-12-14 15:25:10,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 32. [2022-12-14 15:25:10,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 0 states have call successors, (0), 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-12-14 15:25:10,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2022-12-14 15:25:10,159 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 15 [2022-12-14 15:25:10,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:10,160 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2022-12-14 15:25:10,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 27 states have internal predecessors, (45), 0 states have call successors, (0), 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-12-14 15:25:10,160 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-12-14 15:25:10,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 15:25:10,161 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:10,161 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2022-12-14 15:25:10,165 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 15:25:10,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:25:10,362 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:25:10,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:10,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1848408483, now seen corresponding path program 2 times [2022-12-14 15:25:10,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:10,364 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795157855] [2022-12-14 15:25:10,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:10,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:10,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:11,080 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:11,080 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:11,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795157855] [2022-12-14 15:25:11,080 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795157855] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:25:11,080 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576120712] [2022-12-14 15:25:11,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:25:11,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:25:11,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:25:11,081 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:25:11,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 15:25:11,157 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-12-14 15:25:11,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:25:11,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 89 conjunts are in the unsatisfiable core [2022-12-14 15:25:11,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:11,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-14 15:25:11,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 15:25:11,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 19 [2022-12-14 15:25:12,559 INFO L321 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2022-12-14 15:25:12,559 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 55 treesize of output 60 [2022-12-14 15:25:12,749 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:12,749 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:25:13,888 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_31| Int) (|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_32| Int) (v_ArrVal_175 (Array Int Int))) (let ((.cse0 (select v_ArrVal_175 |c_ULTIMATE.start_main_~nondetString2~0#1.offset|)) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetString2~0#1.base| v_ArrVal_175) |c_ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (not (= .cse0 (select .cse1 |c_ULTIMATE.start_main_~nondetString1~0#1.offset|))) (= .cse0 0) (not (= .cse0 (select .cse1 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_31|))) (not (<= 0 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_31|)) (not (= .cse0 (select .cse1 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_32|))) (not (<= |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_31| (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_32| 1))) (not (<= |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_32| (+ |c_ULTIMATE.start_main_~nondetString1~0#1.offset| 1))) (<= (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_31| 2) (select |c_#length| |c_ULTIMATE.start_main_~nondetString1~0#1.base|))))) is different from false [2022-12-14 15:25:13,906 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:25:13,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 51 [2022-12-14 15:25:13,933 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:25:13,933 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 96 treesize of output 133 [2022-12-14 15:25:13,962 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:25:13,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 78 treesize of output 106 [2022-12-14 15:25:13,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 15:25:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:25:14,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576120712] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:25:14,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [303286833] [2022-12-14 15:25:14,358 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 15:25:14,358 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:25:14,358 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:25:14,358 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:25:14,359 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:25:14,377 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:25:14,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 15:25:14,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2022-12-14 15:25:14,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:25:14,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 24 [2022-12-14 15:25:14,758 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:25:17,377 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1630#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-12-14 15:25:17,378 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:25:17,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:25:17,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 17] total 48 [2022-12-14 15:25:17,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485200646] [2022-12-14 15:25:17,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:25:17,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-12-14 15:25:17,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:17,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-12-14 15:25:17,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=3276, Unknown=1, NotChecked=116, Total=3660 [2022-12-14 15:25:17,380 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 49 states have internal predecessors, (93), 0 states have call successors, (0), 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-12-14 15:25:43,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:25:43,105 INFO L93 Difference]: Finished difference Result 258 states and 292 transitions. [2022-12-14 15:25:43,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2022-12-14 15:25:43,105 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 49 states have internal predecessors, (93), 0 states have call successors, (0), 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 31 [2022-12-14 15:25:43,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:25:43,107 INFO L225 Difference]: With dead ends: 258 [2022-12-14 15:25:43,107 INFO L226 Difference]: Without dead ends: 258 [2022-12-14 15:25:43,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 8106 ImplicationChecksByTransitivity, 28.6s TimeCoverageRelationStatistics Valid=3875, Invalid=20934, Unknown=1, NotChecked=312, Total=25122 [2022-12-14 15:25:43,118 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 1632 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 1049 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1632 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 1245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-12-14 15:25:43,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1632 Valid, 157 Invalid, 1245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1049 Invalid, 0 Unknown, 94 Unchecked, 1.5s Time] [2022-12-14 15:25:43,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-12-14 15:25:43,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 89. [2022-12-14 15:25:43,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 88 states have internal predecessors, (100), 0 states have call successors, (0), 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-12-14 15:25:43,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2022-12-14 15:25:43,121 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 31 [2022-12-14 15:25:43,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:25:43,121 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2022-12-14 15:25:43,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 49 states have internal predecessors, (93), 0 states have call successors, (0), 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-12-14 15:25:43,122 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2022-12-14 15:25:43,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-14 15:25:43,122 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:25:43,122 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2022-12-14 15:25:43,127 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 15:25:43,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-12-14 15:25:43,324 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:25:43,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:25:43,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1738893657, now seen corresponding path program 1 times [2022-12-14 15:25:43,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:25:43,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101759211] [2022-12-14 15:25:43,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:43,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:25:43,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:43,837 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-14 15:25:43,837 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:25:43,837 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101759211] [2022-12-14 15:25:43,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101759211] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:25:43,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541981290] [2022-12-14 15:25:43,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:25:43,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:25:43,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:25:43,839 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:25:43,839 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 15:25:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:25:43,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 92 conjunts are in the unsatisfiable core [2022-12-14 15:25:43,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:25:43,932 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 15:25:43,956 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 15:25:44,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 19 [2022-12-14 15:25:45,526 INFO L321 Elim1Store]: treesize reduction 11, result has 89.2 percent of original size [2022-12-14 15:25:45,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 67 treesize of output 114 [2022-12-14 15:25:45,645 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 6 proven. 46 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 15:25:45,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:25:46,914 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrpbrk_~s~0#1.base_49| Int) (|v_ULTIMATE.start_cstrpbrk_~s~0#1.offset_46| Int) (|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_43| Int) (v_ArrVal_198 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetString2~0#1.base| v_ArrVal_198))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_main_~nondetString1~0#1.base|)) (.cse2 (select v_ArrVal_198 |c_ULTIMATE.start_main_~nondetString2~0#1.offset|)) (.cse1 (select (select .cse3 |v_ULTIMATE.start_cstrpbrk_~s~0#1.base_49|) |v_ULTIMATE.start_cstrpbrk_~s~0#1.offset_46|))) (or (<= (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_43| 4) (select |c_#length| |c_ULTIMATE.start_main_~nondetString1~0#1.base|)) (not (= (select .cse0 (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_43| 2)) .cse1)) (not (= .cse2 (select .cse0 (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_43| 1)))) (< |c_ULTIMATE.start_main_~nondetString1~0#1.offset| |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_43|) (= .cse2 0) (not (= (select .cse0 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_43|) .cse2)) (= .cse1 0) (not (<= 0 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_43|)))))) is different from false [2022-12-14 15:25:46,934 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:25:46,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 70 [2022-12-14 15:25:46,974 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:25:46,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 171 treesize of output 218 [2022-12-14 15:25:47,013 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:25:47,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 123 treesize of output 157 [2022-12-14 15:25:47,027 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 15:25:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 52 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 15:25:48,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541981290] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:25:48,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1562589181] [2022-12-14 15:25:48,920 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 15:25:48,920 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:25:48,920 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:25:48,920 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:25:48,920 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:25:48,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:25:48,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 15:25:48,964 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2022-12-14 15:25:48,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:25:48,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 24 [2022-12-14 15:25:49,532 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:25:51,153 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2462#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-12-14 15:25:51,153 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:25:51,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:25:51,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 20, 19] total 47 [2022-12-14 15:25:51,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324192727] [2022-12-14 15:25:51,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:25:51,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-12-14 15:25:51,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:25:51,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-12-14 15:25:51,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=3105, Unknown=1, NotChecked=114, Total=3540 [2022-12-14 15:25:51,155 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand has 49 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 0 states have call successors, (0), 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-12-14 15:26:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:26:11,347 INFO L93 Difference]: Finished difference Result 192 states and 216 transitions. [2022-12-14 15:26:11,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-12-14 15:26:11,347 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 0 states have call successors, (0), 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 39 [2022-12-14 15:26:11,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:26:11,348 INFO L225 Difference]: With dead ends: 192 [2022-12-14 15:26:11,348 INFO L226 Difference]: Without dead ends: 192 [2022-12-14 15:26:11,351 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5071 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=2444, Invalid=14329, Unknown=1, NotChecked=256, Total=17030 [2022-12-14 15:26:11,351 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 830 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 830 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:26:11,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [830 Valid, 113 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 927 Invalid, 0 Unknown, 81 Unchecked, 1.2s Time] [2022-12-14 15:26:11,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-12-14 15:26:11,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 72. [2022-12-14 15:26:11,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.1267605633802817) internal successors, (80), 71 states have internal predecessors, (80), 0 states have call successors, (0), 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-12-14 15:26:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2022-12-14 15:26:11,356 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 39 [2022-12-14 15:26:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:26:11,356 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2022-12-14 15:26:11,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 2.125) internal successors, (102), 48 states have internal predecessors, (102), 0 states have call successors, (0), 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-12-14 15:26:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2022-12-14 15:26:11,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 15:26:11,358 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:26:11,358 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1] [2022-12-14 15:26:11,363 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-12-14 15:26:11,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-12-14 15:26:11,559 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:26:11,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:26:11,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1112464918, now seen corresponding path program 2 times [2022-12-14 15:26:11,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:26:11,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127560070] [2022-12-14 15:26:11,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:26:11,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:26:11,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:26:12,432 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 15:26:12,433 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:26:12,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127560070] [2022-12-14 15:26:12,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127560070] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:26:12,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143892328] [2022-12-14 15:26:12,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:26:12,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:26:12,433 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:26:12,434 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:26:12,436 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 15:26:12,645 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-12-14 15:26:12,645 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:26:12,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 116 conjunts are in the unsatisfiable core [2022-12-14 15:26:12,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:26:12,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 15:26:12,680 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 15:26:12,720 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 19 [2022-12-14 15:26:14,986 INFO L321 Elim1Store]: treesize reduction 20, result has 77.0 percent of original size [2022-12-14 15:26:14,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 93 [2022-12-14 15:26:15,279 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:15,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:26:18,055 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_52| Int) (|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_53| Int) (|v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_54| Int) (v_ArrVal_221 (Array Int Int))) (let ((.cse2 (select v_ArrVal_221 |c_ULTIMATE.start_main_~nondetString2~0#1.offset|)) (.cse0 (select v_ArrVal_221 (+ |c_ULTIMATE.start_main_~nondetString2~0#1.offset| 1))) (.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetString2~0#1.base| v_ArrVal_221) |c_ULTIMATE.start_main_~nondetString1~0#1.base|))) (or (not (<= |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_54| (+ |c_ULTIMATE.start_main_~nondetString1~0#1.offset| 1))) (not (= .cse0 (select .cse1 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_53|))) (not (<= |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_52| (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_53| 1))) (= .cse0 0) (not (= .cse2 (select .cse1 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_52|))) (= .cse2 0) (not (<= |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_53| (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_54| 1))) (not (<= 0 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_52|)) (not (= .cse2 (select .cse1 |c_ULTIMATE.start_main_~nondetString1~0#1.offset|))) (not (= .cse0 (select .cse1 |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_54|))) (<= (+ |v_ULTIMATE.start_cstrpbrk_~sc1~0#1.offset_52| 2) (select |c_#length| |c_ULTIMATE.start_main_~nondetString1~0#1.base|))))) is different from false [2022-12-14 15:26:18,092 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:26:18,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 68 [2022-12-14 15:26:18,147 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:26:18,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 132 treesize of output 201 [2022-12-14 15:26:18,257 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:26:18,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 117 treesize of output 199 [2022-12-14 15:26:18,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 15:26:20,131 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:26:20,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143892328] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:26:20,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [550296483] [2022-12-14 15:26:20,133 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 15:26:20,133 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:26:20,133 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:26:20,133 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:26:20,133 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:26:20,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:26:20,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 15:26:20,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2022-12-14 15:26:20,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:26:20,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 24 [2022-12-14 15:26:20,694 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:26:22,857 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '3229#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-12-14 15:26:22,857 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:26:22,857 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:26:22,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 25, 25] total 65 [2022-12-14 15:26:22,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741434747] [2022-12-14 15:26:22,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:26:22,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-12-14 15:26:22,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:26:22,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-12-14 15:26:22,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=388, Invalid=5467, Unknown=1, NotChecked=150, Total=6006 [2022-12-14 15:26:22,859 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand has 67 states, 66 states have (on average 2.090909090909091) internal successors, (138), 66 states have internal predecessors, (138), 0 states have call successors, (0), 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-12-14 15:27:28,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:27:28,943 INFO L93 Difference]: Finished difference Result 564 states and 640 transitions. [2022-12-14 15:27:28,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2022-12-14 15:27:28,943 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 2.090909090909091) internal successors, (138), 66 states have internal predecessors, (138), 0 states have call successors, (0), 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-12-14 15:27:28,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:27:28,944 INFO L225 Difference]: With dead ends: 564 [2022-12-14 15:27:28,944 INFO L226 Difference]: Without dead ends: 564 [2022-12-14 15:27:28,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 253 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 21072 ImplicationChecksByTransitivity, 64.4s TimeCoverageRelationStatistics Valid=7190, Invalid=57075, Unknown=1, NotChecked=504, Total=64770 [2022-12-14 15:27:28,949 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 1274 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 5395 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 5714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 5395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 249 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-12-14 15:27:28,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 934 Invalid, 5714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 5395 Invalid, 0 Unknown, 249 Unchecked, 7.2s Time] [2022-12-14 15:27:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2022-12-14 15:27:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 276. [2022-12-14 15:27:28,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 275 states have (on average 1.1527272727272728) internal successors, (317), 275 states have internal predecessors, (317), 0 states have call successors, (0), 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-12-14 15:27:28,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 317 transitions. [2022-12-14 15:27:28,956 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 317 transitions. Word has length 48 [2022-12-14 15:27:28,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:27:28,956 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 317 transitions. [2022-12-14 15:27:28,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 2.090909090909091) internal successors, (138), 66 states have internal predecessors, (138), 0 states have call successors, (0), 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-12-14 15:27:28,956 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 317 transitions. [2022-12-14 15:27:28,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-12-14 15:27:28,957 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:27:28,958 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1] [2022-12-14 15:27:28,963 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 15:27:29,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-12-14 15:27:29,159 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:27:29,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:27:29,160 INFO L85 PathProgramCache]: Analyzing trace with hash -810627374, now seen corresponding path program 3 times [2022-12-14 15:27:29,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:27:29,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142426643] [2022-12-14 15:27:29,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:27:29,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:27:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:27:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 15:27:30,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:27:30,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142426643] [2022-12-14 15:27:30,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142426643] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:27:30,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835598720] [2022-12-14 15:27:30,031 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 15:27:30,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:27:30,031 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:27:30,032 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:27:30,033 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 15:27:30,098 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 15:27:30,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:27:30,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 123 conjunts are in the unsatisfiable core [2022-12-14 15:27:30,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:27:30,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-12-14 15:27:30,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 15:27:30,179 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 24 treesize of output 23 [2022-12-14 15:27:32,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:27:32,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:27:32,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:27:32,848 INFO L321 Elim1Store]: treesize reduction 20, result has 60.8 percent of original size [2022-12-14 15:27:32,848 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 60 [2022-12-14 15:27:32,946 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:32,946 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:27:35,114 INFO L321 Elim1Store]: treesize reduction 74, result has 40.3 percent of original size [2022-12-14 15:27:35,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 724 treesize of output 558 [2022-12-14 15:27:35,133 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:27:35,133 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 514 treesize of output 476 [2022-12-14 15:27:35,144 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 15:27:35,225 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:27:35,229 INFO L321 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-12-14 15:27:35,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 455 treesize of output 432 [2022-12-14 15:27:35,264 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:27:35,345 INFO L321 Elim1Store]: treesize reduction 15, result has 88.0 percent of original size [2022-12-14 15:27:35,346 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 205 treesize of output 259 [2022-12-14 15:27:35,981 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 15:27:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:27:36,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835598720] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:27:36,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [774334766] [2022-12-14 15:27:36,084 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 15:27:36,084 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:27:36,085 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:27:36,085 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:27:36,085 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:27:36,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:27:36,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 15:27:36,116 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2022-12-14 15:27:36,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:27:36,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 24 [2022-12-14 15:27:36,665 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:27:38,750 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4787#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-12-14 15:27:38,750 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:27:38,750 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:27:38,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 26, 27] total 68 [2022-12-14 15:27:38,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725244297] [2022-12-14 15:27:38,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:27:38,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-12-14 15:27:38,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:27:38,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-12-14 15:27:38,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=505, Invalid=5975, Unknown=0, NotChecked=0, Total=6480 [2022-12-14 15:27:38,752 INFO L87 Difference]: Start difference. First operand 276 states and 317 transitions. Second operand has 70 states, 69 states have (on average 2.0) internal successors, (138), 69 states have internal predecessors, (138), 0 states have call successors, (0), 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-12-14 15:28:35,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:28:35,989 INFO L93 Difference]: Finished difference Result 864 states and 987 transitions. [2022-12-14 15:28:35,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2022-12-14 15:28:35,990 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 2.0) internal successors, (138), 69 states have internal predecessors, (138), 0 states have call successors, (0), 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-12-14 15:28:35,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:28:35,992 INFO L225 Difference]: With dead ends: 864 [2022-12-14 15:28:35,993 INFO L226 Difference]: Without dead ends: 864 [2022-12-14 15:28:35,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 344 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24234 ImplicationChecksByTransitivity, 57.7s TimeCoverageRelationStatistics Valid=8153, Invalid=63403, Unknown=0, NotChecked=0, Total=71556 [2022-12-14 15:28:35,997 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 1622 mSDsluCounter, 1153 mSDsCounter, 0 mSdLazyCounter, 5657 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 5737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 5657 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:28:35,997 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 1187 Invalid, 5737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 5657 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-12-14 15:28:35,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 864 states. [2022-12-14 15:28:36,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 864 to 434. [2022-12-14 15:28:36,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 1.1547344110854503) internal successors, (500), 433 states have internal predecessors, (500), 0 states have call successors, (0), 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-12-14 15:28:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 500 transitions. [2022-12-14 15:28:36,010 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 500 transitions. Word has length 48 [2022-12-14 15:28:36,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:28:36,010 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 500 transitions. [2022-12-14 15:28:36,011 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 2.0) internal successors, (138), 69 states have internal predecessors, (138), 0 states have call successors, (0), 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-12-14 15:28:36,011 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 500 transitions. [2022-12-14 15:28:36,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-12-14 15:28:36,013 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:28:36,013 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1] [2022-12-14 15:28:36,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-12-14 15:28:36,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-12-14 15:28:36,215 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2022-12-14 15:28:36,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:28:36,216 INFO L85 PathProgramCache]: Analyzing trace with hash -684896319, now seen corresponding path program 4 times [2022-12-14 15:28:36,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:28:36,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809258104] [2022-12-14 15:28:36,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:28:36,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:28:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:28:37,069 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 111 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-14 15:28:37,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:28:37,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809258104] [2022-12-14 15:28:37,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809258104] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 15:28:37,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011198529] [2022-12-14 15:28:37,069 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 15:28:37,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:28:37,069 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:28:37,070 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:28:37,071 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ff69421-9893-4b86-9215-4672a49cc434/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 15:28:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:28:37,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 121 conjunts are in the unsatisfiable core [2022-12-14 15:28:37,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:28:37,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 15:28:37,174 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 15:28:37,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 17 treesize of output 19 [2022-12-14 15:29:43,115 INFO L321 Elim1Store]: treesize reduction 50, result has 79.6 percent of original size [2022-12-14 15:29:43,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 11 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 101 treesize of output 228 [2022-12-14 15:29:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 3 proven. 80 refuted. 31 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:29:44,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:29:47,996 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:29:47,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 203 treesize of output 115 [2022-12-14 15:29:48,135 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:29:48,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 298 treesize of output 436 [2022-12-14 15:29:48,281 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:29:48,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 10 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 18 case distinctions, treesize of input 214 treesize of output 332 [2022-12-14 15:29:48,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 15:33:21,462 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 114 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 15:33:21,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011198529] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:33:21,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [565111452] [2022-12-14 15:33:21,464 INFO L159 IcfgInterpreter]: Started Sifa with 13 locations of interest [2022-12-14 15:33:21,464 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:33:21,464 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:33:21,464 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:33:21,464 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:33:21,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:33:21,482 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 15:33:21,503 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 14 treesize of output 10 [2022-12-14 15:33:21,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:33:21,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 25 treesize of output 24 [2022-12-14 15:33:22,004 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:33:26,279 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '6855#(and (<= |ULTIMATE.start_cstrpbrk_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.offset|) (<= |ULTIMATE.start_cstrpbrk_#in~s2#1.offset| 0) (<= |ULTIMATE.start_cstrpbrk_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetString2~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_~s1#1.offset|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc13#1.base|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= |ULTIMATE.start_cstrpbrk_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrpbrk_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString1~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s2#1.offset|) (< (select |#length| |ULTIMATE.start_cstrpbrk_~sc1~0#1.base|) (+ |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrpbrk_~sc1~0#1.offset|) (<= |ULTIMATE.start_main_~nondetString1~0#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc12#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc12#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString2~0#1.base|) (<= 0 |ULTIMATE.start_cstrpbrk_#in~s1#1.offset|) (= |#NULL.base| 0))' at error location [2022-12-14 15:33:26,279 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:33:26,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 15:33:26,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 28, 28] total 71 [2022-12-14 15:33:26,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783792453] [2022-12-14 15:33:26,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 15:33:26,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-12-14 15:33:26,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:33:26,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-12-14 15:33:26,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=6428, Unknown=57, NotChecked=0, Total=6972 [2022-12-14 15:33:26,282 INFO L87 Difference]: Start difference. First operand 434 states and 500 transitions. Second operand has 73 states, 72 states have (on average 2.1527777777777777) internal successors, (155), 72 states have internal predecessors, (155), 0 states have call successors, (0), 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-12-14 15:33:38,128 WARN L233 SmtUtils]: Spent 7.23s on a formula simplification. DAG size of input: 135 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:33:45,029 WARN L233 SmtUtils]: Spent 6.46s on a formula simplification. DAG size of input: 139 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:33:55,000 WARN L233 SmtUtils]: Spent 9.63s on a formula simplification. DAG size of input: 184 DAG size of output: 92 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:34:01,870 WARN L233 SmtUtils]: Spent 6.73s on a formula simplification. DAG size of input: 186 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:34:10,232 WARN L233 SmtUtils]: Spent 8.05s on a formula simplification. DAG size of input: 191 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:34:18,757 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 130 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:34:24,675 WARN L233 SmtUtils]: Spent 5.78s on a formula simplification. DAG size of input: 194 DAG size of output: 85 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:34:31,827 WARN L233 SmtUtils]: Spent 6.99s on a formula simplification. DAG size of input: 133 DAG size of output: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:34:38,991 WARN L233 SmtUtils]: Spent 7.01s on a formula simplification. DAG size of input: 189 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:34:46,332 WARN L233 SmtUtils]: Spent 7.17s on a formula simplification. DAG size of input: 175 DAG size of output: 82 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:34:53,960 WARN L233 SmtUtils]: Spent 7.43s on a formula simplification. DAG size of input: 185 DAG size of output: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:35:00,343 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 179 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:35:07,717 WARN L233 SmtUtils]: Spent 7.26s on a formula simplification. DAG size of input: 176 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:35:15,252 WARN L233 SmtUtils]: Spent 7.35s on a formula simplification. DAG size of input: 190 DAG size of output: 140 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:35:20,398 WARN L233 SmtUtils]: Spent 5.01s on a formula simplification. DAG size of input: 184 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:35:22,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:35:38,135 WARN L233 SmtUtils]: Spent 10.25s on a formula simplification. DAG size of input: 165 DAG size of output: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:35:45,272 WARN L233 SmtUtils]: Spent 6.94s on a formula simplification. DAG size of input: 185 DAG size of output: 132 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:35:46,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:35:52,196 WARN L233 SmtUtils]: Spent 5.18s on a formula simplification. DAG size of input: 180 DAG size of output: 131 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:35:54,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:36:09,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:36:24,226 WARN L233 SmtUtils]: Spent 6.09s on a formula simplification. DAG size of input: 115 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:36:35,687 WARN L233 SmtUtils]: Spent 11.33s on a formula simplification. DAG size of input: 155 DAG size of output: 128 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:36:41,467 WARN L233 SmtUtils]: Spent 5.57s on a formula simplification. DAG size of input: 179 DAG size of output: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:37:03,558 WARN L233 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 179 DAG size of output: 120 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:37:04,624 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:37:05,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:37:11,477 WARN L233 SmtUtils]: Spent 5.34s on a formula simplification. DAG size of input: 174 DAG size of output: 119 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:37:18,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:37:20,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:37:43,436 WARN L233 SmtUtils]: Spent 9.91s on a formula simplification. DAG size of input: 131 DAG size of output: 103 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:37:45,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:37:58,662 WARN L233 SmtUtils]: Spent 6.07s on a formula simplification. DAG size of input: 122 DAG size of output: 99 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:38:12,022 WARN L233 SmtUtils]: Spent 7.76s on a formula simplification. DAG size of input: 186 DAG size of output: 149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:38:14,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:38:16,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:38:18,041 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:38:28,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:38:30,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:38:31,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:38:33,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-14 15:38:43,104 WARN L233 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 132 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:39:03,635 WARN L233 SmtUtils]: Spent 15.46s on a formula simplification. DAG size of input: 183 DAG size of output: 147 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:39:05,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:39:24,450 WARN L233 SmtUtils]: Spent 12.23s on a formula simplification. DAG size of input: 146 DAG size of output: 96 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:39:25,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:39:45,813 WARN L233 SmtUtils]: Spent 9.18s on a formula simplification. DAG size of input: 180 DAG size of output: 137 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 15:39:47,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 15:39:49,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]