./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcpy-alloca-1.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_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/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_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcpy-alloca-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/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_bf180a29-3d98-4907-a42e-0d440c049226/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 96d73e5144e69b17de356213175b4cac1e1bd0fb8c4e4377e7e151c0511f2395 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-26 01:06:33,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 01:06:33,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 01:06:33,160 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 01:06:33,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 01:06:33,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 01:06:33,163 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 01:06:33,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 01:06:33,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 01:06:33,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 01:06:33,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 01:06:33,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 01:06:33,171 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 01:06:33,172 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 01:06:33,173 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 01:06:33,175 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 01:06:33,176 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 01:06:33,177 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 01:06:33,179 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 01:06:33,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 01:06:33,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 01:06:33,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 01:06:33,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 01:06:33,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 01:06:33,192 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 01:06:33,193 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 01:06:33,193 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 01:06:33,194 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 01:06:33,195 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 01:06:33,196 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 01:06:33,196 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 01:06:33,197 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 01:06:33,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 01:06:33,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 01:06:33,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 01:06:33,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 01:06:33,202 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 01:06:33,202 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 01:06:33,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 01:06:33,218 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 01:06:33,219 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 01:06:33,220 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-11-26 01:06:33,272 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 01:06:33,273 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 01:06:33,273 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 01:06:33,273 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 01:06:33,274 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 01:06:33,274 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 01:06:33,274 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 01:06:33,275 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 01:06:33,275 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 01:06:33,275 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 01:06:33,275 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 01:06:33,276 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 01:06:33,276 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 01:06:33,276 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 01:06:33,276 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 01:06:33,276 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 01:06:33,277 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 01:06:33,277 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 01:06:33,278 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-26 01:06:33,278 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-26 01:06:33,278 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 01:06:33,278 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 01:06:33,279 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 01:06:33,279 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 01:06:33,279 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-26 01:06:33,279 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-26 01:06:33,279 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-11-26 01:06:33,280 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 01:06:33,280 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-26 01:06:33,280 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 01:06:33,280 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 01:06:33,281 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 01:06:33,281 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:06:33,281 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 01:06:33,281 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 01:06:33,281 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 01:06:33,282 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 01:06:33,282 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 01:06:33,288 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 01:06:33,288 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_bf180a29-3d98-4907-a42e-0d440c049226/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_bf180a29-3d98-4907-a42e-0d440c049226/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 -> 96d73e5144e69b17de356213175b4cac1e1bd0fb8c4e4377e7e151c0511f2395 [2022-11-26 01:06:33,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 01:06:33,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 01:06:33,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 01:06:33,640 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 01:06:33,641 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 01:06:33,642 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcpy-alloca-1.i [2022-11-26 01:06:36,736 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 01:06:37,037 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 01:06:37,038 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/sv-benchmarks/c/termination-memory-alloca/openbsd_cstrcpy-alloca-1.i [2022-11-26 01:06:37,052 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/data/aaf106bc8/6cca18a62b044ddb812910d6b8c2030d/FLAG14e50eaf1 [2022-11-26 01:06:37,087 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/data/aaf106bc8/6cca18a62b044ddb812910d6b8c2030d [2022-11-26 01:06:37,090 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 01:06:37,091 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 01:06:37,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 01:06:37,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 01:06:37,103 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 01:06:37,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:06:37" (1/1) ... [2022-11-26 01:06:37,105 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a81c74a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:37, skipping insertion in model container [2022-11-26 01:06:37,105 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 01:06:37" (1/1) ... [2022-11-26 01:06:37,114 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 01:06:37,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 01:06:37,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:06:37,447 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 01:06:37,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 01:06:37,538 INFO L208 MainTranslator]: Completed translation [2022-11-26 01:06:37,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:37 WrapperNode [2022-11-26 01:06:37,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 01:06:37,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 01:06:37,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 01:06:37,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 01:06:37,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:37" (1/1) ... [2022-11-26 01:06:37,573 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:37" (1/1) ... [2022-11-26 01:06:37,598 INFO L138 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2022-11-26 01:06:37,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 01:06:37,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 01:06:37,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 01:06:37,601 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 01:06:37,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:37" (1/1) ... [2022-11-26 01:06:37,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:37" (1/1) ... [2022-11-26 01:06:37,629 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:37" (1/1) ... [2022-11-26 01:06:37,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:37" (1/1) ... [2022-11-26 01:06:37,634 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:37" (1/1) ... [2022-11-26 01:06:37,643 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:37" (1/1) ... [2022-11-26 01:06:37,647 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:37" (1/1) ... [2022-11-26 01:06:37,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:37" (1/1) ... [2022-11-26 01:06:37,655 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 01:06:37,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 01:06:37,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 01:06:37,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 01:06:37,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:37" (1/1) ... [2022-11-26 01:06:37,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 01:06:37,683 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:06:37,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 01:06:37,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 01:06:37,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-26 01:06:37,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-26 01:06:37,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-26 01:06:37,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-26 01:06:37,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 01:06:37,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 01:06:37,878 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 01:06:37,896 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 01:06:38,134 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 01:06:38,173 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 01:06:38,174 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-26 01:06:38,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:06:38 BoogieIcfgContainer [2022-11-26 01:06:38,177 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 01:06:38,180 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 01:06:38,180 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 01:06:38,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 01:06:38,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 01:06:37" (1/3) ... [2022-11-26 01:06:38,185 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b27cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:06:38, skipping insertion in model container [2022-11-26 01:06:38,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 01:06:37" (2/3) ... [2022-11-26 01:06:38,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57b27cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 01:06:38, skipping insertion in model container [2022-11-26 01:06:38,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 01:06:38" (3/3) ... [2022-11-26 01:06:38,187 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca-1.i [2022-11-26 01:06:38,208 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 01:06:38,209 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-11-26 01:06:38,256 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 01:06:38,262 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;@13c132c7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 01:06:38,263 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-26 01:06:38,267 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 8 states have (on average 2.25) internal successors, (18), 15 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-26 01:06:38,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 01:06:38,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:06:38,274 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 01:06:38,274 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-26 01:06:38,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:06:38,280 INFO L85 PathProgramCache]: Analyzing trace with hash 86103, now seen corresponding path program 1 times [2022-11-26 01:06:38,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:06:38,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558109314] [2022-11-26 01:06:38,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:38,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:06:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:06:38,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:38,449 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:06:38,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558109314] [2022-11-26 01:06:38,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558109314] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:06:38,450 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:06:38,450 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-26 01:06:38,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320472319] [2022-11-26 01:06:38,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:06:38,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:06:38,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:06:38,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:06:38,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:06:38,489 INFO L87 Difference]: Start difference. First operand has 16 states, 8 states have (on average 2.25) internal successors, (18), 15 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) 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-26 01:06:38,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:06:38,534 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-11-26 01:06:38,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:06:38,537 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-26 01:06:38,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:06:38,545 INFO L225 Difference]: With dead ends: 17 [2022-11-26 01:06:38,545 INFO L226 Difference]: Without dead ends: 15 [2022-11-26 01:06:38,547 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-26 01:06:38,550 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:06:38,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 15 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:06:38,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-11-26 01:06:38,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-11-26 01:06:38,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 8 states have (on average 1.875) 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-26 01:06:38,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-26 01:06:38,581 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 3 [2022-11-26 01:06:38,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:06:38,582 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-26 01:06:38,582 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-26 01:06:38,582 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-26 01:06:38,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 01:06:38,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:06:38,583 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 01:06:38,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 01:06:38,584 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-26 01:06:38,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:06:38,585 INFO L85 PathProgramCache]: Analyzing trace with hash 86139, now seen corresponding path program 1 times [2022-11-26 01:06:38,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:06:38,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625772412] [2022-11-26 01:06:38,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:38,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:06:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:06:38,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:38,724 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:06:38,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625772412] [2022-11-26 01:06:38,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [625772412] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:06:38,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:06:38,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:06:38,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721116928] [2022-11-26 01:06:38,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:06:38,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:06:38,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:06:38,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:06:38,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:06:38,728 INFO L87 Difference]: Start difference. First operand 15 states and 15 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-26 01:06:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:06:38,751 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-11-26 01:06:38,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:06:38,751 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-26 01:06:38,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:06:38,752 INFO L225 Difference]: With dead ends: 14 [2022-11-26 01:06:38,752 INFO L226 Difference]: Without dead ends: 14 [2022-11-26 01:06:38,753 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-26 01:06:38,754 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 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-26 01:06:38,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:06:38,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-26 01:06:38,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-11-26 01:06:38,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 8 states have (on average 1.75) 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-26 01:06:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-11-26 01:06:38,758 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 3 [2022-11-26 01:06:38,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:06:38,759 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-11-26 01:06:38,759 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-26 01:06:38,759 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-11-26 01:06:38,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-11-26 01:06:38,760 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:06:38,760 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-11-26 01:06:38,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 01:06:38,761 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-26 01:06:38,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:06:38,761 INFO L85 PathProgramCache]: Analyzing trace with hash 86140, now seen corresponding path program 1 times [2022-11-26 01:06:38,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:06:38,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942354011] [2022-11-26 01:06:38,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:38,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:06:38,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:06:39,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:39,179 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:06:39,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942354011] [2022-11-26 01:06:39,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942354011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:06:39,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:06:39,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:06:39,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791043084] [2022-11-26 01:06:39,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:06:39,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:06:39,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:06:39,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:06:39,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:06:39,185 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:06:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:06:39,227 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-11-26 01:06:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:06:39,229 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-11-26 01:06:39,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:06:39,230 INFO L225 Difference]: With dead ends: 13 [2022-11-26 01:06:39,230 INFO L226 Difference]: Without dead ends: 13 [2022-11-26 01:06:39,231 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-26 01:06:39,236 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:06:39,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:06:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-11-26 01:06:39,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-11-26 01:06:39,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.625) 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-26 01:06:39,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-11-26 01:06:39,248 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 3 [2022-11-26 01:06:39,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:06:39,249 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-11-26 01:06:39,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:06:39,249 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-11-26 01:06:39,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 01:06:39,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:06:39,250 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 01:06:39,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 01:06:39,251 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-26 01:06:39,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:06:39,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2671236, now seen corresponding path program 1 times [2022-11-26 01:06:39,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:06:39,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531056874] [2022-11-26 01:06:39,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:39,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:06:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:06:39,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:39,360 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:06:39,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531056874] [2022-11-26 01:06:39,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531056874] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:06:39,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:06:39,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 01:06:39,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277478671] [2022-11-26 01:06:39,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:06:39,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 01:06:39,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:06:39,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 01:06:39,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 01:06:39,362 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:06:39,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:06:39,395 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-11-26 01:06:39,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 01:06:39,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-26 01:06:39,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:06:39,399 INFO L225 Difference]: With dead ends: 12 [2022-11-26 01:06:39,400 INFO L226 Difference]: Without dead ends: 12 [2022-11-26 01:06:39,400 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-26 01:06:39,402 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:06:39,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:06:39,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-26 01:06:39,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-26 01:06:39,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.5) 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-26 01:06:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-11-26 01:06:39,409 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 4 [2022-11-26 01:06:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:06:39,410 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-11-26 01:06:39,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:06:39,410 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-11-26 01:06:39,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-26 01:06:39,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:06:39,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-26 01:06:39,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 01:06:39,414 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-26 01:06:39,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:06:39,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2671237, now seen corresponding path program 1 times [2022-11-26 01:06:39,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:06:39,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905395556] [2022-11-26 01:06:39,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:39,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:06:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:06:39,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:39,522 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:06:39,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905395556] [2022-11-26 01:06:39,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905395556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:06:39,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:06:39,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:06:39,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637509018] [2022-11-26 01:06:39,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:06:39,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:06:39,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:06:39,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:06:39,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:06:39,526 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:06:39,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:06:39,578 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-11-26 01:06:39,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:06:39,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-11-26 01:06:39,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:06:39,580 INFO L225 Difference]: With dead ends: 20 [2022-11-26 01:06:39,580 INFO L226 Difference]: Without dead ends: 20 [2022-11-26 01:06:39,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:06:39,582 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 25 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:06:39,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 8 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:06:39,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-26 01:06:39,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 13. [2022-11-26 01:06:39,593 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-26 01:06:39,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-11-26 01:06:39,595 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 4 [2022-11-26 01:06:39,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:06:39,595 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-11-26 01:06:39,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:06:39,596 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-11-26 01:06:39,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 01:06:39,597 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:06:39,602 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 01:06:39,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 01:06:39,602 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-26 01:06:39,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:06:39,603 INFO L85 PathProgramCache]: Analyzing trace with hash 82808317, now seen corresponding path program 1 times [2022-11-26 01:06:39,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:06:39,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295042806] [2022-11-26 01:06:39,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:39,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:06:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:06:39,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:39,883 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:06:39,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295042806] [2022-11-26 01:06:39,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295042806] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:06:39,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:06:39,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:06:39,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482797209] [2022-11-26 01:06:39,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:06:39,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 01:06:39,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:06:39,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 01:06:39,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:06:39,888 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), 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-26 01:06:39,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:06:39,952 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-11-26 01:06:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 01:06:39,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-26 01:06:39,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:06:39,953 INFO L225 Difference]: With dead ends: 19 [2022-11-26 01:06:39,953 INFO L226 Difference]: Without dead ends: 19 [2022-11-26 01:06:39,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:06:39,955 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 40 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:06:39,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 4 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:06:39,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-26 01:06:39,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 14. [2022-11-26 01:06:39,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.5) internal successors, (15), 13 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-26 01:06:39,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-11-26 01:06:39,958 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 5 [2022-11-26 01:06:39,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:06:39,958 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-11-26 01:06:39,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:06:39,958 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-11-26 01:06:39,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-26 01:06:39,959 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:06:39,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-26 01:06:39,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 01:06:39,959 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-26 01:06:39,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:06:39,960 INFO L85 PathProgramCache]: Analyzing trace with hash 82808316, now seen corresponding path program 1 times [2022-11-26 01:06:39,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:06:39,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745229054] [2022-11-26 01:06:39,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:39,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:06:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:06:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:40,115 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:06:40,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745229054] [2022-11-26 01:06:40,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745229054] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:06:40,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:06:40,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 01:06:40,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171258628] [2022-11-26 01:06:40,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:06:40,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 01:06:40,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:06:40,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 01:06:40,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 01:06:40,118 INFO L87 Difference]: Start difference. First operand 14 states and 15 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-26 01:06:40,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:06:40,148 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-11-26 01:06:40,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:06:40,149 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-26 01:06:40,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:06:40,149 INFO L225 Difference]: With dead ends: 13 [2022-11-26 01:06:40,149 INFO L226 Difference]: Without dead ends: 13 [2022-11-26 01:06:40,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 01:06:40,157 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4 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.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:06:40,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:06:40,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-11-26 01:06:40,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-11-26 01:06:40,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.3) 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-26 01:06:40,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-11-26 01:06:40,162 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2022-11-26 01:06:40,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:06:40,162 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-11-26 01:06:40,162 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-26 01:06:40,162 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-11-26 01:06:40,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 01:06:40,163 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:06:40,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:06:40,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 01:06:40,164 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-26 01:06:40,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:06:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash -2025586268, now seen corresponding path program 1 times [2022-11-26 01:06:40,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:06:40,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138435950] [2022-11-26 01:06:40,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:40,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:06:40,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:06:40,465 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:40,465 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:06:40,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138435950] [2022-11-26 01:06:40,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138435950] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:06:40,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1054667084] [2022-11-26 01:06:40,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:40,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:06:40,467 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:06:40,470 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:06:40,502 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 01:06:40,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:06:40,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-26 01:06:40,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:06:40,704 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-26 01:06:40,804 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:06:40,805 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 18 treesize of output 19 [2022-11-26 01:06:40,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:40,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:06:41,133 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-26 01:06:41,145 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-26 01:06:41,157 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-26 01:06:41,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:41,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1054667084] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:06:41,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1023936398] [2022-11-26 01:06:41,227 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:06:41,227 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:06:41,232 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:06:41,237 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:06:41,237 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:06:41,322 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:06:41,326 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-26 01:06:41,395 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-26 01:06:41,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:06:41,510 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-26 01:06:41,513 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-26 01:06:41,668 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 11 treesize of output 7 [2022-11-26 01:06:41,715 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 11 treesize of output 7 [2022-11-26 01:06:41,805 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:06:42,491 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '304#(and (<= 0 |ULTIMATE.start_cstrcpy_~from#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~from#1.offset|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (< (select |#length| |ULTIMATE.start_cstrcpy_~from#1.base|) (+ |ULTIMATE.start_cstrcpy_~from#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.base|) (<= |ULTIMATE.start_cstrcpy_~save~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.base|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~from#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~to#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 01:06:42,491 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:06:42,491 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:06:42,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2022-11-26 01:06:42,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131224242] [2022-11-26 01:06:42,491 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:06:42,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-26 01:06:42,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:06:42,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-26 01:06:42,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2022-11-26 01:06:42,493 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 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-26 01:06:42,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:06:42,819 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-11-26 01:06:42,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 01:06:42,821 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 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) Word has length 7 [2022-11-26 01:06:42,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:06:42,821 INFO L225 Difference]: With dead ends: 24 [2022-11-26 01:06:42,821 INFO L226 Difference]: Without dead ends: 24 [2022-11-26 01:06:42,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2022-11-26 01:06:42,823 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 50 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:06:42,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 15 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:06:42,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-26 01:06:42,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 15. [2022-11-26 01:06:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 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-26 01:06:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-11-26 01:06:42,825 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 7 [2022-11-26 01:06:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:06:42,826 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-11-26 01:06:42,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 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-26 01:06:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-11-26 01:06:42,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 01:06:42,826 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:06:42,827 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 01:06:42,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 01:06:43,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-26 01:06:43,028 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-11-26 01:06:43,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:06:43,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1631319586, now seen corresponding path program 1 times [2022-11-26 01:06:43,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:06:43,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270667593] [2022-11-26 01:06:43,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:43,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:06:43,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:06:43,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:43,194 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:06:43,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270667593] [2022-11-26 01:06:43,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270667593] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 01:06:43,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 01:06:43,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-26 01:06:43,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744661380] [2022-11-26 01:06:43,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 01:06:43,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-26 01:06:43,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:06:43,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-26 01:06:43,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-26 01:06:43,196 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:06:43,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:06:43,238 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2022-11-26 01:06:43,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 01:06:43,239 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-26 01:06:43,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:06:43,239 INFO L225 Difference]: With dead ends: 14 [2022-11-26 01:06:43,240 INFO L226 Difference]: Without dead ends: 12 [2022-11-26 01:06:43,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-26 01:06:43,242 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 01:06:43,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 01:06:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-11-26 01:06:43,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-11-26 01:06:43,246 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-26 01:06:43,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-11-26 01:06:43,250 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2022-11-26 01:06:43,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:06:43,251 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-11-26 01:06:43,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:06:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-11-26 01:06:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-26 01:06:43,252 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:06:43,252 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-26 01:06:43,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 01:06:43,252 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-26 01:06:43,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:06:43,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1631335102, now seen corresponding path program 1 times [2022-11-26 01:06:43,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:06:43,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716987164] [2022-11-26 01:06:43,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:43,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:06:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:06:43,633 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-26 01:06:43,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:06:43,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716987164] [2022-11-26 01:06:43,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716987164] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:06:43,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079065315] [2022-11-26 01:06:43,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:43,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:06:43,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:06:43,639 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:06:43,643 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 01:06:43,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:06:43,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 51 conjunts are in the unsatisfiable core [2022-11-26 01:06:43,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:06:43,820 INFO L321 Elim1Store]: treesize reduction 11, result has 50.0 percent of original size [2022-11-26 01:06:43,821 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 17 [2022-11-26 01:06:43,884 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-26 01:06:43,989 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-26 01:06:44,100 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:06:44,100 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-26 01:06:44,268 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-26 01:06:44,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:06:44,436 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-26 01:06:44,441 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-26 01:06:44,506 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:06:44,548 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-26 01:06:44,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079065315] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:06:44,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [829178807] [2022-11-26 01:06:44,551 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:06:44,551 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:06:44,551 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:06:44,551 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:06:44,552 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:06:44,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:06:44,591 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-26 01:06:44,640 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-26 01:06:44,706 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:06:44,712 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-26 01:06:44,713 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-26 01:06:44,811 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 11 treesize of output 7 [2022-11-26 01:06:44,859 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 11 treesize of output 7 [2022-11-26 01:06:44,921 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:06:45,556 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '455#(and (<= 0 |ULTIMATE.start_cstrcpy_~from#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~from#1.offset|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.base|) (<= |ULTIMATE.start_cstrcpy_~save~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.base|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_~to#1.base|) (+ |ULTIMATE.start_cstrcpy_~to#1.offset| 1)) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~from#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~to#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 01:06:45,557 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:06:45,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:06:45,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 17 [2022-11-26 01:06:45,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508207933] [2022-11-26 01:06:45,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:06:45,558 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-26 01:06:45,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:06:45,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-26 01:06:45,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2022-11-26 01:06:45,559 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), 18 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-26 01:06:46,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:06:46,400 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-11-26 01:06:46,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-26 01:06:46,400 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 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 8 [2022-11-26 01:06:46,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:06:46,401 INFO L225 Difference]: With dead ends: 13 [2022-11-26 01:06:46,401 INFO L226 Difference]: Without dead ends: 13 [2022-11-26 01:06:46,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2022-11-26 01:06:46,402 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 55 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 01:06:46,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 0 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 01:06:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-11-26 01:06:46,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 11. [2022-11-26 01:06:46,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:06:46,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-11-26 01:06:46,404 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2022-11-26 01:06:46,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:06:46,404 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-11-26 01:06:46,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 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-26 01:06:46,404 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-11-26 01:06:46,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 01:06:46,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:06:46,405 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2022-11-26 01:06:46,415 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-26 01:06:46,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-26 01:06:46,612 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-26 01:06:46,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:06:46,612 INFO L85 PathProgramCache]: Analyzing trace with hash 49969701, now seen corresponding path program 2 times [2022-11-26 01:06:46,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:06:46,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262051741] [2022-11-26 01:06:46,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:46,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:06:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:06:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:47,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:06:47,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262051741] [2022-11-26 01:06:47,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262051741] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:06:47,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370584962] [2022-11-26 01:06:47,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:06:47,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:06:47,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:06:47,231 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:06:47,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 01:06:47,323 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-26 01:06:47,324 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:06:47,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 45 conjunts are in the unsatisfiable core [2022-11-26 01:06:47,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:06:47,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-26 01:06:47,376 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-26 01:06:47,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 24 treesize of output 24 [2022-11-26 01:06:47,658 INFO L321 Elim1Store]: treesize reduction 4, result has 82.6 percent of original size [2022-11-26 01:06:47,658 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 28 treesize of output 29 [2022-11-26 01:06:47,772 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:47,772 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:06:48,089 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:06:48,090 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-26 01:06:48,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 38 treesize of output 34 [2022-11-26 01:06:48,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 51 treesize of output 45 [2022-11-26 01:06:48,132 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 11 treesize of output 7 [2022-11-26 01:06:48,153 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-26 01:06:48,230 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:48,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370584962] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:06:48,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1731195640] [2022-11-26 01:06:48,234 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:06:48,234 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:06:48,235 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:06:48,235 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:06:48,235 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:06:48,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:06:48,276 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-26 01:06:48,313 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-26 01:06:48,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:06:48,399 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-26 01:06:48,399 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-26 01:06:48,528 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 11 treesize of output 7 [2022-11-26 01:06:48,582 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 11 treesize of output 7 [2022-11-26 01:06:48,629 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:06:49,290 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '572#(and (<= 0 |ULTIMATE.start_cstrcpy_~from#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~from#1.offset|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (< (select |#length| |ULTIMATE.start_cstrcpy_~from#1.base|) (+ |ULTIMATE.start_cstrcpy_~from#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.base|) (<= |ULTIMATE.start_cstrcpy_~save~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.base|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~from#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~to#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 01:06:49,290 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:06:49,290 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:06:49,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2022-11-26 01:06:49,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933419529] [2022-11-26 01:06:49,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:06:49,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-11-26 01:06:49,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:06:49,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-11-26 01:06:49,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=619, Unknown=1, NotChecked=0, Total=702 [2022-11-26 01:06:49,292 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:06:50,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:06:50,477 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-11-26 01:06:50,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-26 01:06:50,479 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-26 01:06:50,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:06:50,480 INFO L225 Difference]: With dead ends: 19 [2022-11-26 01:06:50,480 INFO L226 Difference]: Without dead ends: 19 [2022-11-26 01:06:50,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=210, Invalid=1121, Unknown=1, NotChecked=0, Total=1332 [2022-11-26 01:06:50,481 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 61 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 13 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-26 01:06:50,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 1 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 147 Invalid, 2 Unknown, 0 Unchecked, 0.2s Time] [2022-11-26 01:06:50,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-11-26 01:06:50,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2022-11-26 01:06:50,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:06:50,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-11-26 01:06:50,483 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2022-11-26 01:06:50,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:06:50,484 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-11-26 01:06:50,484 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:06:50,484 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-11-26 01:06:50,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-26 01:06:50,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:06:50,487 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1] [2022-11-26 01:06:50,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 01:06:50,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:06:50,690 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-26 01:06:50,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:06:50,691 INFO L85 PathProgramCache]: Analyzing trace with hash -1991509563, now seen corresponding path program 3 times [2022-11-26 01:06:50,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:06:50,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796997767] [2022-11-26 01:06:50,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:06:50,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:06:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:06:51,367 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:51,368 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:06:51,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796997767] [2022-11-26 01:06:51,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796997767] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:06:51,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446119061] [2022-11-26 01:06:51,368 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-26 01:06:51,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:06:51,368 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:06:51,370 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:06:51,394 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 01:06:51,480 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-26 01:06:51,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:06:51,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 68 conjunts are in the unsatisfiable core [2022-11-26 01:06:51,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:06:51,496 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-26 01:06:51,501 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 9 treesize of output 11 [2022-11-26 01:06:51,527 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-26 01:06:51,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2022-11-26 01:06:51,818 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 34 treesize of output 32 [2022-11-26 01:06:52,008 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 44 treesize of output 40 [2022-11-26 01:06:52,205 INFO L321 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2022-11-26 01:06:52,206 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 39 [2022-11-26 01:06:52,331 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:52,331 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:06:53,374 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:06:53,377 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 83 treesize of output 60 [2022-11-26 01:06:53,388 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 88 treesize of output 80 [2022-11-26 01:06:53,393 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-26 01:06:53,405 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 63 [2022-11-26 01:06:53,468 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-26 01:06:53,473 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-26 01:06:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:06:53,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446119061] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:06:53,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1542135340] [2022-11-26 01:06:53,561 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:06:53,561 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:06:53,561 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:06:53,562 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:06:53,562 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:06:53,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:06:53,594 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-26 01:06:53,626 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-26 01:06:53,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:06:53,695 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-26 01:06:53,695 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-26 01:06:53,797 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 11 treesize of output 7 [2022-11-26 01:06:53,848 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 11 treesize of output 7 [2022-11-26 01:06:53,902 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:06:54,641 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '756#(and (<= 0 |ULTIMATE.start_cstrcpy_~from#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~from#1.offset|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (< (select |#length| |ULTIMATE.start_cstrcpy_~from#1.base|) (+ |ULTIMATE.start_cstrcpy_~from#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.base|) (<= |ULTIMATE.start_cstrcpy_~save~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.base|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~from#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~to#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 01:06:54,641 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:06:54,642 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:06:54,642 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 14] total 32 [2022-11-26 01:06:54,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879043330] [2022-11-26 01:06:54,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:06:54,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-11-26 01:06:54,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:06:54,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-11-26 01:06:54,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1241, Unknown=16, NotChecked=0, Total=1406 [2022-11-26 01:06:54,644 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 33 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:01,719 WARN L233 SmtUtils]: Spent 6.34s on a formula simplification. DAG size of input: 100 DAG size of output: 94 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:07:04,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:04,558 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2022-11-26 01:07:04,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-26 01:07:04,562 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 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 16 [2022-11-26 01:07:04,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:04,563 INFO L225 Difference]: With dead ends: 31 [2022-11-26 01:07:04,563 INFO L226 Difference]: Without dead ends: 31 [2022-11-26 01:07:04,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 643 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=453, Invalid=2719, Unknown=20, NotChecked=0, Total=3192 [2022-11-26 01:07:04,565 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 18 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:04,566 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 301 Invalid, 12 Unknown, 0 Unchecked, 0.5s Time] [2022-11-26 01:07:04,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-11-26 01:07:04,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2022-11-26 01:07:04,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:04,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2022-11-26 01:07:04,569 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 16 [2022-11-26 01:07:04,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:04,569 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2022-11-26 01:07:04,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:04,569 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2022-11-26 01:07:04,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-26 01:07:04,570 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:04,570 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1] [2022-11-26 01:07:04,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:04,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:04,771 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-26 01:07:04,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:04,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1024872709, now seen corresponding path program 4 times [2022-11-26 01:07:04,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:04,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008777408] [2022-11-26 01:07:04,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:04,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:06,451 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:06,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:06,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008777408] [2022-11-26 01:07:06,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008777408] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:06,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46938153] [2022-11-26 01:07:06,451 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-26 01:07:06,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:06,452 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:06,454 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:06,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-26 01:07:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:06,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 107 conjunts are in the unsatisfiable core [2022-11-26 01:07:06,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:06,618 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-26 01:07:06,678 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-26 01:07:06,828 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-26 01:07:07,036 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-26 01:07:07,256 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 41 treesize of output 37 [2022-11-26 01:07:07,523 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 51 treesize of output 45 [2022-11-26 01:07:07,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 55 treesize of output 47 [2022-11-26 01:07:08,090 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 63 treesize of output 53 [2022-11-26 01:07:08,450 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-26 01:07:08,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:08,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:08,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:08,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:08,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:08,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:08,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:08,810 INFO L321 Elim1Store]: treesize reduction 28, result has 58.2 percent of original size [2022-11-26 01:07:08,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 75 treesize of output 73 [2022-11-26 01:07:08,818 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-11-26 01:07:08,838 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-26 01:07:09,017 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:09,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:07:11,401 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_210 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_210) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_211 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_211) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (and (<= (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (<= 0 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6))) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) is different from false [2022-11-26 01:07:13,474 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:07:13,475 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 175 treesize of output 108 [2022-11-26 01:07:13,483 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 188 treesize of output 172 [2022-11-26 01:07:13,489 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-26 01:07:13,493 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-26 01:07:13,497 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-26 01:07:13,502 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-26 01:07:13,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 161 treesize of output 131 [2022-11-26 01:07:13,554 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-26 01:07:13,560 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-26 01:07:13,566 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-26 01:07:13,573 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-26 01:07:13,761 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-26 01:07:13,809 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 85 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-11-26 01:07:13,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46938153] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:07:13,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1384284084] [2022-11-26 01:07:13,812 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:07:13,812 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:07:13,812 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:07:13,813 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:07:13,813 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:07:13,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:13,857 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-26 01:07:13,887 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-26 01:07:13,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:07:13,954 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-26 01:07:13,955 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-26 01:07:14,055 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 11 treesize of output 7 [2022-11-26 01:07:14,096 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 11 treesize of output 7 [2022-11-26 01:07:14,138 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:07:15,272 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1080#(and (<= 0 |ULTIMATE.start_cstrcpy_~from#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~from#1.offset|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (< (select |#length| |ULTIMATE.start_cstrcpy_~from#1.base|) (+ |ULTIMATE.start_cstrcpy_~from#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.base|) (<= |ULTIMATE.start_cstrcpy_~save~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.base|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~from#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~to#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 01:07:15,272 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:07:15,272 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:07:15,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 26] total 57 [2022-11-26 01:07:15,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429484471] [2022-11-26 01:07:15,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:07:15,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-11-26 01:07:15,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:07:15,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-11-26 01:07:15,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=393, Invalid=3397, Unknown=120, NotChecked=122, Total=4032 [2022-11-26 01:07:15,277 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 59 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:24,098 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (.cse50 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) (.cse49 (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) (.cse31 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) (.cse48 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) (.cse51 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) (.cse47 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) (.cse6 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (.cse45 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) (.cse22 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1))) (let ((.cse4 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse22) 0))) (.cse5 (and (<= .cse47 .cse6) (<= 0 .cse45))) (.cse43 (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|))) (.cse9 (and (<= 0 .cse48) (<= .cse51 .cse6))) (.cse10 (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse22) 0))) (.cse11 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse47) 0))) (.cse12 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse45) 0))) (.cse13 (and (<= 0 .cse49) (<= .cse31 .cse6))) (.cse14 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse51) 0))) (.cse15 (forall ((v_ArrVal_211 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_211) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse47) 0))) (.cse16 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse50) 0))) (.cse17 (forall ((v_ArrVal_210 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_210) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse45) 0))) (.cse18 (forall ((v_ArrVal_209 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_209) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse22) 0))) (.cse19 (forall ((v_ArrVal_212 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse48)))) (.cse35 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse47) 0))) (.cse36 (and (<= 0 .cse51) (<= .cse50 .cse6))) (.cse37 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse48) 0))) (.cse38 (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse45) 0))) (.cse39 (forall ((v_ArrVal_211 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_211) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse22) 0))) (.cse46 (forall ((v_ArrVal_210 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_210) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse22) 0))) (.cse20 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse48) 0))) (.cse21 (forall ((v_ArrVal_211 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_211) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse45) 0))) (.cse23 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse51) 0))) (.cse24 (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse47) 0))) (.cse25 (and (<= .cse49 .cse6) (<= 0 .cse50))) (.cse3 (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) (.cse0 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse45) 0))) (.cse1 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse22) 0))) (.cse2 (and (<= .cse48 .cse6) (<= 0 .cse47))) (.cse8 (= (select .cse7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0)) (.cse26 (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse51) 0))) (.cse27 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse50) 0))) (.cse28 (forall ((v_ArrVal_208 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_208) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse22)))) (.cse32 (<= (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9) .cse6)) (.cse29 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse49) 0))) (.cse30 (forall ((v_ArrVal_209 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_209) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse45) 0))) (.cse33 (forall ((v_ArrVal_211 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_211) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse48) 0))) (.cse34 (forall ((v_ArrVal_210 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_210) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse47) 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse3) (= 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= |ULTIMATE.start_main_~length2~0#1| .cse6) (not (< |ULTIMATE.start_main_~length2~0#1| 1)) (= (select .cse7 (+ (- 1) |ULTIMATE.start_main_~length2~0#1|)) 0))) (not (= (select .cse7 0) 0)) (not (= (select .cse7 (+ (- 1) |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) (not (= (select .cse7 4) 0)) (or .cse8 .cse4 .cse5) (or .cse9 .cse8 .cse10 .cse11 .cse12) (or .cse13 .cse8 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse21 (= (select .cse7 .cse22) 0) .cse23 .cse24 .cse25 .cse3) (or .cse26 .cse27 .cse28 .cse29 .cse30 (and (<= 0 .cse31) .cse32) .cse33 .cse34 .cse3) (or .cse35 .cse36 .cse37 .cse38 .cse39 .cse3) (let ((.cse44 (div |c_ULTIMATE.start_main_~length2~0#1| 18446744073709551616))) (let ((.cse42 (<= (+ .cse44 1) 0))) (let ((.cse41 (+ (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (* 18446744073709551616 .cse44))) (.cse40 (not .cse42))) (or (and (or .cse40 (<= 1 .cse41)) (or (<= .cse41 1) .cse42)) (and (<= .cse41 |c_ULTIMATE.start_main_~length2~0#1|) .cse40 .cse43))))) (or (<= .cse45 .cse6) (and (<= .cse22 .cse6) .cse3)) (not (= (select .cse7 3) 0)) .cse43 (or .cse9 .cse10 .cse11 .cse3 .cse12) (or .cse46 .cse8 .cse20 .cse21 .cse23 .cse24 .cse25) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (or .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse3 .cse19) (or .cse8 .cse35 .cse36 .cse37 .cse38 .cse39) (not (= (select .cse7 5) 0)) (not (= (select .cse7 2) 0)) (not (= (select .cse7 1) 0)) (or .cse46 .cse20 .cse21 .cse23 .cse24 .cse25 .cse3) (or .cse8 .cse0 .cse1 .cse2) (not (< |c_ULTIMATE.start_main_~length2~0#1| 1)) (or .cse8 .cse26 .cse27 .cse28 .cse32 .cse29 (not (<= 0 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) .cse30 .cse33 .cse34)))) is different from false [2022-11-26 01:07:26,123 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (.cse50 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) (.cse49 (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) (.cse31 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) (.cse48 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) (.cse51 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) (.cse47 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) (.cse6 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (.cse45 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) (.cse22 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1))) (let ((.cse4 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse22) 0))) (.cse5 (and (<= .cse47 .cse6) (<= 0 .cse45))) (.cse43 (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|))) (.cse9 (and (<= 0 .cse48) (<= .cse51 .cse6))) (.cse10 (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse22) 0))) (.cse11 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse47) 0))) (.cse12 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse45) 0))) (.cse13 (and (<= 0 .cse49) (<= .cse31 .cse6))) (.cse14 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse51) 0))) (.cse15 (forall ((v_ArrVal_211 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_211) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse47) 0))) (.cse16 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse50) 0))) (.cse17 (forall ((v_ArrVal_210 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_210) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse45) 0))) (.cse18 (forall ((v_ArrVal_209 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_209) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse22) 0))) (.cse19 (forall ((v_ArrVal_212 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse48)))) (.cse35 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse47) 0))) (.cse36 (and (<= 0 .cse51) (<= .cse50 .cse6))) (.cse37 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse48) 0))) (.cse38 (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse45) 0))) (.cse39 (forall ((v_ArrVal_211 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_211) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse22) 0))) (.cse46 (forall ((v_ArrVal_210 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_210) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse22) 0))) (.cse20 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse48) 0))) (.cse21 (forall ((v_ArrVal_211 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_211) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse45) 0))) (.cse23 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse51) 0))) (.cse24 (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse47) 0))) (.cse25 (and (<= .cse49 .cse6) (<= 0 .cse50))) (.cse3 (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) (.cse0 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse45) 0))) (.cse1 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse22) 0))) (.cse2 (and (<= .cse48 .cse6) (<= 0 .cse47))) (.cse8 (= (select .cse7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0)) (.cse26 (forall ((v_ArrVal_212 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_212) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse51) 0))) (.cse27 (forall ((v_ArrVal_213 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_213) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse50) 0))) (.cse28 (forall ((v_ArrVal_208 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_208) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse22)))) (.cse32 (<= (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9) .cse6)) (.cse29 (forall ((v_ArrVal_214 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_214) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse49) 0))) (.cse30 (forall ((v_ArrVal_209 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_209) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse45) 0))) (.cse33 (forall ((v_ArrVal_211 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_211) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse48) 0))) (.cse34 (forall ((v_ArrVal_210 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_210) |c_ULTIMATE.start_cstrcpy_~from#1.base|) .cse47) 0)))) (and (or .cse0 .cse1 .cse2 .cse3) (or .cse4 .cse5 .cse3) (= 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= |ULTIMATE.start_main_~length2~0#1| .cse6) (not (< |ULTIMATE.start_main_~length2~0#1| 1)) (= (select .cse7 (+ (- 1) |ULTIMATE.start_main_~length2~0#1|)) 0))) (not (= (select .cse7 0) 0)) (not (= (select .cse7 (+ (- 1) |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) (not (= (select .cse7 4) 0)) (or .cse8 .cse4 .cse5) (or .cse9 .cse8 .cse10 .cse11 .cse12) (or .cse13 .cse8 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19) (or .cse20 .cse21 (= (select .cse7 .cse22) 0) .cse23 .cse24 .cse25 .cse3) (or .cse26 .cse27 .cse28 .cse29 .cse30 (and (<= 0 .cse31) .cse32) .cse33 .cse34 .cse3) (or .cse35 .cse36 .cse37 .cse38 .cse39 .cse3) (let ((.cse44 (div |c_ULTIMATE.start_main_~length2~0#1| 18446744073709551616))) (let ((.cse42 (<= (+ .cse44 1) 0))) (let ((.cse41 (+ (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (* 18446744073709551616 .cse44))) (.cse40 (not .cse42))) (or (and (or .cse40 (<= 1 .cse41)) (or (<= .cse41 1) .cse42)) (and (<= .cse41 |c_ULTIMATE.start_main_~length2~0#1|) .cse40 .cse43))))) (or (<= .cse45 .cse6) (and (<= .cse22 .cse6) .cse3)) (not (= (select .cse7 3) 0)) .cse43 (or .cse9 .cse10 .cse11 .cse3 .cse12) (or .cse46 .cse8 .cse20 .cse21 .cse23 .cse24 .cse25) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (or .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse3 .cse19) (or .cse8 .cse35 .cse36 .cse37 .cse38 .cse39) (not (= (select .cse7 5) 0)) (not (= (select .cse7 2) 0)) (not (= (select .cse7 1) 0)) (or .cse46 .cse20 .cse21 .cse23 .cse24 .cse25 .cse3) (or .cse8 .cse0 .cse1 .cse2) (not (< |c_ULTIMATE.start_main_~length2~0#1| 1)) (or .cse8 .cse26 .cse27 .cse28 .cse32 .cse29 (not (<= 0 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) .cse30 .cse33 .cse34)))) is different from true [2022-11-26 01:07:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 01:07:42,530 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2022-11-26 01:07:42,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-11-26 01:07:42,530 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 0 states have call successors, (0), 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 28 [2022-11-26 01:07:42,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 01:07:42,531 INFO L225 Difference]: With dead ends: 55 [2022-11-26 01:07:42,531 INFO L226 Difference]: Without dead ends: 55 [2022-11-26 01:07:42,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 100 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2119 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=1147, Invalid=8592, Unknown=169, NotChecked=394, Total=10302 [2022-11-26 01:07:42,543 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 123 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 39 mSolverCounterUnsat, 69 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 1096 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 69 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-11-26 01:07:42,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 4 Invalid, 1096 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 951 Invalid, 69 Unknown, 37 Unchecked, 1.9s Time] [2022-11-26 01:07:42,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-26 01:07:42,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-11-26 01:07:42,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:42,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2022-11-26 01:07:42,547 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 28 [2022-11-26 01:07:42,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 01:07:42,548 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2022-11-26 01:07:42,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 1.4310344827586208) internal successors, (83), 58 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:07:42,548 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2022-11-26 01:07:42,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-26 01:07:42,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 01:07:42,550 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1] [2022-11-26 01:07:42,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-26 01:07:42,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-26 01:07:42,767 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-26 01:07:42,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 01:07:42,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1512022139, now seen corresponding path program 5 times [2022-11-26 01:07:42,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 01:07:42,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171741475] [2022-11-26 01:07:42,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 01:07:42,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 01:07:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 01:07:45,710 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:07:45,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 01:07:45,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171741475] [2022-11-26 01:07:45,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171741475] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 01:07:45,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056560468] [2022-11-26 01:07:45,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-26 01:07:45,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 01:07:45,711 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 01:07:45,723 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 01:07:45,742 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bf180a29-3d98-4907-a42e-0d440c049226/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-26 01:07:46,708 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2022-11-26 01:07:46,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-26 01:07:46,721 WARN L261 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 235 conjunts are in the unsatisfiable core [2022-11-26 01:07:46,729 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 01:07:46,739 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-26 01:07:46,807 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-26 01:07:47,013 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-26 01:07:47,268 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 33 treesize of output 31 [2022-11-26 01:07:47,550 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 43 treesize of output 39 [2022-11-26 01:07:47,828 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 47 treesize of output 41 [2022-11-26 01:07:48,163 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-26 01:07:48,502 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-26 01:07:48,877 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 75 treesize of output 63 [2022-11-26 01:07:49,323 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 85 treesize of output 71 [2022-11-26 01:07:49,823 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 79 [2022-11-26 01:07:50,320 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-26 01:07:50,800 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-26 01:07:51,383 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-26 01:07:52,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 119 treesize of output 95 [2022-11-26 01:07:52,612 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 129 treesize of output 103 [2022-11-26 01:07:53,254 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 135 treesize of output 107 [2022-11-26 01:07:54,355 INFO L321 Elim1Store]: treesize reduction 60, result has 83.6 percent of original size [2022-11-26 01:07:54,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 91 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 45 case distinctions, treesize of input 137 treesize of output 371 [2022-11-26 01:07:56,018 WARN L718 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2022-11-26 01:07:58,723 WARN L718 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2022-11-26 01:08:00,718 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 01:08:00,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 01:08:09,516 WARN L837 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0) (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_313 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_82| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| 1))) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_314) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_313) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_82|) 0)))) is different from false [2022-11-26 01:08:10,354 WARN L837 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_313 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_82| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3))) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| 1))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_314) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_313) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_82|) 0))) (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0))) is different from false [2022-11-26 01:08:10,797 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_313 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_82| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4))) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| 1))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_314) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_313) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_82|) 0))) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) is different from false [2022-11-26 01:08:10,845 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0) (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_313 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_82| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4))) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| 1))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_314) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_313) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_82|) 0))) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0))) is different from false [2022-11-26 01:08:11,342 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_313 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_82| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| 1))) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_314) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_313) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_82|) 0))) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) is different from false [2022-11-26 01:08:11,389 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_313 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_82| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| 1))) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_314) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_313) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_82|) 0))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0))) is different from false [2022-11-26 01:08:12,076 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_313 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_82| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| 1))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_314) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_313) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_82|) 0) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6))))) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0))) is different from false [2022-11-26 01:08:13,919 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_313 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_82| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|))) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| 1))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_314) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_313) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_82|) 0))) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) is different from false [2022-11-26 01:08:16,839 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_311 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)))) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_313 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_82| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| 1))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_314) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_313) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_82|) 0))) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) is different from false [2022-11-26 01:08:21,097 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) (forall ((v_ArrVal_303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_303) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_313 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_82| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| 1))) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_314) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_313) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_82|) 0))) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0))) is different from false [2022-11-26 01:08:27,606 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_82| Int) (v_ArrVal_313 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10))) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| 1))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_314) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_313) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_82|) 0))) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_303) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_302) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)))) (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) is different from false [2022-11-26 01:09:10,723 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_312 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)))) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_302) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_303) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_301 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_301) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_82| Int) (v_ArrVal_313 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| 1))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_314) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_313) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_82|) 0))) (forall ((v_ArrVal_311 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)))) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) (forall ((v_ArrVal_299 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_299) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0))) is different from false [2022-11-26 01:09:10,802 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_312 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)))) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_302) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_303) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0) (forall ((v_ArrVal_301 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_301) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_82| Int) (v_ArrVal_313 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| 1))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_314) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_313) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_82|) 0))) (forall ((v_ArrVal_311 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)))) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) (forall ((v_ArrVal_299 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_299) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0))) is different from false [2022-11-26 01:10:00,760 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_298 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_298) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_312 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_312) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) (forall ((v_ArrVal_314 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_81| Int) (v_ArrVal_313 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_82| Int)) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| 2) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_81| (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| 1))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_314) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_81|)) (not (<= |v_ULTIMATE.start_cstrcpy_~from#1.offset_82| (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_313) |c_ULTIMATE.start_cstrcpy_~from#1.base|) |v_ULTIMATE.start_cstrcpy_~from#1.offset_82|) 0))) (forall ((v_ArrVal_301 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_301) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~from#1.base|) |c_ULTIMATE.start_cstrcpy_~from#1.offset|) 0) (forall ((v_ArrVal_302 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_302) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_303 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_303) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) (forall ((v_ArrVal_299 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_299) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) (forall ((v_ArrVal_309 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_309) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) (forall ((v_ArrVal_304 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_304) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_306 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_306) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_308 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_308) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) (forall ((v_ArrVal_311 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_311) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) (forall ((v_ArrVal_307 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_307) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0))) is different from false [2022-11-26 01:11:23,264 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:11:23,265 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 355 treesize of output 200 [2022-11-26 01:11:23,406 INFO L321 Elim1Store]: treesize reduction 17, result has 54.1 percent of original size [2022-11-26 01:11:23,406 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-26 01:11:23,558 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-26 01:11:23,568 INFO L217 Elim1Store]: Index analysis took 128 ms [2022-11-26 01:11:24,312 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-26 01:11:24,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 92 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 44 case distinctions, treesize of input 386 treesize of output 701 [2022-11-26 01:11:24,384 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-26 01:11:24,389 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-26 01:11:24,394 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-26 01:11:24,399 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-26 01:11:24,404 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-26 01:11:24,410 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-26 01:11:24,415 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-26 01:11:24,421 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-26 01:11:24,426 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-26 01:11:24,431 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-26 01:11:24,439 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-26 01:11:24,443 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-26 01:11:24,448 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-26 01:11:24,540 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 9 treesize of output 7 [2022-11-26 01:11:24,632 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-26 01:11:24,703 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 9 treesize of output 7 [2022-11-26 01:12:21,804 WARN L718 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2022-11-26 01:12:22,050 WARN L718 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2022-11-26 01:12:22,470 WARN L718 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2022-11-26 01:12:22,560 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2022-11-26 01:12:22,893 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 178 refuted. 25 times theorem prover too weak. 0 trivial. 173 not checked. [2022-11-26 01:12:22,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056560468] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 01:12:22,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1339001464] [2022-11-26 01:12:22,896 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2022-11-26 01:12:22,896 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 01:12:22,896 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 01:12:22,897 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 01:12:22,897 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 01:12:22,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:22,941 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-26 01:12:22,992 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-26 01:12:23,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-26 01:12:23,056 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-26 01:12:23,057 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-26 01:12:23,139 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 11 treesize of output 7 [2022-11-26 01:12:23,173 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 11 treesize of output 7 [2022-11-26 01:12:23,227 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 01:12:26,212 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1686#(and (<= 0 |ULTIMATE.start_cstrcpy_~from#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~from#1.offset|) (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (< (select |#length| |ULTIMATE.start_cstrcpy_~from#1.base|) (+ |ULTIMATE.start_cstrcpy_~from#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.offset|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.base|) (<= |ULTIMATE.start_cstrcpy_~save~0#1.offset| 0) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~to#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_~save~0#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.base|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 0 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_#t~malloc7#1.base|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~to#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~from#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_#in~to#1.offset| 0) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0))' at error location [2022-11-26 01:12:26,212 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-26 01:12:26,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-26 01:12:26,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 35, 50] total 103 [2022-11-26 01:12:26,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847841264] [2022-11-26 01:12:26,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-26 01:12:26,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2022-11-26 01:12:26,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 01:12:26,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2022-11-26 01:12:26,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=919, Invalid=7687, Unknown=380, NotChecked=2786, Total=11772 [2022-11-26 01:12:26,225 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 104 states, 103 states have (on average 1.4951456310679612) internal successors, (154), 104 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-26 01:13:42,912 WARN L233 SmtUtils]: Spent 1.25m on a formula simplification. DAG size of input: 249 DAG size of output: 53 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:15:41,668 WARN L233 SmtUtils]: Spent 1.84m on a formula simplification. DAG size of input: 266 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:17:42,178 WARN L233 SmtUtils]: Spent 2.00m on a formula simplification. DAG size of input: 333 DAG size of output: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-26 01:19:36,154 WARN L233 SmtUtils]: Spent 1.88m on a formula simplification. DAG size of input: 272 DAG size of output: 61 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)