./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-15/cstrcpy_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-15/cstrcpy_diffterm_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6208147553435e5714876401f1a4eadd79c0de15784b51d7cedb5e7e16d0b6cb --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 09:50:23,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 09:50:23,289 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 09:50:23,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 09:50:23,306 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 09:50:23,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 09:50:23,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 09:50:23,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 09:50:23,310 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 09:50:23,310 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 09:50:23,311 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 09:50:23,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 09:50:23,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 09:50:23,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 09:50:23,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 09:50:23,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 09:50:23,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 09:50:23,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 09:50:23,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 09:50:23,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 09:50:23,318 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 09:50:23,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 09:50:23,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 09:50:23,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 09:50:23,325 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 09:50:23,325 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 09:50:23,325 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 09:50:23,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 09:50:23,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 09:50:23,327 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 09:50:23,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 09:50:23,328 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 09:50:23,329 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 09:50:23,329 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 09:50:23,330 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 09:50:23,330 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 09:50:23,331 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 09:50:23,331 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 09:50:23,331 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 09:50:23,332 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 09:50:23,332 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 09:50:23,333 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2022-12-14 09:50:23,346 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 09:50:23,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 09:50:23,347 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 09:50:23,347 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 09:50:23,347 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 09:50:23,347 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 09:50:23,348 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 09:50:23,348 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 09:50:23,348 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 09:50:23,348 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 09:50:23,348 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 09:50:23,348 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 09:50:23,348 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 09:50:23,348 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 09:50:23,348 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 09:50:23,348 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 09:50:23,349 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 09:50:23,349 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 09:50:23,349 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-14 09:50:23,349 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-14 09:50:23,349 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 09:50:23,349 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 09:50:23,349 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 09:50:23,350 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 09:50:23,350 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-12-14 09:50:23,350 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-12-14 09:50:23,350 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-12-14 09:50:23,350 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 09:50:23,350 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-12-14 09:50:23,350 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 09:50:23,350 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 09:50:23,350 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 09:50:23,350 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:50:23,351 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 09:50:23,351 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 09:50:23,351 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 09:50:23,351 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 09:50:23,351 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 09:50:23,351 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 09:50:23,351 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_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6208147553435e5714876401f1a4eadd79c0de15784b51d7cedb5e7e16d0b6cb [2022-12-14 09:50:23,511 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 09:50:23,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 09:50:23,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 09:50:23,535 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 09:50:23,535 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 09:50:23,536 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/termination-15/cstrcpy_diffterm_alloca.i [2022-12-14 09:50:26,181 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 09:50:26,324 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 09:50:26,324 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/sv-benchmarks/c/termination-15/cstrcpy_diffterm_alloca.i [2022-12-14 09:50:26,330 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/data/4adc7e20d/25d04acfae4746058b186f8c5800351f/FLAG170d5e0a3 [2022-12-14 09:50:26,341 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/data/4adc7e20d/25d04acfae4746058b186f8c5800351f [2022-12-14 09:50:26,343 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 09:50:26,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 09:50:26,344 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 09:50:26,345 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 09:50:26,348 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 09:50:26,349 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:50:26" (1/1) ... [2022-12-14 09:50:26,350 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c535b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:50:26, skipping insertion in model container [2022-12-14 09:50:26,350 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 09:50:26" (1/1) ... [2022-12-14 09:50:26,355 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 09:50:26,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 09:50:26,599 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:50:26,606 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 09:50:26,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 09:50:26,650 INFO L208 MainTranslator]: Completed translation [2022-12-14 09:50:26,651 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:50:26 WrapperNode [2022-12-14 09:50:26,651 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 09:50:26,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 09:50:26,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 09:50:26,652 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 09:50:26,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:50:26" (1/1) ... [2022-12-14 09:50:26,665 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:50:26" (1/1) ... [2022-12-14 09:50:26,678 INFO L138 Inliner]: procedures = 152, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2022-12-14 09:50:26,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 09:50:26,679 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 09:50:26,679 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 09:50:26,679 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 09:50:26,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:50:26" (1/1) ... [2022-12-14 09:50:26,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:50:26" (1/1) ... [2022-12-14 09:50:26,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:50:26" (1/1) ... [2022-12-14 09:50:26,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:50:26" (1/1) ... [2022-12-14 09:50:26,690 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:50:26" (1/1) ... [2022-12-14 09:50:26,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:50:26" (1/1) ... [2022-12-14 09:50:26,693 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:50:26" (1/1) ... [2022-12-14 09:50:26,693 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:50:26" (1/1) ... [2022-12-14 09:50:26,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 09:50:26,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 09:50:26,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 09:50:26,695 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 09:50:26,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:50:26" (1/1) ... [2022-12-14 09:50:26,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 09:50:26,707 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:50:26,716 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 09:50:26,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 09:50:26,741 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 09:50:26,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 09:50:26,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 09:50:26,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 09:50:26,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 09:50:26,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 09:50:26,803 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 09:50:26,804 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 09:50:26,919 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 09:50:26,962 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 09:50:26,962 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 09:50:26,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:50:26 BoogieIcfgContainer [2022-12-14 09:50:26,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 09:50:26,965 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 09:50:26,965 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 09:50:26,967 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 09:50:26,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 09:50:26" (1/3) ... [2022-12-14 09:50:26,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b118bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:50:26, skipping insertion in model container [2022-12-14 09:50:26,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 09:50:26" (2/3) ... [2022-12-14 09:50:26,968 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b118bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 09:50:26, skipping insertion in model container [2022-12-14 09:50:26,968 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 09:50:26" (3/3) ... [2022-12-14 09:50:26,969 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcpy_diffterm_alloca.i [2022-12-14 09:50:26,983 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 09:50:26,983 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2022-12-14 09:50:27,016 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 09:50:27,021 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;@6adbdc0b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 09:50:27,021 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-12-14 09:50:27,024 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 9 states have (on average 2.111111111111111) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:27,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 09:50:27,029 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:50:27,029 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 09:50:27,029 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-12-14 09:50:27,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:50:27,033 INFO L85 PathProgramCache]: Analyzing trace with hash 85142, now seen corresponding path program 1 times [2022-12-14 09:50:27,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:50:27,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063549361] [2022-12-14 09:50:27,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:50:27,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:50:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:50:27,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:27,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:50:27,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063549361] [2022-12-14 09:50:27,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063549361] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:50:27,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:50:27,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-12-14 09:50:27,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590800286] [2022-12-14 09:50:27,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:50:27,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:50:27,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:50:27,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:50:27,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:50:27,185 INFO L87 Difference]: Start difference. First operand has 17 states, 9 states have (on average 2.111111111111111) internal successors, (19), 16 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:27,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:50:27,219 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2022-12-14 09:50:27,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:50:27,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-12-14 09:50:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:50:27,227 INFO L225 Difference]: With dead ends: 18 [2022-12-14 09:50:27,227 INFO L226 Difference]: Without dead ends: 16 [2022-12-14 09:50:27,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:50:27,231 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 1 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:50:27,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:50:27,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-12-14 09:50:27,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-12-14 09:50:27,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-12-14 09:50:27,254 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 3 [2022-12-14 09:50:27,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:50:27,254 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-12-14 09:50:27,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:27,254 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-12-14 09:50:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 09:50:27,255 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:50:27,255 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 09:50:27,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 09:50:27,255 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-12-14 09:50:27,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:50:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash 85178, now seen corresponding path program 1 times [2022-12-14 09:50:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:50:27,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163352152] [2022-12-14 09:50:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:50:27,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:50:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:50:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:27,376 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:50:27,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163352152] [2022-12-14 09:50:27,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163352152] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:50:27,377 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:50:27,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:50:27,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290382694] [2022-12-14 09:50:27,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:50:27,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-14 09:50:27,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:50:27,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-14 09:50:27,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-14 09:50:27,379 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:27,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:50:27,397 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-12-14 09:50:27,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-14 09:50:27,398 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-12-14 09:50:27,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:50:27,398 INFO L225 Difference]: With dead ends: 15 [2022-12-14 09:50:27,398 INFO L226 Difference]: Without dead ends: 15 [2022-12-14 09:50:27,399 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-12-14 09:50:27,400 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:50:27,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 7 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:50:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-12-14 09:50:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-12-14 09:50:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:27,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-12-14 09:50:27,403 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 3 [2022-12-14 09:50:27,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:50:27,404 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-12-14 09:50:27,404 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-12-14 09:50:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-12-14 09:50:27,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-12-14 09:50:27,404 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:50:27,404 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-12-14 09:50:27,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 09:50:27,405 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-12-14 09:50:27,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:50:27,406 INFO L85 PathProgramCache]: Analyzing trace with hash 85179, now seen corresponding path program 1 times [2022-12-14 09:50:27,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:50:27,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485451016] [2022-12-14 09:50:27,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:50:27,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:50:27,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:50:27,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:27,614 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:50:27,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485451016] [2022-12-14 09:50:27,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485451016] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:50:27,614 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:50:27,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:50:27,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809606603] [2022-12-14 09:50:27,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:50:27,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:50:27,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:50:27,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:50:27,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:50:27,616 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:27,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:50:27,637 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-12-14 09:50:27,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:50:27,637 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-12-14 09:50:27,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:50:27,638 INFO L225 Difference]: With dead ends: 14 [2022-12-14 09:50:27,638 INFO L226 Difference]: Without dead ends: 14 [2022-12-14 09:50:27,638 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-12-14 09:50:27,640 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:50:27,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 6 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:50:27,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-12-14 09:50:27,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-12-14 09:50:27,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:27,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-12-14 09:50:27,642 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 3 [2022-12-14 09:50:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:50:27,643 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-12-14 09:50:27,643 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-12-14 09:50:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-12-14 09:50:27,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 09:50:27,643 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:50:27,643 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 09:50:27,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 09:50:27,644 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-12-14 09:50:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:50:27,644 INFO L85 PathProgramCache]: Analyzing trace with hash 81885786, now seen corresponding path program 1 times [2022-12-14 09:50:27,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:50:27,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434470931] [2022-12-14 09:50:27,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:50:27,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:50:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:50:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:27,717 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:50:27,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434470931] [2022-12-14 09:50:27,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434470931] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:50:27,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:50:27,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 09:50:27,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469165504] [2022-12-14 09:50:27,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:50:27,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:50:27,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:50:27,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:50:27,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:50:27,719 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:50:27,748 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-12-14 09:50:27,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:50:27,749 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-12-14 09:50:27,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:50:27,749 INFO L225 Difference]: With dead ends: 13 [2022-12-14 09:50:27,750 INFO L226 Difference]: Without dead ends: 13 [2022-12-14 09:50:27,750 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:50:27,751 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:50:27,752 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 5 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:50:27,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-12-14 09:50:27,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2022-12-14 09:50:27,754 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-12-14 09:50:27,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-12-14 09:50:27,754 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2022-12-14 09:50:27,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:50:27,755 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-12-14 09:50:27,755 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-12-14 09:50:27,755 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-12-14 09:50:27,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 09:50:27,756 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:50:27,756 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 09:50:27,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 09:50:27,756 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-12-14 09:50:27,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:50:27,757 INFO L85 PathProgramCache]: Analyzing trace with hash 81885787, now seen corresponding path program 1 times [2022-12-14 09:50:27,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:50:27,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718109575] [2022-12-14 09:50:27,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:50:27,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:50:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:50:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:27,886 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:50:27,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718109575] [2022-12-14 09:50:27,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718109575] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:50:27,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:50:27,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:50:27,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097939703] [2022-12-14 09:50:27,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:50:27,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:50:27,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:50:27,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:50:27,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:50:27,887 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:27,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:50:27,946 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-12-14 09:50:27,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:50:27,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 09:50:27,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:50:27,947 INFO L225 Difference]: With dead ends: 19 [2022-12-14 09:50:27,947 INFO L226 Difference]: Without dead ends: 19 [2022-12-14 09:50:27,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:50:27,948 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:50:27,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 11 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:50:27,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-12-14 09:50:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2022-12-14 09:50:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:27,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-12-14 09:50:27,950 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 5 [2022-12-14 09:50:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:50:27,951 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-12-14 09:50:27,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 5 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:27,951 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-12-14 09:50:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 09:50:27,951 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:50:27,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 09:50:27,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 09:50:27,952 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 09:50:27,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:50:27,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1756507928, now seen corresponding path program 1 times [2022-12-14 09:50:27,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:50:27,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140843972] [2022-12-14 09:50:27,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:50:27,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:50:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:50:28,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:28,029 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:50:28,029 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140843972] [2022-12-14 09:50:28,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140843972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:50:28,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:50:28,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:50:28,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662469526] [2022-12-14 09:50:28,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:50:28,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 09:50:28,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:50:28,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 09:50:28,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 09:50:28,031 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:28,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:50:28,067 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-12-14 09:50:28,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-14 09:50:28,067 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 09:50:28,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:50:28,068 INFO L225 Difference]: With dead ends: 14 [2022-12-14 09:50:28,068 INFO L226 Difference]: Without dead ends: 14 [2022-12-14 09:50:28,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-12-14 09:50:28,069 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:50:28,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 5 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:50:28,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-12-14 09:50:28,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-12-14 09:50:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:28,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-12-14 09:50:28,070 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 6 [2022-12-14 09:50:28,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:50:28,071 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-12-14 09:50:28,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:28,071 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-12-14 09:50:28,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 09:50:28,071 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:50:28,071 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 09:50:28,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 09:50:28,071 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 09:50:28,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:50:28,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1756507927, now seen corresponding path program 1 times [2022-12-14 09:50:28,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:50:28,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406121948] [2022-12-14 09:50:28,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:50:28,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:50:28,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:50:28,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:28,231 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:50:28,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406121948] [2022-12-14 09:50:28,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406121948] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:50:28,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:50:28,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 09:50:28,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741694038] [2022-12-14 09:50:28,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:50:28,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 09:50:28,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:50:28,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 09:50:28,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-14 09:50:28,233 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:28,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:50:28,302 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2022-12-14 09:50:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 09:50:28,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 09:50:28,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:50:28,303 INFO L225 Difference]: With dead ends: 16 [2022-12-14 09:50:28,303 INFO L226 Difference]: Without dead ends: 16 [2022-12-14 09:50:28,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-12-14 09:50:28,304 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 32 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:50:28,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 7 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:50:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-12-14 09:50:28,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-12-14 09:50:28,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.25) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:28,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-12-14 09:50:28,306 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 6 [2022-12-14 09:50:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:50:28,306 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-12-14 09:50:28,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-12-14 09:50:28,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 09:50:28,307 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:50:28,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:50:28,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 09:50:28,307 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 09:50:28,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:50:28,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1753858779, now seen corresponding path program 1 times [2022-12-14 09:50:28,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:50:28,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740788455] [2022-12-14 09:50:28,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:50:28,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:50:28,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:50:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:28,394 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:50:28,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740788455] [2022-12-14 09:50:28,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740788455] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 09:50:28,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 09:50:28,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 09:50:28,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552810578] [2022-12-14 09:50:28,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 09:50:28,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 09:50:28,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:50:28,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 09:50:28,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:50:28,396 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:28,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:50:28,410 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-12-14 09:50:28,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 09:50:28,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 09:50:28,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:50:28,411 INFO L225 Difference]: With dead ends: 14 [2022-12-14 09:50:28,411 INFO L226 Difference]: Without dead ends: 12 [2022-12-14 09:50:28,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 09:50:28,412 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 09:50:28,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 10 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 09:50:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-12-14 09:50:28,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-12-14 09:50:28,413 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-12-14 09:50:28,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-12-14 09:50:28,413 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2022-12-14 09:50:28,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:50:28,414 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-12-14 09:50:28,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:28,414 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-12-14 09:50:28,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-12-14 09:50:28,414 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:50:28,414 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 09:50:28,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 09:50:28,414 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2022-12-14 09:50:28,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:50:28,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1753860003, now seen corresponding path program 1 times [2022-12-14 09:50:28,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:50:28,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120584122] [2022-12-14 09:50:28,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:50:28,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:50:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:50:28,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:28,623 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:50:28,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120584122] [2022-12-14 09:50:28,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120584122] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:50:28,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398559070] [2022-12-14 09:50:28,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:50:28,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:50:28,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:50:28,625 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:50:28,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 09:50:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:50:28,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 09:50:28,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:50:28,746 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 09:50:28,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 09:50:28,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 09:50:28,909 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:50:28,909 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 17 [2022-12-14 09:50:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:29,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:50:29,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-12-14 09:50:29,208 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-12-14 09:50:29,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:29,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398559070] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:50:29,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1791719666] [2022-12-14 09:50:29,260 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 09:50:29,260 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:50:29,264 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:50:29,269 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:50:29,270 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:50:29,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:50:29,336 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 09:50:29,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 09:50:29,468 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:50:29,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:50:29,475 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:50:29,475 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-12-14 09:50:29,623 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:50:29,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 09:50:29,699 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:50:29,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 09:50:29,709 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:50:30,474 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '375#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (= |ULTIMATE.start_main_#t~malloc210#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc211#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_main_#t~malloc210#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc211#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 09:50:30,474 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:50:30,474 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:50:30,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 19 [2022-12-14 09:50:30,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460944503] [2022-12-14 09:50:30,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:50:30,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-12-14 09:50:30,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:50:30,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-12-14 09:50:30,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=598, Unknown=0, NotChecked=0, Total=702 [2022-12-14 09:50:30,475 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:30,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:50:30,751 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2022-12-14 09:50:30,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 09:50:30,751 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-12-14 09:50:30,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:50:30,751 INFO L225 Difference]: With dead ends: 18 [2022-12-14 09:50:30,752 INFO L226 Difference]: Without dead ends: 18 [2022-12-14 09:50:30,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2022-12-14 09:50:30,752 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 45 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:50:30,753 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 7 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:50:30,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-12-14 09:50:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 15. [2022-12-14 09:50:30,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:30,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-12-14 09:50:30,755 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 9 [2022-12-14 09:50:30,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:50:30,755 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-12-14 09:50:30,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:30,756 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-12-14 09:50:30,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-14 09:50:30,756 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:50:30,756 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2022-12-14 09:50:30,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 09:50:30,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:50:30,959 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-12-14 09:50:30,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:50:30,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1464914783, now seen corresponding path program 1 times [2022-12-14 09:50:30,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:50:30,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668971032] [2022-12-14 09:50:30,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:50:30,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:50:31,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:50:31,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:31,391 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:50:31,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668971032] [2022-12-14 09:50:31,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668971032] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:50:31,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942708453] [2022-12-14 09:50:31,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:50:31,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:50:31,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:50:31,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:50:31,393 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 09:50:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:50:31,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 66 conjunts are in the unsatisfiable core [2022-12-14 09:50:31,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:50:31,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 10 treesize of output 8 [2022-12-14 09:50:31,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 13 [2022-12-14 09:50:31,576 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-12-14 09:50:31,722 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:50:31,723 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 17 treesize of output 15 [2022-12-14 09:50:31,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:31,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:50:32,148 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2022-12-14 09:50:32,150 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-12-14 09:50:32,184 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:50:32,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:32,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942708453] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:50:32,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2138148854] [2022-12-14 09:50:32,218 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 09:50:32,218 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:50:32,218 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:50:32,218 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:50:32,218 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:50:32,253 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:50:32,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 09:50:32,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 09:50:32,348 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:50:32,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:50:32,354 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:50:32,355 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-12-14 09:50:32,454 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:50:32,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 09:50:32,516 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:50:32,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 09:50:32,540 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:50:33,362 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '509#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (= |ULTIMATE.start_main_#t~malloc210#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1) (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc211#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (= (select |#valid| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) 1) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_main_#t~malloc210#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) |ULTIMATE.start_cstrcpy_#t~mem207#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc211#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 09:50:33,362 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:50:33,362 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:50:33,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2022-12-14 09:50:33,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194846011] [2022-12-14 09:50:33,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:50:33,363 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 09:50:33,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:50:33,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 09:50:33,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2022-12-14 09:50:33,365 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:34,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:50:34,587 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-12-14 09:50:34,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 09:50:34,588 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-12-14 09:50:34,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:50:34,588 INFO L225 Difference]: With dead ends: 16 [2022-12-14 09:50:34,588 INFO L226 Difference]: Without dead ends: 16 [2022-12-14 09:50:34,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=251, Invalid=1471, Unknown=0, NotChecked=0, Total=1722 [2022-12-14 09:50:34,589 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 77 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 09:50:34,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 4 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 09:50:34,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-12-14 09:50:34,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2022-12-14 09:50:34,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-12-14 09:50:34,591 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 10 [2022-12-14 09:50:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:50:34,592 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-12-14 09:50:34,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-12-14 09:50:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 09:50:34,592 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:50:34,592 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1] [2022-12-14 09:50:34,597 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 09:50:34,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:50:34,794 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-12-14 09:50:34,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:50:34,796 INFO L85 PathProgramCache]: Analyzing trace with hash -113626901, now seen corresponding path program 2 times [2022-12-14 09:50:34,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:50:34,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139807516] [2022-12-14 09:50:34,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:50:34,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:50:34,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:50:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:35,239 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:50:35,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139807516] [2022-12-14 09:50:35,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139807516] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:50:35,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455173558] [2022-12-14 09:50:35,239 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 09:50:35,239 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:50:35,239 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:50:35,240 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:50:35,241 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 09:50:35,300 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-12-14 09:50:35,300 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:50:35,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 67 conjunts are in the unsatisfiable core [2022-12-14 09:50:35,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:50:35,308 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 09:50:35,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 09:50:35,464 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 26 treesize of output 26 [2022-12-14 09:50:35,625 INFO L321 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2022-12-14 09:50:35,625 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 30 treesize of output 23 [2022-12-14 09:50:35,734 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:35,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:50:36,076 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:50:36,076 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-12-14 09:50:36,081 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-12-14 09:50:36,084 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-12-14 09:50:36,091 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 35 treesize of output 29 [2022-12-14 09:50:36,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 09:50:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:36,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455173558] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:50:36,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1077174568] [2022-12-14 09:50:36,132 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 09:50:36,132 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:50:36,133 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:50:36,133 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:50:36,133 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:50:36,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:50:36,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 09:50:36,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 09:50:36,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:50:36,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:50:36,268 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:50:36,269 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-12-14 09:50:36,361 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:50:36,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 09:50:36,415 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:50:36,415 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 09:50:36,429 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:50:37,293 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '667#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (= |ULTIMATE.start_main_#t~malloc210#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc211#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_main_#t~malloc210#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc211#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 09:50:37,293 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:50:37,293 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:50:37,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2022-12-14 09:50:37,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920456505] [2022-12-14 09:50:37,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:50:37,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-12-14 09:50:37,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:50:37,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-12-14 09:50:37,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1275, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 09:50:37,294 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:50:38,074 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2022-12-14 09:50:38,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-12-14 09:50:38,074 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 09:50:38,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:50:38,074 INFO L225 Difference]: With dead ends: 20 [2022-12-14 09:50:38,074 INFO L226 Difference]: Without dead ends: 20 [2022-12-14 09:50:38,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=270, Invalid=2082, Unknown=0, NotChecked=0, Total=2352 [2022-12-14 09:50:38,075 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 48 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:50:38,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 7 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 09:50:38,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-12-14 09:50:38,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-12-14 09:50:38,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:38,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-12-14 09:50:38,077 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 13 [2022-12-14 09:50:38,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:50:38,077 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-12-14 09:50:38,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:38,077 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-12-14 09:50:38,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-12-14 09:50:38,078 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:50:38,078 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1] [2022-12-14 09:50:38,082 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 09:50:38,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-12-14 09:50:38,279 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-12-14 09:50:38,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:50:38,279 INFO L85 PathProgramCache]: Analyzing trace with hash 2105849395, now seen corresponding path program 3 times [2022-12-14 09:50:38,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:50:38,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617141914] [2022-12-14 09:50:38,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:50:38,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:50:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:50:38,804 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:38,805 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:50:38,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617141914] [2022-12-14 09:50:38,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617141914] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:50:38,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535277512] [2022-12-14 09:50:38,805 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 09:50:38,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:50:38,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:50:38,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:50:38,810 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 09:50:38,864 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 09:50:38,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:50:38,865 WARN L261 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 102 conjunts are in the unsatisfiable core [2022-12-14 09:50:38,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:50:38,876 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 09:50:38,908 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-12-14 09:50:39,040 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-12-14 09:50:39,286 INFO L321 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-12-14 09:50:39,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 41 [2022-12-14 09:50:39,457 INFO L321 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-12-14 09:50:39,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2022-12-14 09:50:39,565 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:39,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:50:40,358 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:50:40,358 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 63 treesize of output 51 [2022-12-14 09:50:40,363 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 66 treesize of output 60 [2022-12-14 09:50:40,367 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 40 treesize of output 32 [2022-12-14 09:50:40,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 46 [2022-12-14 09:50:40,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-12-14 09:50:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:50:40,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535277512] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:50:40,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [534091554] [2022-12-14 09:50:40,438 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 09:50:40,438 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:50:40,438 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:50:40,439 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:50:40,439 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:50:40,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:50:40,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 09:50:40,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 09:50:40,543 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:50:40,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:50:40,551 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:50:40,551 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-12-14 09:50:40,630 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:50:40,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 09:50:40,685 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:50:40,686 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 09:50:40,694 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:50:41,764 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '873#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (= |ULTIMATE.start_main_#t~malloc210#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc211#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_main_#t~malloc210#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc211#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 09:50:41,764 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:50:41,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:50:41,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 42 [2022-12-14 09:50:41,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830175571] [2022-12-14 09:50:41,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:50:41,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-12-14 09:50:41,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:50:41,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-12-14 09:50:41,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=2246, Unknown=1, NotChecked=0, Total=2450 [2022-12-14 09:50:41,767 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 43 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:50:54,983 WARN L233 SmtUtils]: Spent 12.22s on a formula simplification. DAG size of input: 94 DAG size of output: 88 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:51:01,470 WARN L233 SmtUtils]: Spent 6.37s on a formula simplification. DAG size of input: 104 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:51:02,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:51:02,778 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2022-12-14 09:51:02,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-12-14 09:51:02,778 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-12-14 09:51:02,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:51:02,779 INFO L225 Difference]: With dead ends: 32 [2022-12-14 09:51:02,779 INFO L226 Difference]: Without dead ends: 32 [2022-12-14 09:51:02,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=531, Invalid=4298, Unknown=1, NotChecked=0, Total=4830 [2022-12-14 09:51:02,780 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 112 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 23 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-12-14 09:51:02,780 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 418 Invalid, 2 Unknown, 0 Unchecked, 0.5s Time] [2022-12-14 09:51:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-14 09:51:02,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2022-12-14 09:51:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.0344827586206897) internal successors, (30), 29 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:51:02,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2022-12-14 09:51:02,783 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 17 [2022-12-14 09:51:02,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:51:02,783 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2022-12-14 09:51:02,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 42 states have (on average 1.1904761904761905) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:51:02,783 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2022-12-14 09:51:02,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-12-14 09:51:02,784 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:51:02,784 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 1, 1, 1, 1] [2022-12-14 09:51:02,788 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 09:51:02,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 09:51:02,986 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-12-14 09:51:02,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:51:02,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1967854069, now seen corresponding path program 4 times [2022-12-14 09:51:02,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:51:02,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493763028] [2022-12-14 09:51:02,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:51:02,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:51:03,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:51:04,220 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:51:04,220 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:51:04,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493763028] [2022-12-14 09:51:04,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493763028] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:51:04,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296676213] [2022-12-14 09:51:04,220 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 09:51:04,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:51:04,221 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:51:04,221 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:51:04,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 09:51:04,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:51:04,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 126 conjunts are in the unsatisfiable core [2022-12-14 09:51:04,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:51:04,301 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-12-14 09:51:04,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-12-14 09:51:04,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 09:51:04,343 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 09:51:04,586 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 26 treesize of output 26 [2022-12-14 09:51:05,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 36 treesize of output 34 [2022-12-14 09:51:05,495 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 46 treesize of output 42 [2022-12-14 09:51:06,055 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 56 treesize of output 50 [2022-12-14 09:51:06,771 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 66 treesize of output 58 [2022-12-14 09:51:07,382 INFO L321 Elim1Store]: treesize reduction 20, result has 69.7 percent of original size [2022-12-14 09:51:07,383 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 72 [2022-12-14 09:51:07,399 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 09:51:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:51:07,643 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:51:11,892 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:51:11,892 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 129 treesize of output 84 [2022-12-14 09:51:11,899 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 138 treesize of output 126 [2022-12-14 09:51:11,917 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 167 treesize of output 145 [2022-12-14 09:51:11,930 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-12-14 09:51:11,942 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-12-14 09:51:11,952 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-12-14 09:51:11,961 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-12-14 09:51:11,970 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-12-14 09:51:12,037 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 09:51:12,283 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:51:12,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [296676213] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:51:12,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [519539109] [2022-12-14 09:51:12,285 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 09:51:12,285 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:51:12,285 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:51:12,285 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:51:12,285 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:51:12,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:51:12,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 09:51:12,339 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 09:51:12,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:51:12,402 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:51:12,408 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:51:12,408 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-12-14 09:51:12,485 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:51:12,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 09:51:12,545 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:51:12,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 09:51:12,557 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:51:14,575 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1226#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (= |ULTIMATE.start_main_#t~malloc210#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc211#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_main_#t~malloc210#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc211#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 09:51:14,575 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:51:14,576 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:51:14,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 27, 27] total 75 [2022-12-14 09:51:14,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647721835] [2022-12-14 09:51:14,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:51:14,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-12-14 09:51:14,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:51:14,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-12-14 09:51:14,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=397, Invalid=6368, Unknown=41, NotChecked=0, Total=6806 [2022-12-14 09:51:14,578 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 76 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:51:31,458 WARN L233 SmtUtils]: Spent 12.08s on a formula simplification. DAG size of input: 187 DAG size of output: 164 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:52:07,830 WARN L233 SmtUtils]: Spent 32.86s on a formula simplification. DAG size of input: 231 DAG size of output: 169 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:52:59,099 WARN L233 SmtUtils]: Spent 49.57s on a formula simplification. DAG size of input: 201 DAG size of output: 149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:53:08,503 WARN L233 SmtUtils]: Spent 8.45s on a formula simplification. DAG size of input: 157 DAG size of output: 140 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:53:30,139 WARN L233 SmtUtils]: Spent 21.33s on a formula simplification. DAG size of input: 170 DAG size of output: 154 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:53:40,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 09:53:40,786 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2022-12-14 09:53:40,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-12-14 09:53:40,786 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 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 29 [2022-12-14 09:53:40,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 09:53:40,787 INFO L225 Difference]: With dead ends: 52 [2022-12-14 09:53:40,787 INFO L226 Difference]: Without dead ends: 52 [2022-12-14 09:53:40,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2646 ImplicationChecksByTransitivity, 151.0s TimeCoverageRelationStatistics Valid=1227, Invalid=13470, Unknown=65, NotChecked=0, Total=14762 [2022-12-14 09:53:40,789 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 237 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 73 mSolverCounterUnsat, 40 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 40 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-12-14 09:53:40,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 0 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 1158 Invalid, 40 Unknown, 0 Unchecked, 4.2s Time] [2022-12-14 09:53:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-12-14 09:53:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2022-12-14 09:53:40,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 49 states have (on average 1.0204081632653061) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:53:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2022-12-14 09:53:40,792 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 29 [2022-12-14 09:53:40,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 09:53:40,792 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2022-12-14 09:53:40,792 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 1.1466666666666667) internal successors, (86), 76 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:53:40,792 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2022-12-14 09:53:40,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 09:53:40,792 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 09:53:40,793 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 1, 1, 1, 1] [2022-12-14 09:53:40,797 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 09:53:40,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:53:40,993 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-12-14 09:53:40,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 09:53:40,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1141583757, now seen corresponding path program 5 times [2022-12-14 09:53:40,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 09:53:40,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581333336] [2022-12-14 09:53:40,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 09:53:40,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 09:53:41,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 09:53:43,235 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:53:43,235 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 09:53:43,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581333336] [2022-12-14 09:53:43,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581333336] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 09:53:43,236 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [673565177] [2022-12-14 09:53:43,236 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 09:53:43,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 09:53:43,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 09:53:43,237 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 09:53:43,237 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c589e67b-7195-4074-a770-d729011a16da/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 09:53:43,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-12-14 09:53:43,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 09:53:43,546 WARN L261 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 268 conjunts are in the unsatisfiable core [2022-12-14 09:53:43,551 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 09:53:43,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 09:53:43,563 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-12-14 09:53:43,610 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-12-14 09:53:43,862 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-12-14 09:53:44,229 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-12-14 09:53:44,683 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2022-12-14 09:53:45,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 41 [2022-12-14 09:53:45,769 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-12-14 09:53:46,449 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-12-14 09:53:47,181 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-12-14 09:53:48,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 67 [2022-12-14 09:53:48,933 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 87 treesize of output 71 [2022-12-14 09:53:49,901 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 77 [2022-12-14 09:53:50,907 INFO L321 Elim1Store]: treesize reduction 40, result has 76.3 percent of original size [2022-12-14 09:53:50,908 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 45 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 21 case distinctions, treesize of input 99 treesize of output 175 [2022-12-14 09:53:50,924 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2022-12-14 09:53:50,952 WARN L718 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2022-12-14 09:53:51,660 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 09:53:51,660 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 09:53:56,195 WARN L837 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 49) (forall ((v_ArrVal_273 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) (forall ((v_ArrVal_272 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 49)) (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| Int) (v_ArrVal_275 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| 1) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (< (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)) 49) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|))))) is different from false [2022-12-14 09:53:57,550 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| Int) (v_ArrVal_275 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| 1) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)) 49) (< (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 49) (forall ((v_ArrVal_271 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) (forall ((v_ArrVal_273 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 49)) (forall ((v_ArrVal_272 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))))) is different from false [2022-12-14 09:54:01,308 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_272 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 49) (forall ((v_ArrVal_269 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) (forall ((v_ArrVal_271 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) (forall ((v_ArrVal_273 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) (forall ((v_ArrVal_270 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| Int) (v_ArrVal_275 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| 1) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)) 49) (< (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|))))) is different from false [2022-12-14 09:54:50,402 WARN L837 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_267 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 49)) (forall ((v_ArrVal_273 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 49) (forall ((v_ArrVal_271 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) (forall ((v_ArrVal_268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) 49)) (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| Int) (v_ArrVal_275 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| 1) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (< (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)) 49) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)))) (forall ((v_ArrVal_266 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) (forall ((v_ArrVal_269 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) (forall ((v_ArrVal_270 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)))) (forall ((v_ArrVal_272 (Array Int Int))) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|))))) is different from false [2022-12-14 09:56:04,098 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:56:04,099 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 244 treesize of output 144 [2022-12-14 09:56:04,107 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 263 treesize of output 241 [2022-12-14 09:56:04,113 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-12-14 09:56:04,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 09:56:04,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 11 select indices, 11 select index equivalence classes, 45 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 10 case distinctions, treesize of input 228 treesize of output 286 [2022-12-14 09:56:04,245 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-12-14 09:56:05,317 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 09:56:05,684 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 09:56:05,702 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 09:56:05,729 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 09:56:05,749 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 09:56:05,766 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2022-12-14 09:56:05,868 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 09:56:05,908 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 09:56:05,924 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 09:56:05,971 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 09:56:05,987 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-12-14 09:56:06,007 WARN L718 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2022-12-14 09:56:06,025 WARN L718 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2022-12-14 09:56:06,055 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-12-14 09:56:06,072 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 09:56:06,114 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 09:56:06,192 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-12-14 09:56:06,221 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-12-14 09:56:06,227 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-12-14 09:56:06,233 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-12-14 09:56:06,239 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-12-14 09:56:06,245 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-12-14 09:56:06,250 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-12-14 09:56:06,256 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-12-14 09:56:06,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-12-14 09:56:06,596 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 80 refuted. 124 times theorem prover too weak. 0 trivial. 38 not checked. [2022-12-14 09:56:06,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [673565177] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 09:56:06,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [616290482] [2022-12-14 09:56:06,597 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 09:56:06,597 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 09:56:06,597 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 09:56:06,597 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 09:56:06,597 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 09:56:06,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:56:06,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-12-14 09:56:06,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-12-14 09:56:06,702 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 09:56:06,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 09:56:06,710 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-14 09:56:06,710 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-12-14 09:56:06,783 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:56:06,783 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 09:56:06,842 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-12-14 09:56:06,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2022-12-14 09:56:06,849 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 09:56:10,205 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1831#(and (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.offset|) (= |ULTIMATE.start_main_#t~malloc210#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s1#1.offset| 0) (= |ULTIMATE.start_cstrcpy_~dst~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post205#1.offset| 1)) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= 0 |ULTIMATE.start_cstrcpy_#t~post205#1.offset|) (= |ULTIMATE.start_cstrcpy_~dst~0#1.base| |ULTIMATE.start_cstrcpy_#t~post205#1.base|) (= |ULTIMATE.start_cstrcpy_#t~post206#1.base| |ULTIMATE.start_cstrcpy_~src~0#1.base|) (<= 0 |ULTIMATE.start_main_~nondetArea~0#1.base|) (<= |ULTIMATE.start_cstrcpy_#in~s1#1.offset| 0) (<= |ULTIMATE.start_cstrcpy_~s2#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc211#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.offset|) (<= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.base|) (< (select |#length| |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_main_~nondetString~0#1.offset|) (<= |ULTIMATE.start_main_~length1~0#1| 2147483647) (<= |ULTIMATE.start_cstrcpy_#in~s2#1.offset| 0) (= |#NULL.offset| 0) (= |ULTIMATE.start_cstrcpy_~src~0#1.offset| (+ |ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (<= 0 |ULTIMATE.start_main_#t~malloc210#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s2#1.offset|) (<= 0 |ULTIMATE.start_main_#t~malloc211#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_#in~s1#1.base|) (<= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 0 |ULTIMATE.start_cstrcpy_#t~post206#1.base|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~length2~0#1| 2147483647) (= |#NULL.base| 0) (<= 0 |ULTIMATE.start_cstrcpy_~s1#1.base|) (<= 0 |ULTIMATE.start_cstrcpy_~s2#1.offset|))' at error location [2022-12-14 09:56:10,205 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 09:56:10,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 09:56:10,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 47, 47] total 129 [2022-12-14 09:56:10,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654884822] [2022-12-14 09:56:10,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 09:56:10,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-12-14 09:56:10,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 09:56:10,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-12-14 09:56:10,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1002, Invalid=16008, Unknown=562, NotChecked=1060, Total=18632 [2022-12-14 09:56:10,211 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 130 states, 129 states have (on average 1.124031007751938) internal successors, (145), 130 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 09:56:43,392 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post206#1.base|)) (.cse24 (div |c_ULTIMATE.start_main_~length2~0#1| 18446744073709551616))) (let ((.cse13 (+ 8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse7 (<= (+ .cse24 1) 0)) (.cse6 (+ (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (* 18446744073709551616 .cse24))) (.cse17 (+ 7 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse12 (+ 5 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse8 (+ |c_ULTIMATE.start_cstrcpy_#t~post206#1.offset| 1)) (.cse1 (= (select .cse0 |c_ULTIMATE.start_cstrcpy_#t~post206#1.offset|) 49)) (.cse2 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|)) (.cse5 (+ 3 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse15 (+ 4 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse14 (+ 6 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse4 (+ 1 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse11 (+ 2 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (.cse9 (select |c_#length| |c_ULTIMATE.start_cstrcpy_#t~post206#1.base|))) (and (not (= 49 (select .cse0 7))) (or .cse1 (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_272))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| 1) .cse2) (= 49 (select (select (store .cse3 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4)) (< .cse5 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|) (= (select (select .cse3 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 49) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)) (= 49 (select (select (store .cse3 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|))))))) (not (= 49 (select .cse0 4))) (not (= (select .cse0 5) 49)) (or (<= .cse6 |c_ULTIMATE.start_main_~length2~0#1|) .cse7) (= 0 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) (<= |c_ULTIMATE.start_cstrcpy_#t~post206#1.offset| 10) (= .cse8 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (<= 11 .cse9) (<= 11 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) (or .cse1 (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| Int) (v_ArrVal_270 (Array Int Int)) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_269 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_267))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| 1) .cse2) (= 49 (select (select (store .cse10 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|))) (= 49 (select (select (store .cse10 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse11)) (= 49 (select (select (store .cse10 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5)) (= 49 (select (select (store .cse10 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse12)) (< .cse13 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|) (= 49 (select (select .cse10 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (= 49 (select (select (store .cse10 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4)) (= 49 (select (select (store .cse10 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse14)) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)) (= 49 (select (select (store .cse10 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse15)))))) (<= |c_ULTIMATE.start_cstrcpy_#t~post206#1.offset| 11) (or .cse1 (<= .cse4 .cse2) (<= .cse9 |c_ULTIMATE.start_cstrcpy_#t~post206#1.offset|)) (or .cse1 (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| Int) (v_ArrVal_270 (Array Int Int)) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (v_ArrVal_265 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int)) (v_ArrVal_269 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_265))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| 1) .cse2) (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse12)) (= (select (select (store .cse16 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse17) 49) (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|))) (< (+ 10 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|) (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse15)) (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse14)) (= (select (select .cse16 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) 49) (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_266) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4)) (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse13)) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)) (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse11)) (= 49 (select (select (store .cse16 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5)))))) (or .cse1 (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| Int) (v_ArrVal_275 (Array Int Int))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| 1) .cse2) (= 49 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_275) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|))) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)) (not (<= |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| .cse4))))) (<= 1 |c_ULTIMATE.start_cstrcpy_#t~post206#1.offset|) (or (not .cse7) (<= |c_ULTIMATE.start_main_~length2~0#1| .cse6)) (or .cse1 (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| Int) (v_ArrVal_270 (Array Int Int)) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_267 (Array Int Int)) (v_ArrVal_266 (Array Int Int)) (v_ArrVal_269 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse18 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_266))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| 1) .cse2) (= (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse15) 49) (< (+ 9 |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|) (= 49 (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse14)) (= 49 (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse17)) (= 49 (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse12)) (= 49 (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5)) (= 49 (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|))) (= 49 (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_267) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4)) (= 49 (select (select .cse18 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)) (= 49 (select (select (store .cse18 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_268) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse11)))))) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (not (= 49 (select .cse0 1))) (or (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| Int) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_271))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| 1) .cse2) (= 49 (select (select (store .cse19 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4)) (= 49 (select (select (store .cse19 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|))) (= 49 (select (select .cse19 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (< .cse15 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)) (= 49 (select (select (store .cse19 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse11))))) .cse1) (or .cse1 (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| Int) (v_ArrVal_270 (Array Int Int)) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_269 (Array Int Int)) (v_ArrVal_268 (Array Int Int))) (let ((.cse20 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_268))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| 1) .cse2) (= (select (select (store .cse20 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse11) 49) (= 49 (select (select (store .cse20 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse12)) (= (select (select (store .cse20 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5) 49) (= 49 (select (select (store .cse20 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|))) (= 49 (select (select .cse20 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (= 49 (select (select (store .cse20 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse15)) (= (select (select (store .cse20 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_269) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4) 49) (< .cse17 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)))))) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (or .cse1 (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| Int) (v_ArrVal_270 (Array Int Int)) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_270))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| 1) .cse2) (= 49 (select (select (store .cse21 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4)) (= (select (select (store .cse21 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse11) 49) (= (select (select (store .cse21 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)) 49) (= 49 (select (select (store .cse21 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5)) (= 49 (select (select .cse21 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (< .cse12 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)))))) (not (= 49 (select .cse0 3))) (not (= 49 (select .cse0 8))) (not (= 49 (select .cse0 9))) (not (= 49 (select .cse0 2))) (<= .cse8 .cse9) (or .cse1 (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| Int) (v_ArrVal_273 (Array Int Int)) (v_ArrVal_275 (Array Int Int))) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_273))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| 1) .cse2) (= 49 (select (select (store .cse22 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|))) (= 49 (select (select .cse22 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (< .cse11 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)))))) (not (= 49 (select .cse0 0))) (= |c_ULTIMATE.start_cstrcpy_#t~post206#1.base| |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (or .cse1 (forall ((|v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| Int) (v_ArrVal_270 (Array Int Int)) (v_ArrVal_272 (Array Int Int)) (v_ArrVal_271 (Array Int Int)) (v_ArrVal_273 (Array Int Int)) (v_ArrVal_275 (Array Int Int)) (v_ArrVal_269 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_#t~post205#1.base| v_ArrVal_269))) (or (<= (+ |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69| 1) .cse2) (= 49 (select (select (store .cse23 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_275) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) (+ (- 1) |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|))) (= 49 (select (select (store .cse23 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_272) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse5)) (= 49 (select (select (store .cse23 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_273) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse15)) (< .cse14 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|) (= 49 (select (select (store .cse23 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_270) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse4)) (= 49 (select (select .cse23 |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) |c_ULTIMATE.start_cstrcpy_~src~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_cstrcpy_~src~0#1.offset_69|)) (= (select (select (store .cse23 |c_ULTIMATE.start_cstrcpy_~dst~0#1.base| v_ArrVal_271) |c_ULTIMATE.start_cstrcpy_~src~0#1.base|) .cse11) 49))))) (not (= 49 (select .cse0 6))) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (= 49 (select .cse0 (+ (- 1) |ULTIMATE.start_main_~length2~0#1|))) (<= |ULTIMATE.start_main_~length2~0#1| .cse9) (<= 1 |ULTIMATE.start_main_~length2~0#1|)))))) is different from true [2022-12-14 09:58:23,849 WARN L233 SmtUtils]: Spent 1.65m on a formula simplification. DAG size of input: 350 DAG size of output: 280 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:58:25,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:58:29,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:58:30,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:58:32,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:58:33,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 09:58:35,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:58:38,482 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:59:39,133 WARN L233 SmtUtils]: Spent 46.19s on a formula simplification. DAG size of input: 283 DAG size of output: 214 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 09:59:41,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:59:42,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 09:59:44,452 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 09:59:45,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2022-12-14 10:03:05,900 WARN L233 SmtUtils]: Spent 3.07m on a formula simplification. DAG size of input: 339 DAG size of output: 270 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:03:07,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:03:10,694 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:03:13,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:03:16,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:03:19,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:03:20,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:03:22,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:03:24,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:03:26,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:03:28,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:03:30,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:03:31,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:03:39,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:04:07,999 WARN L233 SmtUtils]: Spent 10.25s on a formula simplification. DAG size of input: 237 DAG size of output: 164 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:04:10,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:04:12,256 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:04:14,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:04:17,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.77s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:04:18,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:04:20,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:04:22,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:04:49,925 WARN L233 SmtUtils]: Spent 12.18s on a formula simplification. DAG size of input: 258 DAG size of output: 191 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-14 10:04:52,431 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:04:54,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:04:56,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:04:59,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:05:02,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:05:03,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:05:22,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:05:24,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-14 10:05:26,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]