./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpcpy-alloca-2.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc 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_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpcpy-alloca-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --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 bebfef36417cc629a011ca1d30e6696f3048116bc9623a75bf9b2a872de91ab8 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:17:27,550 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:17:27,615 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-DerefFreeMemtrack-64bit-Taipan_Default.epf [2023-12-02 13:17:27,619 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:17:27,620 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:17:27,644 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:17:27,644 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:17:27,645 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:17:27,646 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:17:27,646 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:17:27,647 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:17:27,647 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:17:27,648 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:17:27,648 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 13:17:27,649 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:17:27,649 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:17:27,650 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 13:17:27,650 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 13:17:27,651 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:17:27,651 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 13:17:27,652 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 13:17:27,652 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 13:17:27,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-02 13:17:27,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-02 13:17:27,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:17:27,654 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:17:27,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:17:27,655 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-12-02 13:17:27,656 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-12-02 13:17:27,656 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-12-02 13:17:27,656 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:17:27,657 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-02 13:17:27,657 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-12-02 13:17:27,658 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:17:27,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:17:27,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:17:27,658 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:17:27,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:17:27,659 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:17:27,659 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:17:27,659 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 13:17:27,660 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 13:17:27,660 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:17:27,660 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:17:27,660 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:17:27,660 INFO L153 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/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_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> bebfef36417cc629a011ca1d30e6696f3048116bc9623a75bf9b2a872de91ab8 [2023-12-02 13:17:27,888 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:17:27,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:17:27,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:17:27,913 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:17:27,913 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:17:27,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/termination-memory-alloca/openbsd_cstpcpy-alloca-2.i [2023-12-02 13:17:30,670 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:17:30,903 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:17:30,903 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/sv-benchmarks/c/termination-memory-alloca/openbsd_cstpcpy-alloca-2.i [2023-12-02 13:17:30,917 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/data/e833e75db/18b626b5a94940859bbcbeeceafe2417/FLAG2d2f36c01 [2023-12-02 13:17:30,931 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/data/e833e75db/18b626b5a94940859bbcbeeceafe2417 [2023-12-02 13:17:30,933 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:17:30,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:17:30,935 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:17:30,936 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:17:30,941 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:17:30,941 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:17:30" (1/1) ... [2023-12-02 13:17:30,942 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4094e873 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:30, skipping insertion in model container [2023-12-02 13:17:30,943 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:17:30" (1/1) ... [2023-12-02 13:17:30,990 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:17:31,244 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:17:31,256 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:17:31,288 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:17:31,314 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:17:31,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:31 WrapperNode [2023-12-02 13:17:31,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:17:31,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:17:31,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:17:31,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:17:31,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:31" (1/1) ... [2023-12-02 13:17:31,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:31" (1/1) ... [2023-12-02 13:17:31,356 INFO L138 Inliner]: procedures = 111, calls = 12, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2023-12-02 13:17:31,356 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:17:31,357 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:17:31,357 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:17:31,357 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:17:31,366 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:31" (1/1) ... [2023-12-02 13:17:31,366 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:31" (1/1) ... [2023-12-02 13:17:31,369 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:31" (1/1) ... [2023-12-02 13:17:31,369 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:31" (1/1) ... [2023-12-02 13:17:31,375 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:31" (1/1) ... [2023-12-02 13:17:31,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:31" (1/1) ... [2023-12-02 13:17:31,380 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:31" (1/1) ... [2023-12-02 13:17:31,381 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:31" (1/1) ... [2023-12-02 13:17:31,383 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:17:31,384 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:17:31,384 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:17:31,385 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:17:31,386 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:31" (1/1) ... [2023-12-02 13:17:31,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:17:31,402 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:17:31,414 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-12-02 13:17:31,417 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-12-02 13:17:31,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 13:17:31,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 13:17:31,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-12-02 13:17:31,448 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-02 13:17:31,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:17:31,449 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:17:31,560 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:17:31,562 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:17:31,705 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:17:31,740 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:17:31,740 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-02 13:17:31,742 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:17:31 BoogieIcfgContainer [2023-12-02 13:17:31,742 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:17:31,745 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:17:31,745 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:17:31,749 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:17:31,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:17:30" (1/3) ... [2023-12-02 13:17:31,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30181089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:17:31, skipping insertion in model container [2023-12-02 13:17:31,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:17:31" (2/3) ... [2023-12-02 13:17:31,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30181089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:17:31, skipping insertion in model container [2023-12-02 13:17:31,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:17:31" (3/3) ... [2023-12-02 13:17:31,752 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca-2.i [2023-12-02 13:17:31,772 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:17:31,772 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 7 error locations. [2023-12-02 13:17:31,813 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:17:31,819 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;@79c120b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:17:31,820 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2023-12-02 13:17:31,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 8 states have (on average 2.25) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:31,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-12-02 13:17:31,830 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:17:31,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-12-02 13:17:31,831 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)] === [2023-12-02 13:17:31,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:17:31,835 INFO L85 PathProgramCache]: Analyzing trace with hash 86103, now seen corresponding path program 1 times [2023-12-02 13:17:31,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:17:31,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973998785] [2023-12-02 13:17:31,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:17:31,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:17:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:32,005 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:17:32,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973998785] [2023-12-02 13:17:32,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973998785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:17:32,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:17:32,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-12-02 13:17:32,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98581651] [2023-12-02 13:17:32,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:17:32,013 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:17:32,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:17:32,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:17:32,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:17:32,046 INFO L87 Difference]: Start difference. First operand has 16 states, 8 states have (on average 2.25) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:17:32,090 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-12-02 13:17:32,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:17:32,092 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 [2023-12-02 13:17:32,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:17:32,100 INFO L225 Difference]: With dead ends: 17 [2023-12-02 13:17:32,100 INFO L226 Difference]: Without dead ends: 15 [2023-12-02 13:17:32,102 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 [2023-12-02 13:17:32,106 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 1 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:17:32,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 15 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:17:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-02 13:17:32,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-02 13:17:32,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 8 states have (on average 1.875) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:32,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2023-12-02 13:17:32,138 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 3 [2023-12-02 13:17:32,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:17:32,138 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2023-12-02 13:17:32,139 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) [2023-12-02 13:17:32,139 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2023-12-02 13:17:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-12-02 13:17:32,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:17:32,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-12-02 13:17:32,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 13:17:32,140 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)] === [2023-12-02 13:17:32,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:17:32,141 INFO L85 PathProgramCache]: Analyzing trace with hash 86139, now seen corresponding path program 1 times [2023-12-02 13:17:32,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:17:32,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953786227] [2023-12-02 13:17:32,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:17:32,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:17:32,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:32,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:32,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:17:32,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953786227] [2023-12-02 13:17:32,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953786227] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:17:32,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:17:32,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:17:32,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677700169] [2023-12-02 13:17:32,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:17:32,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:17:32,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:17:32,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:17:32,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:17:32,290 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:17:32,309 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2023-12-02 13:17:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:17:32,310 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 [2023-12-02 13:17:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:17:32,310 INFO L225 Difference]: With dead ends: 14 [2023-12-02 13:17:32,310 INFO L226 Difference]: Without dead ends: 14 [2023-12-02 13:17:32,311 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 [2023-12-02 13:17:32,312 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:17:32,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 5 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:17:32,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-02 13:17:32,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-02 13:17:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 8 states have (on average 1.75) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2023-12-02 13:17:32,316 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 3 [2023-12-02 13:17:32,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:17:32,316 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2023-12-02 13:17:32,317 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) [2023-12-02 13:17:32,317 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2023-12-02 13:17:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-12-02 13:17:32,317 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:17:32,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-12-02 13:17:32,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 13:17:32,318 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)] === [2023-12-02 13:17:32,318 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:17:32,319 INFO L85 PathProgramCache]: Analyzing trace with hash 86140, now seen corresponding path program 1 times [2023-12-02 13:17:32,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:17:32,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780029824] [2023-12-02 13:17:32,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:17:32,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:17:32,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:32,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:32,537 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:17:32,537 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780029824] [2023-12-02 13:17:32,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780029824] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:17:32,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:17:32,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:17:32,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145642395] [2023-12-02 13:17:32,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:17:32,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:17:32,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:17:32,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:17:32,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:17:32,539 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 3 states have (on average 1.0) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:17:32,564 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2023-12-02 13:17:32,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:17:32,565 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 [2023-12-02 13:17:32,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:17:32,565 INFO L225 Difference]: With dead ends: 13 [2023-12-02 13:17:32,565 INFO L226 Difference]: Without dead ends: 13 [2023-12-02 13:17:32,566 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 [2023-12-02 13:17:32,567 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:17:32,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:17:32,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-02 13:17:32,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-02 13:17:32,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.625) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2023-12-02 13:17:32,571 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 3 [2023-12-02 13:17:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:17:32,571 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2023-12-02 13:17:32,571 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) [2023-12-02 13:17:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2023-12-02 13:17:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 13:17:32,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:17:32,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 13:17:32,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-02 13:17:32,573 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)] === [2023-12-02 13:17:32,573 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:17:32,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2671298, now seen corresponding path program 1 times [2023-12-02 13:17:32,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:17:32,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392542737] [2023-12-02 13:17:32,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:17:32,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:17:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:32,618 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:17:32,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392542737] [2023-12-02 13:17:32,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392542737] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:17:32,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:17:32,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:17:32,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570968439] [2023-12-02 13:17:32,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:17:32,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:17:32,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:17:32,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:17:32,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:17:32,620 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:32,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:17:32,641 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2023-12-02 13:17:32,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:17:32,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 13:17:32,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:17:32,642 INFO L225 Difference]: With dead ends: 12 [2023-12-02 13:17:32,642 INFO L226 Difference]: Without dead ends: 12 [2023-12-02 13:17:32,642 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 [2023-12-02 13:17:32,643 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:17:32,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:17:32,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-02 13:17:32,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-12-02 13:17:32,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.5) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:32,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2023-12-02 13:17:32,647 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 4 [2023-12-02 13:17:32,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:17:32,647 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2023-12-02 13:17:32,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:32,647 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2023-12-02 13:17:32,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-12-02 13:17:32,648 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:17:32,648 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-12-02 13:17:32,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-02 13:17:32,648 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)] === [2023-12-02 13:17:32,649 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:17:32,649 INFO L85 PathProgramCache]: Analyzing trace with hash 2671299, now seen corresponding path program 1 times [2023-12-02 13:17:32,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:17:32,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57060680] [2023-12-02 13:17:32,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:17:32,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:17:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:32,735 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:17:32,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57060680] [2023-12-02 13:17:32,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57060680] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:17:32,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:17:32,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:17:32,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015323810] [2023-12-02 13:17:32,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:17:32,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:17:32,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:17:32,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:17:32,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:17:32,737 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:32,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:17:32,773 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2023-12-02 13:17:32,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:17:32,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2023-12-02 13:17:32,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:17:32,774 INFO L225 Difference]: With dead ends: 18 [2023-12-02 13:17:32,774 INFO L226 Difference]: Without dead ends: 18 [2023-12-02 13:17:32,775 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 [2023-12-02 13:17:32,776 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 22 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:17:32,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 8 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:17:32,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-02 13:17:32,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 13. [2023-12-02 13:17:32,779 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) [2023-12-02 13:17:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2023-12-02 13:17:32,780 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 4 [2023-12-02 13:17:32,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:17:32,780 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2023-12-02 13:17:32,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:32,781 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2023-12-02 13:17:32,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 13:17:32,781 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:17:32,781 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 13:17:32,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-02 13:17:32,782 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-12-02 13:17:32,782 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:17:32,782 INFO L85 PathProgramCache]: Analyzing trace with hash 82810239, now seen corresponding path program 1 times [2023-12-02 13:17:32,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:17:32,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945858765] [2023-12-02 13:17:32,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:17:32,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:17:32,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:32,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:32,975 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:17:32,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945858765] [2023-12-02 13:17:32,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945858765] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:17:32,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:17:32,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:17:32,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229894742] [2023-12-02 13:17:32,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:17:32,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-02 13:17:32,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:17:32,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-02 13:17:32,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-02 13:17:32,977 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:33,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:17:33,046 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2023-12-02 13:17:33,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:17:33,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-02 13:17:33,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:17:33,048 INFO L225 Difference]: With dead ends: 17 [2023-12-02 13:17:33,048 INFO L226 Difference]: Without dead ends: 17 [2023-12-02 13:17:33,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-02 13:17:33,050 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 36 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:17:33,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 4 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:17:33,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2023-12-02 13:17:33,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2023-12-02 13:17:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.5) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:33,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-12-02 13:17:33,053 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 5 [2023-12-02 13:17:33,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:17:33,054 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-12-02 13:17:33,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:33,054 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-12-02 13:17:33,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-02 13:17:33,055 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:17:33,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-02 13:17:33,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-02 13:17:33,055 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-12-02 13:17:33,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:17:33,056 INFO L85 PathProgramCache]: Analyzing trace with hash 82810238, now seen corresponding path program 1 times [2023-12-02 13:17:33,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:17:33,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063727758] [2023-12-02 13:17:33,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:17:33,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:17:33,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:33,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:33,140 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:17:33,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063727758] [2023-12-02 13:17:33,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063727758] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:17:33,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:17:33,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:17:33,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018364854] [2023-12-02 13:17:33,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:17:33,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:17:33,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:17:33,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:17:33,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:17:33,142 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:33,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:17:33,170 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2023-12-02 13:17:33,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:17:33,171 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 [2023-12-02 13:17:33,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:17:33,171 INFO L225 Difference]: With dead ends: 13 [2023-12-02 13:17:33,171 INFO L226 Difference]: Without dead ends: 13 [2023-12-02 13:17:33,171 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 [2023-12-02 13:17:33,172 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:17:33,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 4 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:17:33,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-02 13:17:33,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-02 13:17:33,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 10 states have (on average 1.3) internal successors, (13), 12 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:33,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2023-12-02 13:17:33,176 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 5 [2023-12-02 13:17:33,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:17:33,176 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2023-12-02 13:17:33,176 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) [2023-12-02 13:17:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2023-12-02 13:17:33,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-02 13:17:33,177 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:17:33,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:17:33,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-02 13:17:33,177 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-12-02 13:17:33,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:17:33,178 INFO L85 PathProgramCache]: Analyzing trace with hash -2023739288, now seen corresponding path program 1 times [2023-12-02 13:17:33,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:17:33,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791562835] [2023-12-02 13:17:33,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:17:33,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:17:33,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:33,408 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:17:33,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791562835] [2023-12-02 13:17:33,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791562835] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:17:33,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062197390] [2023-12-02 13:17:33,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:17:33,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:17:33,409 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:17:33,410 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:17:33,416 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 13:17:33,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:33,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-02 13:17:33,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:17:33,581 INFO L378 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 [2023-12-02 13:17:33,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:17:33,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2023-12-02 13:17:33,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:33,769 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:17:33,892 INFO L378 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 [2023-12-02 13:17:33,901 INFO L378 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 [2023-12-02 13:17:33,914 INFO L378 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 13 treesize of output 9 [2023-12-02 13:17:33,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:33,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062197390] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:17:33,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [264314635] [2023-12-02 13:17:33,941 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 13:17:33,941 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:17:33,944 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:17:33,949 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:17:33,949 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:17:35,650 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:17:36,575 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '300#(and (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstpcpy_~from#1.offset|) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_main_#t~malloc7#1.base|) (<= 2 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 2 |ULTIMATE.start_main_~nondetArea~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 2 |ULTIMATE.start_cstpcpy_#in~from#1.base|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_cstpcpy_~from#1.base|) |ULTIMATE.start_cstpcpy_~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_cstpcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_cstpcpy_#in~from#1.offset| 0) (<= 2 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 2 |ULTIMATE.start_cstpcpy_~from#1.base|) (= |ULTIMATE.start_cstpcpy_#in~to#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (<= 2 |ULTIMATE.start_cstpcpy_#in~to#1.base|) (<= 2 |ULTIMATE.start_cstpcpy_~to#1.base|))' at error location [2023-12-02 13:17:36,575 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:17:36,575 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:17:36,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 12 [2023-12-02 13:17:36,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437081832] [2023-12-02 13:17:36,576 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:17:36,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-02 13:17:36,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:17:36,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-02 13:17:36,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2023-12-02 13:17:36,578 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:36,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:17:36,812 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2023-12-02 13:17:36,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:17:36,813 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-02 13:17:36,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:17:36,814 INFO L225 Difference]: With dead ends: 20 [2023-12-02 13:17:36,814 INFO L226 Difference]: Without dead ends: 20 [2023-12-02 13:17:36,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2023-12-02 13:17:36,815 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 31 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:17:36,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 15 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:17:36,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-02 13:17:36,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2023-12-02 13:17:36,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 14 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:36,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2023-12-02 13:17:36,819 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 7 [2023-12-02 13:17:36,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:17:36,819 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2023-12-02 13:17:36,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:36,819 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2023-12-02 13:17:36,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 13:17:36,820 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:17:36,820 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2023-12-02 13:17:36,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 13:17:37,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-02 13:17:37,025 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-12-02 13:17:37,026 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:17:37,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1688591482, now seen corresponding path program 1 times [2023-12-02 13:17:37,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:17:37,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728614166] [2023-12-02 13:17:37,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:17:37,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:17:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:37,417 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:17:37,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728614166] [2023-12-02 13:17:37,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728614166] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:17:37,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314797405] [2023-12-02 13:17:37,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:17:37,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:17:37,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:17:37,419 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:17:37,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 13:17:37,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:37,489 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 45 conjunts are in the unsatisfiable core [2023-12-02 13:17:37,492 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:17:37,549 INFO L378 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 13 treesize of output 1 [2023-12-02 13:17:37,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 13:17:37,569 INFO L378 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 [2023-12-02 13:17:37,622 INFO L378 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 [2023-12-02 13:17:37,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:17:37,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2023-12-02 13:17:37,787 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:37,787 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:17:37,937 INFO L378 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 [2023-12-02 13:17:37,941 INFO L378 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 [2023-12-02 13:17:38,002 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-02 13:17:38,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:38,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314797405] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:17:38,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1804247496] [2023-12-02 13:17:38,037 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 13:17:38,038 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:17:38,038 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:17:38,038 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:17:38,039 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:17:39,275 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:17:40,091 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '415#(and (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstpcpy_~from#1.offset|) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_main_#t~malloc7#1.base|) (<= 2 |ULTIMATE.start_main_~nondetString~0#1.base|) (= (select (select |#memory_int| |ULTIMATE.start_cstpcpy_~from#1.base|) |ULTIMATE.start_cstpcpy_~from#1.offset|) |ULTIMATE.start_cstpcpy_#t~mem4#1|) (<= 2 |ULTIMATE.start_main_~nondetArea~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 2 |ULTIMATE.start_cstpcpy_#in~from#1.base|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= (+ |ULTIMATE.start_cstpcpy_~from#1.offset| 1) (select |#length| |ULTIMATE.start_cstpcpy_~from#1.base|)) (<= 0 |ULTIMATE.start_cstpcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_cstpcpy_#in~from#1.offset| 0) (<= 2 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 2 |ULTIMATE.start_cstpcpy_~from#1.base|) (= (select |#valid| |ULTIMATE.start_cstpcpy_~from#1.base|) 1) (= |ULTIMATE.start_cstpcpy_#in~to#1.offset| 0) (<= (select |#length| |ULTIMATE.start_cstpcpy_~to#1.base|) |ULTIMATE.start_cstpcpy_~to#1.offset|) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (<= 2 |ULTIMATE.start_cstpcpy_#in~to#1.base|) (<= 2 |ULTIMATE.start_cstpcpy_~to#1.base|))' at error location [2023-12-02 13:17:40,091 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:17:40,091 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:17:40,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2023-12-02 13:17:40,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474660544] [2023-12-02 13:17:40,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:17:40,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-02 13:17:40,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:17:40,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-02 13:17:40,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2023-12-02 13:17:40,093 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:40,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:17:40,639 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2023-12-02 13:17:40,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-02 13:17:40,640 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 13:17:40,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:17:40,640 INFO L225 Difference]: With dead ends: 18 [2023-12-02 13:17:40,640 INFO L226 Difference]: Without dead ends: 18 [2023-12-02 13:17:40,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=158, Invalid=834, Unknown=0, NotChecked=0, Total=992 [2023-12-02 13:17:40,642 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 80 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:17:40,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 12 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:17:40,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-02 13:17:40,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 14. [2023-12-02 13:17:40,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 12 states have (on average 1.25) internal successors, (15), 13 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:40,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2023-12-02 13:17:40,645 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 8 [2023-12-02 13:17:40,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:17:40,645 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2023-12-02 13:17:40,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2023-12-02 13:17:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-02 13:17:40,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:17:40,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:17:40,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 13:17:40,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:17:40,847 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 4 more)] === [2023-12-02 13:17:40,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:17:40,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1688577826, now seen corresponding path program 1 times [2023-12-02 13:17:40,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:17:40,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39987002] [2023-12-02 13:17:40,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:17:40,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:17:40,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:40,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:40,932 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:17:40,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39987002] [2023-12-02 13:17:40,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39987002] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:17:40,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:17:40,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-02 13:17:40,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829692965] [2023-12-02 13:17:40,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:17:40,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:17:40,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:17:40,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:17:40,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:17:40,934 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:40,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:17:40,947 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2023-12-02 13:17:40,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:17:40,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-02 13:17:40,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:17:40,948 INFO L225 Difference]: With dead ends: 13 [2023-12-02 13:17:40,948 INFO L226 Difference]: Without dead ends: 11 [2023-12-02 13:17:40,948 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 [2023-12-02 13:17:40,949 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:17:40,949 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:17:40,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2023-12-02 13:17:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2023-12-02 13:17:40,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:40,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2023-12-02 13:17:40,951 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2023-12-02 13:17:40,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:17:40,951 INFO L495 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2023-12-02 13:17:40,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:40,951 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2023-12-02 13:17:40,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 13:17:40,951 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:17:40,952 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1] [2023-12-02 13:17:40,952 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-02 13:17:40,952 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)] === [2023-12-02 13:17:40,952 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:17:40,952 INFO L85 PathProgramCache]: Analyzing trace with hash -761224029, now seen corresponding path program 2 times [2023-12-02 13:17:40,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:17:40,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054417962] [2023-12-02 13:17:40,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:17:40,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:17:40,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:41,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:41,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:17:41,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054417962] [2023-12-02 13:17:41,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054417962] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:17:41,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223327145] [2023-12-02 13:17:41,354 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:17:41,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:17:41,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:17:41,356 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:17:41,359 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 13:17:41,423 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 13:17:41,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:17:41,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-02 13:17:41,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:17:41,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:17:41,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 3 [2023-12-02 13:17:41,467 INFO L378 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 5 treesize of output 3 [2023-12-02 13:17:41,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-12-02 13:17:41,578 INFO L349 Elim1Store]: treesize reduction 50, result has 25.4 percent of original size [2023-12-02 13:17:41,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 30 [2023-12-02 13:17:41,695 INFO L349 Elim1Store]: treesize reduction 24, result has 35.1 percent of original size [2023-12-02 13:17:41,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 36 treesize of output 26 [2023-12-02 13:17:41,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:41,761 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:17:42,033 INFO L378 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 187 treesize of output 173 [2023-12-02 13:17:42,042 INFO L378 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 54 treesize of output 46 [2023-12-02 13:17:42,048 INFO L378 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 21 treesize of output 17 [2023-12-02 13:17:42,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:42,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [223327145] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:17:42,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1450919714] [2023-12-02 13:17:42,131 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 13:17:42,132 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:17:42,132 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:17:42,132 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:17:42,132 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:17:42,941 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:17:43,724 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '569#(and (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstpcpy_~from#1.offset|) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_main_#t~malloc7#1.base|) (<= 2 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 2 |ULTIMATE.start_main_~nondetArea~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 2 |ULTIMATE.start_cstpcpy_#in~from#1.base|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_cstpcpy_~from#1.base|) |ULTIMATE.start_cstpcpy_~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_cstpcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_cstpcpy_#in~from#1.offset| 0) (<= 2 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 2 |ULTIMATE.start_cstpcpy_~from#1.base|) (= |ULTIMATE.start_cstpcpy_#in~to#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (<= 2 |ULTIMATE.start_cstpcpy_#in~to#1.base|) (<= 2 |ULTIMATE.start_cstpcpy_~to#1.base|))' at error location [2023-12-02 13:17:43,724 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:17:43,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:17:43,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2023-12-02 13:17:43,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181328713] [2023-12-02 13:17:43,725 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:17:43,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-02 13:17:43,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:17:43,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-02 13:17:43,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=659, Unknown=0, NotChecked=0, Total=756 [2023-12-02 13:17:43,726 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:44,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:17:44,424 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2023-12-02 13:17:44,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 13:17:44,424 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 13:17:44,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:17:44,425 INFO L225 Difference]: With dead ends: 19 [2023-12-02 13:17:44,425 INFO L226 Difference]: Without dead ends: 19 [2023-12-02 13:17:44,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=246, Invalid=1236, Unknown=0, NotChecked=0, Total=1482 [2023-12-02 13:17:44,427 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:17:44,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 1 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:17:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-02 13:17:44,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2023-12-02 13:17:44,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:44,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2023-12-02 13:17:44,429 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 10 [2023-12-02 13:17:44,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:17:44,430 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2023-12-02 13:17:44,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:44,430 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2023-12-02 13:17:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-12-02 13:17:44,431 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:17:44,431 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1] [2023-12-02 13:17:44,435 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 13:17:44,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:17:44,631 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)] === [2023-12-02 13:17:44,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:17:44,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1398775427, now seen corresponding path program 3 times [2023-12-02 13:17:44,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:17:44,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194711461] [2023-12-02 13:17:44,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:17:44,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:17:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:45,155 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:17:45,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194711461] [2023-12-02 13:17:45,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194711461] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:17:45,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [450128943] [2023-12-02 13:17:45,155 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 13:17:45,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:17:45,155 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:17:45,156 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:17:45,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 13:17:45,247 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 13:17:45,247 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:17:45,249 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 64 conjunts are in the unsatisfiable core [2023-12-02 13:17:45,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:17:45,261 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 13:17:45,265 INFO L378 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 13 treesize of output 1 [2023-12-02 13:17:45,267 INFO L378 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 [2023-12-02 13:17:45,294 INFO L378 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 [2023-12-02 13:17:45,408 INFO L378 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 19 [2023-12-02 13:17:45,561 INFO L378 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 27 [2023-12-02 13:17:45,734 INFO L378 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 35 [2023-12-02 13:17:45,919 INFO L349 Elim1Store]: treesize reduction 12, result has 73.3 percent of original size [2023-12-02 13:17:45,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 51 [2023-12-02 13:17:46,023 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:46,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:17:46,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:17:46,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 60 [2023-12-02 13:17:46,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 80 [2023-12-02 13:17:46,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 95 [2023-12-02 13:17:46,821 INFO L378 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 [2023-12-02 13:17:46,831 INFO L378 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 [2023-12-02 13:17:46,841 INFO L378 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 [2023-12-02 13:17:46,978 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:46,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [450128943] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:17:46,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1690220667] [2023-12-02 13:17:46,980 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 13:17:46,980 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:17:46,981 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:17:46,981 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:17:46,981 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:17:47,800 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:17:48,662 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '756#(and (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstpcpy_~from#1.offset|) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_main_#t~malloc7#1.base|) (<= 2 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 2 |ULTIMATE.start_main_~nondetArea~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 2 |ULTIMATE.start_cstpcpy_#in~from#1.base|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_cstpcpy_~from#1.base|) |ULTIMATE.start_cstpcpy_~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_cstpcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_cstpcpy_#in~from#1.offset| 0) (<= 2 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 2 |ULTIMATE.start_cstpcpy_~from#1.base|) (= |ULTIMATE.start_cstpcpy_#in~to#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (<= 2 |ULTIMATE.start_cstpcpy_#in~to#1.base|) (<= 2 |ULTIMATE.start_cstpcpy_~to#1.base|))' at error location [2023-12-02 13:17:48,662 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:17:48,662 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:17:48,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 14] total 32 [2023-12-02 13:17:48,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083909022] [2023-12-02 13:17:48,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:17:48,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-12-02 13:17:48,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:17:48,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-12-02 13:17:48,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1308, Unknown=21, NotChecked=0, Total=1482 [2023-12-02 13:17:48,665 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 33 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:51,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:17:53,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:17:53,089 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2023-12-02 13:17:53,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-02 13:17:53,090 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-12-02 13:17:53,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:17:53,090 INFO L225 Difference]: With dead ends: 31 [2023-12-02 13:17:53,090 INFO L226 Difference]: Without dead ends: 31 [2023-12-02 13:17:53,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=458, Invalid=2824, Unknown=24, NotChecked=0, Total=3306 [2023-12-02 13:17:53,092 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 91 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 21 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-12-02 13:17:53,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 1 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 305 Invalid, 15 Unknown, 0 Unchecked, 2.5s Time] [2023-12-02 13:17:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-02 13:17:53,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2023-12-02 13:17:53,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:53,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2023-12-02 13:17:53,094 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 16 [2023-12-02 13:17:53,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:17:53,095 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2023-12-02 13:17:53,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 33 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:17:53,095 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2023-12-02 13:17:53,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-02 13:17:53,096 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:17:53,096 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1] [2023-12-02 13:17:53,100 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-02 13:17:53,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-02 13:17:53,296 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)] === [2023-12-02 13:17:53,297 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:17:53,297 INFO L85 PathProgramCache]: Analyzing trace with hash 2120931907, now seen corresponding path program 4 times [2023-12-02 13:17:53,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:17:53,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082528072] [2023-12-02 13:17:53,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:17:53,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:17:53,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:54,253 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:54,253 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:17:54,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082528072] [2023-12-02 13:17:54,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082528072] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:17:54,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251857662] [2023-12-02 13:17:54,253 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 13:17:54,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:17:54,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:17:54,255 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:17:54,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 13:17:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:17:54,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 103 conjunts are in the unsatisfiable core [2023-12-02 13:17:54,356 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:17:54,361 INFO L378 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 [2023-12-02 13:17:54,387 INFO L378 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 [2023-12-02 13:17:54,505 INFO L378 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 19 [2023-12-02 13:17:54,665 INFO L378 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 27 [2023-12-02 13:17:54,866 INFO L378 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 35 [2023-12-02 13:17:55,113 INFO L378 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 43 [2023-12-02 13:17:55,379 INFO L378 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 51 [2023-12-02 13:17:55,741 INFO L378 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 76 treesize of output 59 [2023-12-02 13:17:56,117 INFO L378 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 86 treesize of output 67 [2023-12-02 13:17:56,468 INFO L349 Elim1Store]: treesize reduction 28, result has 68.5 percent of original size [2023-12-02 13:17:56,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 28 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 8 case distinctions, treesize of input 88 treesize of output 95 [2023-12-02 13:17:56,475 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 13:17:56,520 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 13:17:56,645 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:17:56,645 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:18:00,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:18:00,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 175 treesize of output 108 [2023-12-02 13:18:00,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 172 [2023-12-02 13:18:00,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 28 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 225 treesize of output 195 [2023-12-02 13:18:00,354 INFO L378 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 [2023-12-02 13:18:00,371 INFO L378 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 15 treesize of output 11 [2023-12-02 13:18:00,388 INFO L378 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 [2023-12-02 13:18:00,403 INFO L378 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 [2023-12-02 13:18:00,419 INFO L378 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 [2023-12-02 13:18:00,433 INFO L378 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 [2023-12-02 13:18:00,446 INFO L378 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 [2023-12-02 13:18:00,458 INFO L378 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 [2023-12-02 13:18:00,558 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 13:18:00,675 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:18:00,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251857662] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:18:00,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [758449468] [2023-12-02 13:18:00,677 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 13:18:00,677 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:18:00,677 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:18:00,677 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:18:00,677 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:18:01,433 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:18:02,768 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1079#(and (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstpcpy_~from#1.offset|) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_main_#t~malloc7#1.base|) (<= 2 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 2 |ULTIMATE.start_main_~nondetArea~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 2 |ULTIMATE.start_cstpcpy_#in~from#1.base|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_cstpcpy_~from#1.base|) |ULTIMATE.start_cstpcpy_~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_cstpcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_cstpcpy_#in~from#1.offset| 0) (<= 2 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 2 |ULTIMATE.start_cstpcpy_~from#1.base|) (= |ULTIMATE.start_cstpcpy_#in~to#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (<= 2 |ULTIMATE.start_cstpcpy_#in~to#1.base|) (<= 2 |ULTIMATE.start_cstpcpy_~to#1.base|))' at error location [2023-12-02 13:18:02,768 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:18:02,768 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:18:02,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 20, 26] total 56 [2023-12-02 13:18:02,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558164754] [2023-12-02 13:18:02,769 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:18:02,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2023-12-02 13:18:02,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:18:02,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2023-12-02 13:18:02,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=3379, Unknown=145, NotChecked=0, Total=3906 [2023-12-02 13:18:02,772 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 57 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:18:07,275 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~from#1.base|) |c_ULTIMATE.start_cstpcpy_~from#1.offset|) 0)) (.cse6 (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) (.cse2 (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) (.cse8 (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) (.cse3 (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (.cse1 (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) (.cse4 (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) (.cse5 (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) (.cse7 (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|))) (and (or .cse0 (forall ((v_ArrVal_195 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_195) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse1) 0)) (and (<= .cse2 .cse3) (<= 0 .cse4)) (forall ((v_ArrVal_193 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_193) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse5) 0)) (forall ((v_ArrVal_196 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_196) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse6) 0)) (forall ((v_ArrVal_194 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_194) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse7) 0))) (or .cse0 (and (<= 0 .cse1) (<= .cse6 .cse3)) (forall ((v_ArrVal_196 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_196) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse7) 0)) (forall ((v_ArrVal_195 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_195) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse5) 0))) (or .cse0 (forall ((v_ArrVal_194 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_194) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse5) 0)) (and (<= 0 .cse6) (<= .cse4 .cse3)) (forall ((v_ArrVal_196 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_196) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse1))) (forall ((v_ArrVal_195 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_195) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse7) 0))) (or .cse0 (forall ((v_ArrVal_196 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_196) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse5) 0)) (and (<= 0 .cse7) (<= .cse1 .cse3))) (= |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8) (<= 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|) (or .cse0 (forall ((v_ArrVal_195 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_195) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse4) 0)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_192) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse7) 0)) (forall ((v_ArrVal_193 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_193) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse1) 0)) (forall ((v_ArrVal_191 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_191) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse5) 0)) (and (<= 0 .cse8) (<= (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8) .cse3)) (forall ((v_ArrVal_194 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_194) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse6) 0)) (forall ((v_ArrVal_196 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_196) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse2) 0))) (or .cse0 (and (<= 0 .cse5) (<= .cse7 .cse3))) (or .cse0 (not (= .cse3 .cse5))) (<= 9 .cse3) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= |c_ULTIMATE.start_main_~length2~0#1| (+ (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (* 18446744073709551616 (div |c_ULTIMATE.start_main_~length2~0#1| 18446744073709551616)))) (or .cse0 (forall ((v_ArrVal_195 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_195) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse6) 0)) (and (<= 0 .cse2) (<= .cse8 .cse3)) (forall ((v_ArrVal_194 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_194) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse1) 0)) (forall ((v_ArrVal_196 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_196) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse4) 0)) (forall ((v_ArrVal_192 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_192) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse5) 0)) (forall ((v_ArrVal_193 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_193) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse7) 0))))) is different from false [2023-12-02 13:18:11,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:18:11,098 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2023-12-02 13:18:11,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-02 13:18:11,099 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-12-02 13:18:11,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:18:11,099 INFO L225 Difference]: With dead ends: 55 [2023-12-02 13:18:11,100 INFO L226 Difference]: Without dead ends: 55 [2023-12-02 13:18:11,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1866 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=1080, Invalid=8438, Unknown=188, NotChecked=194, Total=9900 [2023-12-02 13:18:11,103 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 76 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 49 mSolverCounterUnsat, 87 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 1151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 87 IncrementalHoareTripleChecker+Unknown, 48 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:18:11,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 4 Invalid, 1151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 967 Invalid, 87 Unknown, 48 Unchecked, 2.0s Time] [2023-12-02 13:18:11,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-02 13:18:11,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2023-12-02 13:18:11,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:18:11,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2023-12-02 13:18:11,107 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 28 [2023-12-02 13:18:11,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:18:11,108 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2023-12-02 13:18:11,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 57 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:18:11,108 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2023-12-02 13:18:11,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-02 13:18:11,110 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:18:11,110 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1] [2023-12-02 13:18:11,114 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 13:18:11,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-02 13:18:11,310 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)] === [2023-12-02 13:18:11,311 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:18:11,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1170108867, now seen corresponding path program 5 times [2023-12-02 13:18:11,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:18:11,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840560737] [2023-12-02 13:18:11,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:18:11,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:18:11,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:18:13,232 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:18:13,233 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:18:13,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840560737] [2023-12-02 13:18:13,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840560737] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:18:13,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [364899886] [2023-12-02 13:18:13,233 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:18:13,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:18:13,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:18:13,234 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:18:13,235 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612a178a-8583-4fae-baf9-ad529a1a1918/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 13:18:13,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2023-12-02 13:18:13,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:18:13,899 WARN L260 TraceCheckSpWp]: Trace formula consists of 436 conjuncts, 225 conjunts are in the unsatisfiable core [2023-12-02 13:18:13,906 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:18:13,914 INFO L378 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 [2023-12-02 13:18:13,956 INFO L378 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 [2023-12-02 13:18:14,079 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2023-12-02 13:18:14,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2023-12-02 13:18:14,453 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 30 [2023-12-02 13:18:14,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 36 [2023-12-02 13:18:14,919 INFO L378 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 57 treesize of output 42 [2023-12-02 13:18:15,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 48 [2023-12-02 13:18:15,540 INFO L378 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 73 treesize of output 54 [2023-12-02 13:18:15,829 INFO L378 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 60 [2023-12-02 13:18:16,183 INFO L378 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 89 treesize of output 66 [2023-12-02 13:18:16,616 INFO L378 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 97 treesize of output 72 [2023-12-02 13:18:17,063 INFO L378 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 105 treesize of output 78 [2023-12-02 13:18:17,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 84 [2023-12-02 13:18:18,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 90 [2023-12-02 13:18:18,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 96 [2023-12-02 13:18:19,261 INFO L378 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 137 treesize of output 102 [2023-12-02 13:18:20,211 INFO L349 Elim1Store]: treesize reduction 60, result has 83.6 percent of original size [2023-12-02 13:18:20,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 91 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 45 case distinctions, treesize of input 137 treesize of output 371 [2023-12-02 13:18:21,034 WARN L667 sPolynomialRelations]: Constructing 65536(two to the power of 16 dual juncts. [2023-12-02 13:18:26,651 WARN L667 sPolynomialRelations]: Constructing 32768(two to the power of 15 dual juncts. [2023-12-02 13:18:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:18:29,346 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:18:35,282 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_cstpcpy_#t~mem4#1| 0) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (< (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0))) is different from false [2023-12-02 13:18:35,867 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_cstpcpy_#t~mem4#1| 0) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0))) is different from false [2023-12-02 13:18:35,900 WARN L854 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~from#1.base|) |c_ULTIMATE.start_cstpcpy_~from#1.offset|) 0) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0))) is different from false [2023-12-02 13:18:37,530 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) (= |c_ULTIMATE.start_cstpcpy_#t~mem4#1| 0) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (< (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0))) is different from false [2023-12-02 13:18:37,568 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~from#1.base|) |c_ULTIMATE.start_cstpcpy_~from#1.offset|) 0) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (< (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0))) is different from false [2023-12-02 13:18:38,136 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (= |c_ULTIMATE.start_cstpcpy_#t~mem4#1| 0) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_284) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0))) is different from false [2023-12-02 13:18:38,179 WARN L854 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~from#1.base|) |c_ULTIMATE.start_cstpcpy_~from#1.offset|) 0) (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_284) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0))) is different from false [2023-12-02 13:18:39,011 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (= |c_ULTIMATE.start_cstpcpy_#t~mem4#1| 0) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_284) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_283 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1))))) is different from false [2023-12-02 13:18:42,955 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_284) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~from#1.base|) |c_ULTIMATE.start_cstpcpy_~from#1.offset|) 0) (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_282) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0))) is different from false [2023-12-02 13:18:44,980 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 9) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (= |c_ULTIMATE.start_cstpcpy_#t~mem4#1| 0) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8)) 0)) (forall ((v_ArrVal_281 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_281) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_282) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_284) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0))) is different from false [2023-12-02 13:18:54,449 WARN L854 $PredicateComparison]: unable to prove that (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~from#1.base|) |c_ULTIMATE.start_cstpcpy_~from#1.offset|) 0) (forall ((v_ArrVal_281 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_281) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8)) 0)) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 9)) 0)) (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_284) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_282) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_280 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (< (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 10) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0)))) is different from false [2023-12-02 13:19:01,424 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8)) 0)) (= |c_ULTIMATE.start_cstpcpy_#t~mem4#1| 0) (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_284) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_282) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_281 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_281) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (< (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 11) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_280 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_279 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_279) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 10)) 0)) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 9)) 0))) is different from false [2023-12-02 13:19:21,277 WARN L854 $PredicateComparison]: unable to prove that (or (= |c_ULTIMATE.start_cstpcpy_#t~mem4#1| 0) (forall ((v_ArrVal_279 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_279) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8)) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 9)) 0)) (forall ((v_ArrVal_281 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_281) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (< (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 12) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_278 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_278) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 11)) 0)) (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_282) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_280 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_284) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 10)) 0))) is different from false [2023-12-02 13:19:54,562 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((v_ArrVal_279 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_279) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) (= |c_ULTIMATE.start_cstpcpy_#t~mem4#1| 0) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 10)) 0)) (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_282) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) 0)) (forall ((v_ArrVal_281 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_281) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 12)) 0)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (< (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 13) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_277 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_277) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) (forall ((v_ArrVal_280 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_284) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8)) 0)) (forall ((v_ArrVal_278 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_278) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 11)) 0)) (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 9)) 0))) is different from false [2023-12-02 13:21:31,879 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:21:31,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 355 treesize of output 200 [2023-12-02 13:21:31,896 INFO L378 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 380 treesize of output 348 [2023-12-02 13:21:31,917 INFO L378 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 [2023-12-02 13:21:31,921 INFO L378 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 [2023-12-02 13:21:31,924 INFO L378 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 [2023-12-02 13:21:31,928 INFO L378 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 [2023-12-02 13:21:31,931 INFO L378 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 [2023-12-02 13:21:31,935 INFO L378 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 [2023-12-02 13:21:31,941 INFO L378 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 [2023-12-02 13:21:31,943 INFO L378 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 [2023-12-02 13:21:31,946 INFO L378 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 [2023-12-02 13:21:31,950 INFO L378 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 [2023-12-02 13:21:31,953 INFO L378 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 [2023-12-02 13:21:31,956 INFO L378 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 [2023-12-02 13:21:32,408 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:21:32,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 16 select indices, 16 select index equivalence classes, 91 disjoint index pairs (out of 120 index pairs), introduced 16 new quantified variables, introduced 29 case distinctions, treesize of input 341 treesize of output 567 [2023-12-02 13:21:32,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-02 13:21:32,548 INFO L378 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 15 treesize of output 11 [2023-12-02 13:21:32,617 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-12-02 13:21:34,286 WARN L667 sPolynomialRelations]: Constructing 1024(two to the power of 10 dual juncts. [2023-12-02 13:21:34,344 WARN L667 sPolynomialRelations]: Constructing 4096(two to the power of 12 dual juncts. [2023-12-02 13:21:34,526 WARN L667 sPolynomialRelations]: Constructing 8192(two to the power of 13 dual juncts. [2023-12-02 13:21:34,909 WARN L667 sPolynomialRelations]: Constructing 16384(two to the power of 14 dual juncts. [2023-12-02 13:21:35,766 WARN L667 sPolynomialRelations]: Constructing 2048(two to the power of 11 dual juncts. [2023-12-02 13:21:35,851 WARN L667 sPolynomialRelations]: Constructing 512(two to the power of 9 dual juncts. [2023-12-02 13:21:35,874 WARN L667 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2023-12-02 13:21:35,888 WARN L667 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2023-12-02 13:21:35,896 WARN L667 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2023-12-02 13:21:35,915 INFO L378 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 [2023-12-02 13:21:36,115 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 180 refuted. 27 times theorem prover too weak. 0 trivial. 169 not checked. [2023-12-02 13:21:36,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [364899886] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:21:36,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [463748949] [2023-12-02 13:21:36,116 INFO L159 IcfgInterpreter]: Started Sifa with 7 locations of interest [2023-12-02 13:21:36,117 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:21:36,117 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:21:36,117 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:21:36,117 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:21:36,789 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:21:39,437 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1677#(and (= |ULTIMATE.start_main_#t~malloc8#1.offset| 0) (<= 0 |ULTIMATE.start_cstpcpy_~from#1.offset|) (<= 1 |#StackHeapBarrier|) (<= 2 |ULTIMATE.start_main_#t~malloc7#1.base|) (<= 2 |ULTIMATE.start_main_~nondetString~0#1.base|) (<= 2 |ULTIMATE.start_main_~nondetArea~0#1.base|) (= |ULTIMATE.start_main_~nondetArea~0#1.offset| 0) (<= 2 |ULTIMATE.start_cstpcpy_#in~from#1.base|) (= |ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= (select |#length| |ULTIMATE.start_cstpcpy_~from#1.base|) |ULTIMATE.start_cstpcpy_~from#1.offset|) (<= 1 |ULTIMATE.start_main_~length1~0#1|) (<= 0 |ULTIMATE.start_cstpcpy_~to#1.offset|) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= |ULTIMATE.start_cstpcpy_#in~from#1.offset| 0) (<= 2 |ULTIMATE.start_main_#t~malloc8#1.base|) (<= 2 |ULTIMATE.start_cstpcpy_~from#1.base|) (= |ULTIMATE.start_cstpcpy_#in~to#1.offset| 0) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0) (<= 2 |ULTIMATE.start_cstpcpy_#in~to#1.base|) (<= 2 |ULTIMATE.start_cstpcpy_~to#1.base|))' at error location [2023-12-02 13:21:39,437 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:21:39,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:21:39,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 35, 50] total 103 [2023-12-02 13:21:39,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429722298] [2023-12-02 13:21:39,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:21:39,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 104 states [2023-12-02 13:21:39,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:21:39,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2023-12-02 13:21:39,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=943, Invalid=7864, Unknown=369, NotChecked=2814, Total=11990 [2023-12-02 13:21:39,443 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 104 states, 103 states have (on average 1.4951456310679612) internal successors, (154), 104 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:21:42,338 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse12 (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8)) (.cse14 (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 9)) (.cse2 (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) (.cse3 (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) (.cse11 (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 12)) (.cse13 (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 11)) (.cse4 (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) (.cse7 (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) (.cse6 (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) (.cse10 (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 10)) (.cse5 (= |c_ULTIMATE.start_cstpcpy_#t~mem4#1| 0)) (.cse8 (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) (.cse9 (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) (.cse0 (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~from#1.base|))) (and (or (< 18446744073709551616 .cse0) (= (select .cse1 (+ (- 1) .cse0)) 0)) (= |c_ULTIMATE.start_cstpcpy_~to#1.offset| 0) (= 0 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) (or (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse2) 0)) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse3) 0)) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse4) 0)) .cse5 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< .cse6 |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) .cse0) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse7) 0)) (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_284) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse8) 0)) (forall ((v_ArrVal_283 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse9)))) (= |c_ULTIMATE.start_cstpcpy_#t~mem4#1| (select .cse1 0)) (or (forall ((v_ArrVal_279 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_279) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse7) 0)) .cse5 (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse10) 0)) (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_282) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse3) 0)) (forall ((v_ArrVal_281 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_281) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse4) 0)) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse11) 0)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) .cse0) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (< (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 13) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_277 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_277) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse9) 0)) (forall ((v_ArrVal_280 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse2) 0)) (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_284) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse12) 0)) (forall ((v_ArrVal_278 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_278) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse8) 0)) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse13) 0)) (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse6) 0)) (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse14) 0))) (or (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse6) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse12) 0)) .cse5 (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_284) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse3) 0)) (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_282) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse2) 0)) (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse4) 0)) (forall ((v_ArrVal_281 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_281) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse7) 0)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) .cse0) (< .cse13 |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_280 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse8) 0)) (forall ((v_ArrVal_279 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_279) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse9) 0)) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse10) 0)) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse14) 0))) (or (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< .cse14 |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) .cse0) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) .cse5 (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse12) 0)) (forall ((v_ArrVal_281 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_281) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse9) 0)) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse6) 0)) (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_282) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse8) 0)) (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_284) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse2) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse3) 0)) (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse7) 0)) (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse4) 0))) (or .cse5 (forall ((v_ArrVal_279 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_279) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse8) 0)) (forall ((v_ArrVal_285 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_285) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse12) 0)) (forall ((v_ArrVal_286 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_286) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse14) 0)) (forall ((v_ArrVal_281 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_281) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse2) 0)) (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse3) 0)) (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) .cse0) (< .cse11 |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_278 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_278) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse9) 0)) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse13) 0)) (forall ((v_ArrVal_282 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_282) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse4) 0)) (forall ((v_ArrVal_280 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse7) 0)) (forall ((v_ArrVal_284 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_284) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse6) 0)) (forall ((v_ArrVal_287 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_287) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse10) 0))) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (not (= |c_ULTIMATE.start_cstpcpy_~to#1.base| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (or .cse5 (forall ((v_ArrVal_290 (Array Int Int)) (v_ArrVal_289 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_85| Int) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_84| Int)) (or (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 1) .cse0) (< .cse8 |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) (< (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_85| 1) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|) (< |v_ULTIMATE.start_cstpcpy_~from#1.offset_84| 0) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_290) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_84|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_289) |c_ULTIMATE.start_cstpcpy_~from#1.base|) |v_ULTIMATE.start_cstpcpy_~from#1.offset_85|) 0))) (forall ((v_ArrVal_288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_288) |c_ULTIMATE.start_cstpcpy_~from#1.base|) .cse9) 0))) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (= |c_ULTIMATE.start_cstpcpy_~from#1.offset| 0) (= |c_ULTIMATE.start_main_~length2~0#1| (+ (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (* 18446744073709551616 (div |c_ULTIMATE.start_main_~length2~0#1| 18446744073709551616)))) (exists ((|ULTIMATE.start_main_~length2~0#1| Int)) (and (<= |ULTIMATE.start_main_~length2~0#1| .cse0) (<= 1 |ULTIMATE.start_main_~length2~0#1|) (= (select .cse1 (+ (- 1) |ULTIMATE.start_main_~length2~0#1|)) 0))))) is different from true [2023-12-02 13:23:03,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:23:05,929 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 [0, 1] [2023-12-02 13:23:08,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:23:10,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:23:12,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:23:15,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:23:17,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:23:19,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:23:21,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:23:23,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:23:26,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 [0, 1] [2023-12-02 13:23:28,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:23:30,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:23:32,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:02,065 WARN L293 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 557 DAG size of output: 504 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-02 13:24:04,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:06,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.56s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:08,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:10,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:12,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:15,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:17,525 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 [0, 1] [2023-12-02 13:24:19,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:21,542 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:23,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:25,965 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:28,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:30,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:33,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:35,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:37,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:39,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:41,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 [0, 1] [2023-12-02 13:24:44,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-12-02 13:24:54,935 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] [2023-12-02 13:24:59,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:25:01,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:25:12,523 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] [2023-12-02 13:25:14,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:25:16,701 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] [2023-12-02 13:25:18,750 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] [2023-12-02 13:25:21,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:25:23,073 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] [2023-12-02 13:25:25,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:25:27,552 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] [2023-12-02 13:25:29,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:25:31,516 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] [2023-12-02 13:25:33,528 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] [2023-12-02 13:25:35,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:25:38,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:25:41,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:26:17,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:26:19,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:26:21,687 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] [2023-12-02 13:26:24,463 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] [2023-12-02 13:26:26,583 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:26:28,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:26:30,700 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:26:33,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:26:35,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:26:38,667 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] [2023-12-02 13:26:42,026 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] [2023-12-02 13:26:44,993 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] [2023-12-02 13:26:48,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:26:50,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:26:52,537 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] [2023-12-02 13:26:55,704 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:26:57,872 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:27:09,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:27:11,379 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] [2023-12-02 13:27:14,161 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] [2023-12-02 13:27:16,467 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:27:31,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:27:33,228 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] [2023-12-02 13:27:35,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:27:37,438 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:27:39,479 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] [2023-12-02 13:27:41,508 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] [2023-12-02 13:27:43,568 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:27:45,652 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] [2023-12-02 13:27:47,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:27:49,996 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] [2023-12-02 13:27:52,020 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] [2023-12-02 13:27:54,092 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:27:56,102 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] [2023-12-02 13:27:58,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:28:00,429 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] [2023-12-02 13:28:02,442 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] [2023-12-02 13:28:04,490 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] [2023-12-02 13:28:52,730 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] [2023-12-02 13:28:54,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:28:57,041 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] [2023-12-02 13:28:59,353 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] [2023-12-02 13:29:01,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:29:03,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:29:05,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:29:07,962 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] [2023-12-02 13:29:10,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:29:12,399 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] [2023-12-02 13:29:14,790 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] [2023-12-02 13:29:17,291 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] [2023-12-02 13:29:19,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:29:21,691 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] [2023-12-02 13:29:24,084 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] [2023-12-02 13:29:26,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:29:28,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:29:30,727 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] [2023-12-02 13:29:33,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:29:35,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:29:51,796 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] [2023-12-02 13:29:54,121 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] [2023-12-02 13:29:56,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:29:58,748 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] [2023-12-02 13:30:02,557 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] [2023-12-02 13:30:04,705 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:30:32,148 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] [2023-12-02 13:30:34,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:30:36,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:30:38,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:30:40,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:30:43,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.49s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:30:45,211 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] [2023-12-02 13:30:47,226 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] [2023-12-02 13:30:48,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:30:50,524 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:30:52,530 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] [2023-12-02 13:30:53,834 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:30:55,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:30:57,938 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] [2023-12-02 13:31:00,066 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:31:02,434 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] [2023-12-02 13:31:04,451 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] [2023-12-02 13:31:51,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:31:53,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:31:55,825 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] [2023-12-02 13:31:58,144 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] [2023-12-02 13:32:00,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:32:02,133 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:32:04,345 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] [2023-12-02 13:32:06,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:32:08,815 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] [2023-12-02 13:32:11,114 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] [2023-12-02 13:32:13,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:32:15,910 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] [2023-12-02 13:32:17,938 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:32:20,298 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] [2023-12-02 13:32:22,394 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] [2023-12-02 13:32:24,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-12-02 13:32:26,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]