./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 624eab544b12ce67976c98f49727abb376f7f963832aa58f07a7fb9fd050787e --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 23:42:17,657 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 23:42:17,661 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 23:42:17,713 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 23:42:17,714 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 23:42:17,719 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 23:42:17,723 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 23:42:17,727 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 23:42:17,729 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 23:42:17,736 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 23:42:17,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 23:42:17,741 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 23:42:17,742 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 23:42:17,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 23:42:17,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 23:42:17,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 23:42:17,753 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 23:42:17,754 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 23:42:17,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 23:42:17,765 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 23:42:17,767 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 23:42:17,770 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 23:42:17,772 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 23:42:17,773 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 23:42:17,786 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 23:42:17,787 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 23:42:17,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 23:42:17,790 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 23:42:17,790 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 23:42:17,792 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 23:42:17,792 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 23:42:17,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 23:42:17,798 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 23:42:17,800 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 23:42:17,802 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 23:42:17,802 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 23:42:17,803 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 23:42:17,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 23:42:17,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 23:42:17,806 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 23:42:17,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 23:42:17,809 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-11-25 23:42:17,870 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 23:42:17,870 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 23:42:17,871 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 23:42:17,871 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 23:42:17,873 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 23:42:17,873 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 23:42:17,873 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-25 23:42:17,874 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-25 23:42:17,874 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-25 23:42:17,875 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-25 23:42:17,876 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-25 23:42:17,876 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-25 23:42:17,877 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-25 23:42:17,877 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-25 23:42:17,877 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-25 23:42:17,878 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-25 23:42:17,878 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-25 23:42:17,878 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-25 23:42:17,879 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 23:42:17,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 23:42:17,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 23:42:17,880 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 23:42:17,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 23:42:17,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 23:42:17,882 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-25 23:42:17,882 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-25 23:42:17,883 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-25 23:42:17,883 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 23:42:17,884 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-25 23:42:17,884 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 23:42:17,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 23:42:17,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 23:42:17,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:42:17,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 23:42:17,886 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-25 23:42:17,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 23:42:17,887 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-25 23:42:17,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 23:42:17,888 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-25 23:42:17,888 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_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 624eab544b12ce67976c98f49727abb376f7f963832aa58f07a7fb9fd050787e [2022-11-25 23:42:18,286 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 23:42:18,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 23:42:18,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 23:42:18,323 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 23:42:18,326 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 23:42:18,327 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i [2022-11-25 23:42:21,733 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 23:42:22,233 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 23:42:22,234 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/sv-benchmarks/c/termination-memory-alloca/cstrcpy-alloca-2.i [2022-11-25 23:42:22,259 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/data/86ae3d5c0/1375473d7ce14a299f6dbb1ce03fbb5b/FLAG3e812956b [2022-11-25 23:42:22,286 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/data/86ae3d5c0/1375473d7ce14a299f6dbb1ce03fbb5b [2022-11-25 23:42:22,290 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 23:42:22,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 23:42:22,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 23:42:22,296 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 23:42:22,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 23:42:22,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:42:22" (1/1) ... [2022-11-25 23:42:22,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af87d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:22, skipping insertion in model container [2022-11-25 23:42:22,304 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 11:42:22" (1/1) ... [2022-11-25 23:42:22,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 23:42:22,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 23:42:22,830 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:42:22,847 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 23:42:22,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 23:42:22,961 INFO L208 MainTranslator]: Completed translation [2022-11-25 23:42:22,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:22 WrapperNode [2022-11-25 23:42:22,962 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 23:42:22,964 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 23:42:22,964 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 23:42:22,964 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 23:42:22,974 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:22" (1/1) ... [2022-11-25 23:42:22,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:22" (1/1) ... [2022-11-25 23:42:23,022 INFO L138 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2022-11-25 23:42:23,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 23:42:23,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 23:42:23,024 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 23:42:23,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 23:42:23,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:22" (1/1) ... [2022-11-25 23:42:23,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:22" (1/1) ... [2022-11-25 23:42:23,062 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:22" (1/1) ... [2022-11-25 23:42:23,062 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:22" (1/1) ... [2022-11-25 23:42:23,067 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:22" (1/1) ... [2022-11-25 23:42:23,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:22" (1/1) ... [2022-11-25 23:42:23,085 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:22" (1/1) ... [2022-11-25 23:42:23,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:22" (1/1) ... [2022-11-25 23:42:23,089 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 23:42:23,092 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 23:42:23,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 23:42:23,099 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 23:42:23,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:22" (1/1) ... [2022-11-25 23:42:23,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 23:42:23,120 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:23,136 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 23:42:23,157 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 23:42:23,195 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 23:42:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 23:42:23,196 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 23:42:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 23:42:23,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 23:42:23,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 23:42:23,356 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 23:42:23,358 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 23:42:23,605 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 23:42:23,715 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 23:42:23,715 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 23:42:23,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:42:23 BoogieIcfgContainer [2022-11-25 23:42:23,718 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 23:42:23,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 23:42:23,729 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 23:42:23,733 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 23:42:23,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 11:42:22" (1/3) ... [2022-11-25 23:42:23,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c50dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:42:23, skipping insertion in model container [2022-11-25 23:42:23,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 11:42:22" (2/3) ... [2022-11-25 23:42:23,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36c50dfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 11:42:23, skipping insertion in model container [2022-11-25 23:42:23,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 11:42:23" (3/3) ... [2022-11-25 23:42:23,737 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcpy-alloca-2.i [2022-11-25 23:42:23,786 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 23:42:23,786 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-25 23:42:23,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 23:42:23,868 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;@7f9fda39, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 23:42:23,869 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-25 23:42:23,874 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 9 states have (on average 2.111111111111111) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:23,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:42:23,882 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:23,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:42:23,883 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-25 23:42:23,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:23,891 INFO L85 PathProgramCache]: Analyzing trace with hash 85142, now seen corresponding path program 1 times [2022-11-25 23:42:23,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:23,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417708464] [2022-11-25 23:42:23,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:23,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:24,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:24,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417708464] [2022-11-25 23:42:24,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417708464] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:24,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:24,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-25 23:42:24,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4955280] [2022-11-25 23:42:24,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:24,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:42:24,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:24,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:42:24,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:42:24,187 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 2.111111111111111) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:24,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:24,276 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-11-25 23:42:24,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:42:24,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 23:42:24,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:24,288 INFO L225 Difference]: With dead ends: 18 [2022-11-25 23:42:24,289 INFO L226 Difference]: Without dead ends: 16 [2022-11-25 23:42:24,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:42:24,299 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:24,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:42:24,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-25 23:42:24,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-25 23:42:24,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:24,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-11-25 23:42:24,336 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 3 [2022-11-25 23:42:24,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:24,336 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-11-25 23:42:24,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:24,337 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-11-25 23:42:24,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:42:24,337 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:24,338 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:42:24,338 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 23:42:24,338 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-25 23:42:24,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:24,340 INFO L85 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2022-11-25 23:42:24,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:24,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328852996] [2022-11-25 23:42:24,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:24,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:24,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:24,526 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:24,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328852996] [2022-11-25 23:42:24,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328852996] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:24,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:24,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:42:24,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115179518] [2022-11-25 23:42:24,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:24,529 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 23:42:24,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:24,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 23:42:24,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:42:24,531 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:24,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:24,555 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-11-25 23:42:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 23:42:24,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 23:42:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:24,556 INFO L225 Difference]: With dead ends: 15 [2022-11-25 23:42:24,557 INFO L226 Difference]: Without dead ends: 15 [2022-11-25 23:42:24,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 23:42:24,559 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:24,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 7 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:42:24,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-25 23:42:24,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-25 23:42:24,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-25 23:42:24,563 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 3 [2022-11-25 23:42:24,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:24,564 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-25 23:42:24,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-25 23:42:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-25 23:42:24,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:24,565 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-25 23:42:24,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 23:42:24,566 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-25 23:42:24,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:24,567 INFO L85 PathProgramCache]: Analyzing trace with hash 85179, now seen corresponding path program 1 times [2022-11-25 23:42:24,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:24,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343633473] [2022-11-25 23:42:24,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:24,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:25,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:25,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343633473] [2022-11-25 23:42:25,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343633473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:25,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:25,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:42:25,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541163827] [2022-11-25 23:42:25,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:25,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:42:25,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:25,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:42:25,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:42:25,109 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:25,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:25,137 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-11-25 23:42:25,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:42:25,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-25 23:42:25,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:25,139 INFO L225 Difference]: With dead ends: 14 [2022-11-25 23:42:25,139 INFO L226 Difference]: Without dead ends: 14 [2022-11-25 23:42:25,140 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:42:25,142 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:25,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:42:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-25 23:42:25,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-25 23:42:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:25,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-11-25 23:42:25,147 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 3 [2022-11-25 23:42:25,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:25,147 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-11-25 23:42:25,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-11-25 23:42:25,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:42:25,149 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:25,149 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:42:25,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 23:42:25,150 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-25 23:42:25,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:25,151 INFO L85 PathProgramCache]: Analyzing trace with hash 81885786, now seen corresponding path program 1 times [2022-11-25 23:42:25,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:25,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202466843] [2022-11-25 23:42:25,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:25,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:25,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:25,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:25,301 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:25,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202466843] [2022-11-25 23:42:25,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202466843] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:25,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:25,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 23:42:25,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928321208] [2022-11-25 23:42:25,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:25,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:42:25,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:25,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:42:25,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:42:25,318 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:25,376 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-11-25 23:42:25,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:42:25,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:42:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:25,378 INFO L225 Difference]: With dead ends: 13 [2022-11-25 23:42:25,378 INFO L226 Difference]: Without dead ends: 13 [2022-11-25 23:42:25,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:42:25,380 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:25,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:42:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-11-25 23:42:25,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-11-25 23:42:25,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:25,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-11-25 23:42:25,385 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2022-11-25 23:42:25,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:25,385 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-11-25 23:42:25,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:25,386 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-11-25 23:42:25,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-25 23:42:25,386 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:25,387 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-25 23:42:25,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 23:42:25,387 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-25 23:42:25,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:25,388 INFO L85 PathProgramCache]: Analyzing trace with hash 81885787, now seen corresponding path program 1 times [2022-11-25 23:42:25,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:25,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372092981] [2022-11-25 23:42:25,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:25,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:25,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:25,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:25,593 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:25,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372092981] [2022-11-25 23:42:25,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372092981] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:25,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:25,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:42:25,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753176990] [2022-11-25 23:42:25,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:25,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:42:25,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:25,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:42:25,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:42:25,600 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:25,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:25,711 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-11-25 23:42:25,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:42:25,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-25 23:42:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:25,714 INFO L225 Difference]: With dead ends: 19 [2022-11-25 23:42:25,714 INFO L226 Difference]: Without dead ends: 19 [2022-11-25 23:42:25,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 23:42:25,718 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:25,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 12 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:42:25,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-25 23:42:25,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2022-11-25 23:42:25,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:25,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-25 23:42:25,729 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 5 [2022-11-25 23:42:25,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:25,731 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-25 23:42:25,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:25,731 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-25 23:42:25,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:42:25,735 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:25,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:42:25,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 23:42:25,736 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-25 23:42:25,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:25,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1756507928, now seen corresponding path program 1 times [2022-11-25 23:42:25,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:25,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957184368] [2022-11-25 23:42:25,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:25,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:25,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:26,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:26,074 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:26,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957184368] [2022-11-25 23:42:26,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957184368] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:26,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:26,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:42:26,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143871878] [2022-11-25 23:42:26,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:26,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 23:42:26,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:26,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 23:42:26,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 23:42:26,078 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:26,132 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-11-25 23:42:26,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 23:42:26,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 23:42:26,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:26,134 INFO L225 Difference]: With dead ends: 14 [2022-11-25 23:42:26,134 INFO L226 Difference]: Without dead ends: 14 [2022-11-25 23:42:26,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-11-25 23:42:26,136 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:26,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:42:26,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-25 23:42:26,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-25 23:42:26,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:26,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-11-25 23:42:26,141 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 6 [2022-11-25 23:42:26,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:26,141 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-11-25 23:42:26,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:26,142 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-11-25 23:42:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-25 23:42:26,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:26,146 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-25 23:42:26,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 23:42:26,146 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-25 23:42:26,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:26,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1756507927, now seen corresponding path program 1 times [2022-11-25 23:42:26,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:26,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303026335] [2022-11-25 23:42:26,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:26,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:26,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:26,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:26,545 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:26,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303026335] [2022-11-25 23:42:26,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303026335] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:26,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:26,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 23:42:26,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060940838] [2022-11-25 23:42:26,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:26,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 23:42:26,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:26,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 23:42:26,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-25 23:42:26,549 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:26,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:26,661 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-11-25 23:42:26,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 23:42:26,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-25 23:42:26,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:26,663 INFO L225 Difference]: With dead ends: 16 [2022-11-25 23:42:26,663 INFO L226 Difference]: Without dead ends: 16 [2022-11-25 23:42:26,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-11-25 23:42:26,665 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:26,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 7 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:42:26,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-25 23:42:26,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-11-25 23:42:26,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:26,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-25 23:42:26,669 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 6 [2022-11-25 23:42:26,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:26,670 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-25 23:42:26,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:26,671 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-25 23:42:26,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:42:26,671 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:26,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:26,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 23:42:26,672 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-25 23:42:26,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:26,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1753858779, now seen corresponding path program 1 times [2022-11-25 23:42:26,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:26,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949798391] [2022-11-25 23:42:26,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:26,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:26,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:26,860 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:26,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949798391] [2022-11-25 23:42:26,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949798391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 23:42:26,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 23:42:26,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 23:42:26,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115675491] [2022-11-25 23:42:26,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 23:42:26,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 23:42:26,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:26,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 23:42:26,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:42:26,863 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:26,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:26,884 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-11-25 23:42:26,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 23:42:26,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-25 23:42:26,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:26,885 INFO L225 Difference]: With dead ends: 14 [2022-11-25 23:42:26,886 INFO L226 Difference]: Without dead ends: 12 [2022-11-25 23:42:26,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 23:42:26,887 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:26,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 10 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 23:42:26,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-25 23:42:26,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-25 23:42:26,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 1.2) internal successors, (12), 11 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-11-25 23:42:26,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-11-25 23:42:26,891 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2022-11-25 23:42:26,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:26,892 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-11-25 23:42:26,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:26,892 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-11-25 23:42:26,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-25 23:42:26,893 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:26,893 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:26,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 23:42:26,894 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-25 23:42:26,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:26,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1753860003, now seen corresponding path program 1 times [2022-11-25 23:42:26,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:26,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534883422] [2022-11-25 23:42:26,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:26,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:26,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:27,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:27,302 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:27,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534883422] [2022-11-25 23:42:27,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534883422] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:27,303 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [359748539] [2022-11-25 23:42:27,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:27,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:27,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:27,311 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:27,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 23:42:27,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:27,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 35 conjunts are in the unsatisfiable core [2022-11-25 23:42:27,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:27,549 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-11-25 23:42:27,741 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:42:27,742 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 20 treesize of output 17 [2022-11-25 23:42:27,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:27,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:28,339 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-11-25 23:42:28,352 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-11-25 23:42:28,370 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 31 treesize of output 23 [2022-11-25 23:42:28,405 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:28,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [359748539] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:28,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1460063313] [2022-11-25 23:42:28,431 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-25 23:42:28,432 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:42:28,438 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:42:28,448 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:42:28,449 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:42:28,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:28,550 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-11-25 23:42:28,615 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-11-25 23:42:28,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:28,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:28,808 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:42:28,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-25 23:42:29,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:29,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:29,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:29,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:29,052 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:42:29,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2022-11-25 23:42:29,247 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:42:29,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-11-25 23:42:29,408 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:42:30,492 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '374#(and (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.base|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 1 |ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~dst~0#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 1 |ULTIMATE.start_cstrcpy_~dst~0#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.offset|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-11-25 23:42:30,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:42:30,492 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:42:30,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-11-25 23:42:30,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390526334] [2022-11-25 23:42:30,493 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:42:30,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 23:42:30,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:30,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 23:42:30,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2022-11-25 23:42:30,495 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:30,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:30,922 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-11-25 23:42:30,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 23:42:30,923 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-25 23:42:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:30,924 INFO L225 Difference]: With dead ends: 18 [2022-11-25 23:42:30,924 INFO L226 Difference]: Without dead ends: 18 [2022-11-25 23:42:30,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=155, Invalid=837, Unknown=0, NotChecked=0, Total=992 [2022-11-25 23:42:30,925 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 45 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:30,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 7 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 23:42:30,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-25 23:42:30,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2022-11-25 23:42:30,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:30,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-25 23:42:30,929 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 9 [2022-11-25 23:42:30,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:30,929 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-25 23:42:30,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:30,930 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-25 23:42:30,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-25 23:42:30,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:30,931 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-11-25 23:42:30,939 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:31,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:31,132 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-25 23:42:31,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1464914783, now seen corresponding path program 1 times [2022-11-25 23:42:31,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:31,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529693659] [2022-11-25 23:42:31,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:31,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:31,890 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:31,890 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:31,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529693659] [2022-11-25 23:42:31,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529693659] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:31,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454123585] [2022-11-25 23:42:31,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:31,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:31,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:31,906 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:31,937 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 23:42:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:32,013 WARN L261 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 73 conjunts are in the unsatisfiable core [2022-11-25 23:42:32,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:32,085 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-11-25 23:42:32,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 13 [2022-11-25 23:42:32,226 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-11-25 23:42:32,493 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:42:32,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2022-11-25 23:42:32,851 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:32,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:33,252 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-11-25 23:42:33,261 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 14 treesize of output 12 [2022-11-25 23:42:33,369 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:33,430 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:33,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454123585] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:33,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1785156060] [2022-11-25 23:42:33,433 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-25 23:42:33,433 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:42:33,434 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:42:33,434 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:42:33,434 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:42:33,473 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:33,477 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-11-25 23:42:33,526 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-11-25 23:42:33,642 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:33,645 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:33,654 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:42:33,655 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-25 23:42:33,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:33,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:33,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:33,871 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:33,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:33,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:33,888 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:42:33,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 52 [2022-11-25 23:42:34,034 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:42:34,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-11-25 23:42:34,169 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:42:35,538 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '507#(and (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.base|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (= (select |#valid| |ULTIMATE.start_cstrcpy_#t~post3#1.base|) 1) (= |ULTIMATE.start_cstrcpy_#t~mem4#1| (select (select |#memory_int| |ULTIMATE.start_cstrcpy_#t~post3#1.base|) |ULTIMATE.start_cstrcpy_#t~post3#1.offset|)) (<= 0 |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 1 |ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= (+ |ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcpy_#t~post3#1.base|)) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~dst~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 1 |ULTIMATE.start_cstrcpy_~dst~0#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post2#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post2#1.offset| 1)) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.offset|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-11-25 23:42:35,539 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:42:35,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:42:35,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-11-25 23:42:35,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813499024] [2022-11-25 23:42:35,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:42:35,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 23:42:35,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:35,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 23:42:35,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=873, Unknown=0, NotChecked=0, Total=992 [2022-11-25 23:42:35,542 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:37,920 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-11-25 23:42:37,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-25 23:42:37,921 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 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 10 [2022-11-25 23:42:37,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:37,922 INFO L225 Difference]: With dead ends: 16 [2022-11-25 23:42:37,922 INFO L226 Difference]: Without dead ends: 16 [2022-11-25 23:42:37,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=252, Invalid=1388, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 23:42:37,924 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 62 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:37,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 3 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:42:37,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-25 23:42:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2022-11-25 23:42:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-11-25 23:42:37,929 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2022-11-25 23:42:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:37,930 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-11-25 23:42:37,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-11-25 23:42:37,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-25 23:42:37,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:37,931 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2022-11-25 23:42:37,944 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:38,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 23:42:38,139 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-25 23:42:38,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:38,140 INFO L85 PathProgramCache]: Analyzing trace with hash -113626901, now seen corresponding path program 2 times [2022-11-25 23:42:38,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:38,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698414434] [2022-11-25 23:42:38,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:38,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:39,159 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:39,159 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:39,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698414434] [2022-11-25 23:42:39,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698414434] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:39,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680748399] [2022-11-25 23:42:39,160 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:42:39,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:39,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:39,164 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:39,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 23:42:39,279 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-25 23:42:39,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:42:39,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-25 23:42:39,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:39,303 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:42:39,304 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 9 treesize of output 15 [2022-11-25 23:42:39,308 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-11-25 23:42:39,347 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 13 treesize of output 9 [2022-11-25 23:42:39,553 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 23 treesize of output 23 [2022-11-25 23:42:39,782 INFO L321 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-11-25 23:42:39,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 23 [2022-11-25 23:42:39,943 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:39,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:40,592 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:42:40,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 36 [2022-11-25 23:42:40,624 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2022-11-25 23:42:40,624 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 31 [2022-11-25 23:42:40,633 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:40,641 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:42:40,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 35 [2022-11-25 23:42:40,685 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 7 treesize of output 3 [2022-11-25 23:42:40,777 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:40,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680748399] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:40,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1115167642] [2022-11-25 23:42:40,779 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-25 23:42:40,779 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:42:40,779 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:42:40,780 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:42:40,780 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:42:40,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:40,838 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-11-25 23:42:40,889 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-11-25 23:42:40,985 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:40,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:40,996 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:42:40,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-25 23:42:41,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:41,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:41,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:41,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:41,158 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:42:41,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 54 [2022-11-25 23:42:41,298 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:42:41,298 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-11-25 23:42:41,459 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:42:42,673 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '664#(and (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.base|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 1 |ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~dst~0#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 1 |ULTIMATE.start_cstrcpy_~dst~0#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.offset|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-11-25 23:42:42,674 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:42:42,674 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:42:42,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2022-11-25 23:42:42,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625067515] [2022-11-25 23:42:42,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:42:42,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-11-25 23:42:42,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:42,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-11-25 23:42:42,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1201, Unknown=2, NotChecked=0, Total=1332 [2022-11-25 23:42:42,676 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:44,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:44,478 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-11-25 23:42:44,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 23:42:44,480 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 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-11-25 23:42:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:44,481 INFO L225 Difference]: With dead ends: 20 [2022-11-25 23:42:44,481 INFO L226 Difference]: Without dead ends: 20 [2022-11-25 23:42:44,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 425 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=268, Invalid=1986, Unknown=2, NotChecked=0, Total=2256 [2022-11-25 23:42:44,484 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 45 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:44,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 6 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 23:42:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-25 23:42:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-11-25 23:42:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:44,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-11-25 23:42:44,489 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 13 [2022-11-25 23:42:44,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:44,490 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-11-25 23:42:44,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:44,490 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-11-25 23:42:44,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 23:42:44,491 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:44,491 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1] [2022-11-25 23:42:44,508 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-25 23:42:44,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:44,695 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-25 23:42:44,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:44,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2105849395, now seen corresponding path program 3 times [2022-11-25 23:42:44,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:44,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838758475] [2022-11-25 23:42:44,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:44,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:45,702 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:45,702 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:45,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838758475] [2022-11-25 23:42:45,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838758475] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:45,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838277327] [2022-11-25 23:42:45,703 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:42:45,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:45,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:45,704 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:45,713 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 23:42:45,810 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:42:45,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:42:45,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 94 conjunts are in the unsatisfiable core [2022-11-25 23:42:45,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:45,835 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:42:45,835 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 9 treesize of output 15 [2022-11-25 23:42:45,869 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 13 treesize of output 9 [2022-11-25 23:42:46,136 INFO L321 Elim1Store]: treesize reduction 34, result has 49.3 percent of original size [2022-11-25 23:42:46,139 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 46 [2022-11-25 23:42:46,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:46,575 INFO L321 Elim1Store]: treesize reduction 56, result has 49.1 percent of original size [2022-11-25 23:42:46,576 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 75 [2022-11-25 23:42:46,960 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:42:46,961 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 17 treesize of output 15 [2022-11-25 23:42:47,107 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:47,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:42:48,455 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 411 treesize of output 403 [2022-11-25 23:42:48,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 360 treesize of output 346 [2022-11-25 23:42:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:49,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838277327] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:42:49,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1651826752] [2022-11-25 23:42:49,085 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-25 23:42:49,085 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:42:49,085 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:42:49,086 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:42:49,086 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:42:49,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:49,145 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-11-25 23:42:49,182 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-11-25 23:42:49,279 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:42:49,281 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:49,289 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:42:49,290 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-25 23:42:49,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:49,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:49,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:49,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:42:49,430 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:42:49,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 54 [2022-11-25 23:42:49,558 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:42:49,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-11-25 23:42:49,668 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:42:50,826 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '868#(and (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.base|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 1 |ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~dst~0#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 1 |ULTIMATE.start_cstrcpy_~dst~0#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.offset|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-11-25 23:42:50,826 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:42:50,826 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:42:50,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 41 [2022-11-25 23:42:50,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554198048] [2022-11-25 23:42:50,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:42:50,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-11-25 23:42:50,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:42:50,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-11-25 23:42:50,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=2068, Unknown=0, NotChecked=0, Total=2256 [2022-11-25 23:42:50,830 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:55,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:42:55,019 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2022-11-25 23:42:55,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-25 23:42:55,020 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 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 17 [2022-11-25 23:42:55,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:42:55,021 INFO L225 Difference]: With dead ends: 28 [2022-11-25 23:42:55,021 INFO L226 Difference]: Without dead ends: 28 [2022-11-25 23:42:55,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=439, Invalid=3721, Unknown=0, NotChecked=0, Total=4160 [2022-11-25 23:42:55,023 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 105 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 23 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:42:55,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1 Invalid, 438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 414 Invalid, 1 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 23:42:55,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-25 23:42:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-11-25 23:42:55,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:55,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2022-11-25 23:42:55,027 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 17 [2022-11-25 23:42:55,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:42:55,027 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2022-11-25 23:42:55,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 42 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:42:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2022-11-25 23:42:55,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 23:42:55,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:42:55,029 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1] [2022-11-25 23:42:55,036 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 23:42:55,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:55,236 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-25 23:42:55,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:42:55,237 INFO L85 PathProgramCache]: Analyzing trace with hash -30403389, now seen corresponding path program 4 times [2022-11-25 23:42:55,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:42:55,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539353924] [2022-11-25 23:42:55,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:42:55,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:42:55,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:56,683 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:42:56,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539353924] [2022-11-25 23:42:56,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539353924] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:42:56,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640669213] [2022-11-25 23:42:56,683 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-25 23:42:56,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:42:56,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:42:56,684 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:42:56,731 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 23:42:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:42:56,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 117 conjunts are in the unsatisfiable core [2022-11-25 23:42:56,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:42:56,865 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-11-25 23:42:56,913 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 13 treesize of output 9 [2022-11-25 23:42:57,154 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 23 treesize of output 23 [2022-11-25 23:42:57,505 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 31 treesize of output 29 [2022-11-25 23:42:57,960 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 39 treesize of output 35 [2022-11-25 23:42:58,399 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 49 treesize of output 43 [2022-11-25 23:42:58,839 INFO L321 Elim1Store]: treesize reduction 16, result has 61.0 percent of original size [2022-11-25 23:42:58,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 47 [2022-11-25 23:42:59,122 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:42:59,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:43:02,071 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-11-25 23:43:02,083 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:43:02,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 72 [2022-11-25 23:43:02,097 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 113 treesize of output 103 [2022-11-25 23:43:02,102 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 7 treesize of output 3 [2022-11-25 23:43:02,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 7 treesize of output 3 [2022-11-25 23:43:02,140 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 80 [2022-11-25 23:43:02,167 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 7 treesize of output 3 [2022-11-25 23:43:02,174 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 7 treesize of output 3 [2022-11-25 23:43:02,337 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-11-25 23:43:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:43:02,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1640669213] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:43:02,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1659671463] [2022-11-25 23:43:02,373 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-25 23:43:02,374 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:43:02,374 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:43:02,374 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:43:02,374 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:43:02,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:02,413 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-11-25 23:43:02,455 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-11-25 23:43:02,545 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:02,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:02,556 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:43:02,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-25 23:43:02,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:02,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:02,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:02,712 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:43:02,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:02,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:43:02,727 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:43:02,728 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2022-11-25 23:43:02,850 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:43:02,851 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-11-25 23:43:02,973 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:43:04,444 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1171#(and (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.base|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 1 |ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~dst~0#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 1 |ULTIMATE.start_cstrcpy_~dst~0#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.offset|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-11-25 23:43:04,444 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:43:04,444 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:43:04,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 23] total 64 [2022-11-25 23:43:04,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124716113] [2022-11-25 23:43:04,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:43:04,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-25 23:43:04,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:43:04,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-25 23:43:04,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=4609, Unknown=40, NotChecked=0, Total=4970 [2022-11-25 23:43:04,449 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand has 65 states, 64 states have (on average 1.15625) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:43:16,340 WARN L233 SmtUtils]: Spent 8.90s on a formula simplification. DAG size of input: 130 DAG size of output: 120 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:43:31,676 WARN L233 SmtUtils]: Spent 15.05s on a formula simplification. DAG size of input: 156 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:43:50,829 WARN L233 SmtUtils]: Spent 18.80s on a formula simplification. DAG size of input: 143 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:43:59,533 WARN L233 SmtUtils]: Spent 8.45s on a formula simplification. DAG size of input: 103 DAG size of output: 87 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:44:18,604 WARN L233 SmtUtils]: Spent 18.80s on a formula simplification. DAG size of input: 104 DAG size of output: 98 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:44:27,805 WARN L233 SmtUtils]: Spent 8.93s on a formula simplification. DAG size of input: 116 DAG size of output: 112 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:44:32,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:44:32,625 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2022-11-25 23:44:32,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-11-25 23:44:32,626 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.15625) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-25 23:44:32,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:44:32,626 INFO L225 Difference]: With dead ends: 44 [2022-11-25 23:44:32,627 INFO L226 Difference]: Without dead ends: 44 [2022-11-25 23:44:32,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1867 ImplicationChecksByTransitivity, 92.9s TimeCoverageRelationStatistics Valid=941, Invalid=9502, Unknown=63, NotChecked=0, Total=10506 [2022-11-25 23:44:32,631 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 177 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 53 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-11-25 23:44:32,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 0 Invalid, 828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 749 Invalid, 26 Unknown, 0 Unchecked, 1.5s Time] [2022-11-25 23:44:32,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-25 23:44:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 42. [2022-11-25 23:44:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.024390243902439) internal successors, (42), 41 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:44:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2022-11-25 23:44:32,635 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 25 [2022-11-25 23:44:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:44:32,636 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2022-11-25 23:44:32,636 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.15625) internal successors, (74), 65 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:44:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2022-11-25 23:44:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 23:44:32,637 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:44:32,638 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 1, 1, 1, 1] [2022-11-25 23:44:32,643 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 23:44:32,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:44:32,839 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-25 23:44:32,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:44:32,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1260903965, now seen corresponding path program 5 times [2022-11-25 23:44:32,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:44:32,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711886379] [2022-11-25 23:44:32,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:44:32,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:44:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:44:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:44:36,162 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:44:36,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711886379] [2022-11-25 23:44:36,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711886379] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:44:36,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822494479] [2022-11-25 23:44:36,163 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 23:44:36,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:44:36,163 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:44:36,175 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:44:36,195 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 23:44:36,548 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2022-11-25 23:44:36,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:44:36,555 WARN L261 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 229 conjunts are in the unsatisfiable core [2022-11-25 23:44:36,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:44:36,572 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-11-25 23:44:36,659 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 13 treesize of output 9 [2022-11-25 23:44:37,077 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 23 treesize of output 23 [2022-11-25 23:44:37,651 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 31 treesize of output 29 [2022-11-25 23:44:38,287 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 39 treesize of output 35 [2022-11-25 23:44:39,016 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 49 treesize of output 43 [2022-11-25 23:44:39,921 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 55 treesize of output 47 [2022-11-25 23:44:40,912 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 65 treesize of output 55 [2022-11-25 23:44:42,014 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 71 treesize of output 59 [2022-11-25 23:44:43,135 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 81 treesize of output 67 [2022-11-25 23:44:44,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:44,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:44,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:44,084 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:44,085 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:44,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:44,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:44,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:44,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:44,100 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:44,104 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:44,110 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:44,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:44,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:44:44,194 INFO L321 Elim1Store]: treesize reduction 32, result has 57.3 percent of original size [2022-11-25 23:44:44,195 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 9 case distinctions, treesize of input 85 treesize of output 81 [2022-11-25 23:44:44,209 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-11-25 23:44:44,230 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-11-25 23:44:44,771 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:44:44,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 23:45:49,724 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-25 23:45:49,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 198 treesize of output 120 [2022-11-25 23:45:49,737 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 213 treesize of output 195 [2022-11-25 23:45:49,746 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 7 treesize of output 3 [2022-11-25 23:45:49,754 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 7 treesize of output 3 [2022-11-25 23:45:49,759 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 7 treesize of output 3 [2022-11-25 23:45:49,765 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 7 treesize of output 3 [2022-11-25 23:45:49,770 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 7 treesize of output 3 [2022-11-25 23:45:49,802 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 148 [2022-11-25 23:45:49,820 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-11-25 23:45:49,946 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-11-25 23:45:49,985 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 7 treesize of output 3 [2022-11-25 23:45:49,990 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 7 treesize of output 3 [2022-11-25 23:45:49,996 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 7 treesize of output 3 [2022-11-25 23:45:50,271 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:45:50,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822494479] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 23:45:50,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [52964889] [2022-11-25 23:45:50,274 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-11-25 23:45:50,274 INFO L166 IcfgInterpreter]: Building call graph [2022-11-25 23:45:50,274 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-25 23:45:50,275 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-25 23:45:50,275 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-25 23:45:50,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:50,327 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-11-25 23:45:50,372 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-11-25 23:45:50,457 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-25 23:45:50,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:50,469 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:45:50,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 31 [2022-11-25 23:45:50,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:50,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:50,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:50,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:45:50,629 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-25 23:45:50,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 54 [2022-11-25 23:45:50,736 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-25 23:45:50,737 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-11-25 23:45:50,866 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-25 23:45:53,815 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1675#(and (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.base|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 1 |ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post2#1.offset|) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~dst~0#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post3#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 1 |ULTIMATE.start_cstrcpy_~dst~0#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post3#1.offset|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-11-25 23:45:53,815 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-25 23:45:53,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 23:45:53,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 39, 39] total 107 [2022-11-25 23:45:53,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227172309] [2022-11-25 23:45:53,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 23:45:53,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-11-25 23:45:53,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-25 23:45:53,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-11-25 23:45:53,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=767, Invalid=11801, Unknown=314, NotChecked=0, Total=12882 [2022-11-25 23:45:53,821 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand has 108 states, 107 states have (on average 1.1308411214953271) internal successors, (121), 108 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:46:09,421 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|)) (.cse19 (div |c_ULTIMATE.start_main_~length2~0#1| 18446744073709551616))) (let ((.cse8 (<= (+ .cse19 1) 0)) (.cse7 (+ (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (* 18446744073709551616 .cse19))) (.cse16 (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse11 (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse10 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse2 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse0 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse4 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse12 (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse5 (= (select .cse6 |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|) 0))) (and (or (<= .cse0 .cse1) (not (<= 0 .cse2)) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_256))) (or (= (select (select (store .cse3 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select .cse3 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse3 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) .cse5) (not (= (select .cse6 6) 0)) (or (<= .cse7 |c_ULTIMATE.start_main_~length2~0#1|) .cse8) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_254))) (or (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse10) 0) (= (select (select .cse9 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse9 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (<= .cse11 .cse1) .cse5 (not (<= 0 .cse0))) (= 0 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) (= (+ |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset| 1) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or (<= .cse12 .cse1) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_255))) (or (= (select (select (store .cse13 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse10) 0) (= (select (select .cse13 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse13 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0) (= (select (select (store .cse13 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)))) .cse5 (not (<= 0 .cse10))) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= 0 (select .cse6 (+ (- 1) |ULTIMATE.start_main_~length2~0#1|))) (<= |ULTIMATE.start_main_~length2~0#1| (select |c_#length| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|)))) (not (= (select .cse6 5) 0)) (= |c_ULTIMATE.start_cstrcpy_#t~post3#1.base| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_257))) (or (= (select (select .cse14 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (not (<= 0 .cse4)) (<= .cse10 .cse1) .cse5) (not (= (select .cse6 0) 0)) (or (not .cse8) (<= |c_ULTIMATE.start_main_~length2~0#1| .cse7)) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset| 8) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_253))) (or (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse10) 0) (= (select (select .cse15 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse12) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse15 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (<= .cse16 .cse1) .cse5 (not (<= 0 .cse12))) (not (= (select .cse6 (+ (- 1) |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|)) 0)) (not (= 0 (select .cse6 1))) (or (not (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (<= .cse2 .cse1) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) .cse5) (not (= 0 (select .cse6 4))) (not (= (select .cse6 2) 0)) (not (= (select .cse6 3) 0)) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_251 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_251))) (or (= (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse12) 0) (= (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse10) 0) (= (select (select .cse17 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= 0 (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_252) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4)) (= (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse11) 0) (= (select (select (store .cse17 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse16) 0)))) (<= (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse1) (not (<= 0 .cse16)) .cse5) (or (not (<= 0 .cse11)) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_252))) (or (= (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse11) 0) (= (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse10) 0) (= (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0) (= (select (select .cse18 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse12) 0)))) (<= (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse1) .cse5)))) is different from true [2022-11-25 23:49:41,969 WARN L233 SmtUtils]: Spent 2.77m on a formula simplification. DAG size of input: 233 DAG size of output: 217 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:49:43,981 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 [1] [2022-11-25 23:49:45,056 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:49:47,060 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 [1] [2022-11-25 23:49:49,327 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 [1] [2022-11-25 23:49:51,567 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 [1] [2022-11-25 23:49:54,455 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 [1] [2022-11-25 23:49:55,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:50:00,501 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse6 (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) (.cse5 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse3 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse8 (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse4 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse2 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))) (and (or (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) .cse1 (forall ((v_ArrVal_257 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (<= .cse3 .cse4) (not (<= 0 .cse0))) (or .cse1 (not (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (<= .cse0 .cse4)) (or (forall ((v_ArrVal_257 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) .cse1 (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0)) (<= .cse6 .cse4) (forall ((v_ArrVal_256 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (not (<= 0 .cse5))) (or (forall ((v_ArrVal_257 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (forall ((v_ArrVal_254 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) .cse1 (forall ((v_ArrVal_255 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_256 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0)) (<= .cse7 .cse4) (not (<= 0 .cse6))) (= 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or .cse1 (<= .cse8 .cse4) (forall ((v_ArrVal_256 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_255 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_257 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0)) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse3) 0)) (not (<= 0 .cse3))) (or (forall ((v_ArrVal_254 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0)) .cse1 (forall ((v_ArrVal_252 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_252) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)) (forall ((v_ArrVal_256 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) (<= (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse4) (forall ((v_ArrVal_253 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0)) (not (<= 0 .cse7)) (forall ((v_ArrVal_257 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse8) 0)) (forall ((v_ArrVal_255 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse3) 0))) (<= .cse2 .cse4) (or .cse1 (not (<= 0 .cse2)) (<= .cse5 .cse4) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0))) (or (forall ((v_ArrVal_257 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse6) 0)) .cse1 (forall ((v_ArrVal_255 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 0)) (not (<= 0 .cse8)) (forall ((v_ArrVal_256 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse3) 0)) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse8) 0)) (<= (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse4) (forall ((v_ArrVal_254 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0)) (forall ((v_ArrVal_253 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0))))) is different from false [2022-11-25 23:50:01,470 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse13 (<= 0 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse8 (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse7 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse2 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse0 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse4 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse9 (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse1 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse5 (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|) |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|) 0))) (and (or (<= .cse0 .cse1) (not (<= 0 .cse2)) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_256))) (or (= (select (select (store .cse3 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select .cse3 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse3 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) .cse5) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_254))) (or (= (select (select (store .cse6 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0) (= (select (select .cse6 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse6 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse6 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse6 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (<= .cse8 .cse1) .cse5 (not (<= 0 .cse0))) (or (<= .cse9 .cse1) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_255))) (or (= (select (select (store .cse10 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0) (= (select (select .cse10 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse10 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0) (= (select (select (store .cse10 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0)))) .cse5 (not (<= 0 .cse7))) (= |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset| 9) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_257))) (or (= (select (select .cse11 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse11 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (not (<= 0 .cse4)) (<= .cse7 .cse1) .cse5) (or (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_253))) (or (= (select (select (store .cse12 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0) (= (select (select .cse12 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse12 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse12 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse9) 0) (= (select (select (store .cse12 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse12 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0)))) (<= (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse1) .cse5 (not (<= 0 .cse9))) (or (not .cse13) (<= .cse2 .cse1) (forall ((v_ArrVal_259 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0)) .cse5) (or (not (<= 0 |c_ULTIMATE.start_cstrcpy_#t~post3#1.offset|)) (and .cse13 (<= .cse4 .cse1)) .cse5) (<= 10 (select |c_#length| |c_ULTIMATE.start_cstrcpy_#t~post3#1.base|)) (or (not (<= 0 .cse8)) (forall ((v_ArrVal_259 (Array Int Int)) (v_ArrVal_252 (Array Int Int)) (v_ArrVal_254 (Array Int Int)) (v_ArrVal_253 (Array Int Int)) (v_ArrVal_256 (Array Int Int)) (v_ArrVal_255 (Array Int Int)) (v_ArrVal_257 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post2#1.base| v_ArrVal_252))) (or (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_259) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse8) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_255) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse7) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_254) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse2) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_256) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse0) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_253) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 0) (= (select (select .cse14 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 0) (= (select (select (store .cse14 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_257) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse9) 0)))) (<= (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) .cse1) .cse5))) is different from false [2022-11-25 23:52:01,138 WARN L233 SmtUtils]: Spent 1.67m on a formula simplification. DAG size of input: 190 DAG size of output: 177 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:52:03,145 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 [1] [2022-11-25 23:52:04,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:52:07,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:52:10,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:52:12,418 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 [1] [2022-11-25 23:52:16,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:52:17,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:52:19,323 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 [1] [2022-11-25 23:53:01,862 WARN L233 SmtUtils]: Spent 31.80s on a formula simplification. DAG size of input: 161 DAG size of output: 149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:53:03,956 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 [1] [2022-11-25 23:53:06,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-11-25 23:54:21,159 WARN L233 SmtUtils]: Spent 1.15m on a formula simplification. DAG size of input: 174 DAG size of output: 158 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:54:23,369 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 [1] [2022-11-25 23:54:25,685 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 [1] [2022-11-25 23:54:45,419 WARN L233 SmtUtils]: Spent 12.48s on a formula simplification. DAG size of input: 140 DAG size of output: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-25 23:54:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 23:54:59,667 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2022-11-25 23:54:59,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-25 23:54:59,667 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 107 states have (on average 1.1308411214953271) internal successors, (121), 108 states have internal predecessors, (121), 0 states have call successors, (0), 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 41 [2022-11-25 23:54:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 23:54:59,668 INFO L225 Difference]: With dead ends: 78 [2022-11-25 23:54:59,668 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 23:54:59,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 5212 ImplicationChecksByTransitivity, 572.3s TimeCoverageRelationStatistics Valid=2383, Invalid=26194, Unknown=505, NotChecked=1020, Total=30102 [2022-11-25 23:54:59,675 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 149 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2039 mSolverCounterSat, 96 mSolverCounterUnsat, 85 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 2223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2039 IncrementalHoareTripleChecker+Invalid, 85 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 47.9s IncrementalHoareTripleChecker+Time [2022-11-25 23:54:59,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 5 Invalid, 2223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2039 Invalid, 85 Unknown, 3 Unchecked, 47.9s Time] [2022-11-25 23:54:59,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 23:54:59,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-11-25 23:54:59,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.0129870129870129) internal successors, (78), 77 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:59,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2022-11-25 23:54:59,680 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 41 [2022-11-25 23:54:59,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 23:54:59,681 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2022-11-25 23:54:59,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 107 states have (on average 1.1308411214953271) internal successors, (121), 108 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 23:54:59,681 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2022-11-25 23:54:59,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-25 23:54:59,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 23:54:59,683 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 1, 1, 1, 1] [2022-11-25 23:54:59,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 23:54:59,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:54:59,887 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-25 23:54:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 23:54:59,887 INFO L85 PathProgramCache]: Analyzing trace with hash 233809259, now seen corresponding path program 6 times [2022-11-25 23:54:59,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-25 23:54:59,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109269369] [2022-11-25 23:54:59,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 23:54:59,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 23:55:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 23:55:08,855 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:55:08,856 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-25 23:55:08,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109269369] [2022-11-25 23:55:08,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109269369] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 23:55:08,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464216520] [2022-11-25 23:55:08,857 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 23:55:08,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 23:55:08,857 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 [2022-11-25 23:55:08,859 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 23:55:08,865 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_24c2d8d8-c84b-4b99-abf0-0516a2bb1411/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 23:55:11,466 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 23:55:11,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 23:55:11,480 WARN L261 TraceCheckSpWp]: Trace formula consists of 656 conjuncts, 391 conjunts are in the unsatisfiable core [2022-11-25 23:55:11,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 23:55:11,508 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-25 23:55:11,508 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 9 treesize of output 15 [2022-11-25 23:55:11,516 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-11-25 23:55:11,626 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 13 treesize of output 9 [2022-11-25 23:55:12,142 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 23 treesize of output 23 [2022-11-25 23:55:12,901 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 31 treesize of output 29 [2022-11-25 23:55:13,778 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 39 treesize of output 35 [2022-11-25 23:55:14,647 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 49 treesize of output 43 [2022-11-25 23:55:15,702 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 55 treesize of output 47 [2022-11-25 23:55:16,794 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 65 treesize of output 55 [2022-11-25 23:55:18,034 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 71 treesize of output 59 [2022-11-25 23:55:19,299 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 81 treesize of output 67 [2022-11-25 23:55:20,690 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 91 treesize of output 75 [2022-11-25 23:55:22,200 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 95 treesize of output 77 [2022-11-25 23:55:23,765 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 103 treesize of output 83 [2022-11-25 23:55:25,518 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 113 treesize of output 91 [2022-11-25 23:55:27,414 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 121 treesize of output 97 [2022-11-25 23:55:29,374 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 131 treesize of output 105 [2022-11-25 23:55:31,465 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 141 treesize of output 113 [2022-11-25 23:55:33,701 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 143 treesize of output 113 [2022-11-25 23:55:36,073 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 151 treesize of output 119 [2022-11-25 23:55:37,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,842 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:37,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-25 23:55:38,002 INFO L321 Elim1Store]: treesize reduction 68, result has 53.1 percent of original size [2022-11-25 23:55:38,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 19 select indices, 19 select index equivalence classes, 153 disjoint index pairs (out of 171 index pairs), introduced 19 new quantified variables, introduced 18 case distinctions, treesize of input 155 treesize of output 151 [2022-11-25 23:55:38,015 WARN L718 sPolynomialRelations]: Constructing 262144(two to the power of 18 dual juncts. [2022-11-25 23:55:49,186 WARN L718 sPolynomialRelations]: Constructing 131072(two to the power of 17 dual juncts. [2022-11-25 23:55:54,244 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 23:55:54,244 INFO L328 TraceCheckSpWp]: Computing backward predicates...