./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/array-tiling/revcpyswp2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/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_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-tiling/revcpyswp2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e5d836305a9654c4a87b407d535438bc329bb78fc0805b3b823600303a7df507 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-12-02 13:30:36,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-02 13:30:37,031 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/config/svcomp-Reach-32bit-Taipan_Default.epf [2023-12-02 13:30:37,036 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-02 13:30:37,036 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-02 13:30:37,058 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-02 13:30:37,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-02 13:30:37,059 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-02 13:30:37,059 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-02 13:30:37,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-02 13:30:37,060 INFO L153 SettingsManager]: * User list type=DISABLED [2023-12-02 13:30:37,061 INFO L151 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-12-02 13:30:37,061 INFO L153 SettingsManager]: * Explicit value domain=true [2023-12-02 13:30:37,062 INFO L153 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-12-02 13:30:37,062 INFO L153 SettingsManager]: * Octagon Domain=false [2023-12-02 13:30:37,063 INFO L153 SettingsManager]: * Abstract domain=CompoundDomain [2023-12-02 13:30:37,063 INFO L153 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-12-02 13:30:37,064 INFO L153 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-12-02 13:30:37,064 INFO L153 SettingsManager]: * Interval Domain=false [2023-12-02 13:30:37,065 INFO L151 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-12-02 13:30:37,066 INFO L153 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-12-02 13:30:37,069 INFO L153 SettingsManager]: * Simplification Technique=POLY_PAC [2023-12-02 13:30:37,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-02 13:30:37,070 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-02 13:30:37,070 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-02 13:30:37,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-02 13:30:37,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-02 13:30:37,071 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-02 13:30:37,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-02 13:30:37,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-02 13:30:37,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-02 13:30:37,073 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-02 13:30:37,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-02 13:30:37,073 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-02 13:30:37,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-02 13:30:37,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-02 13:30:37,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-02 13:30:37,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:30:37,075 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-02 13:30:37,075 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-02 13:30:37,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-02 13:30:37,075 INFO L153 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-12-02 13:30:37,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-02 13:30:37,076 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-02 13:30:37,076 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-02 13:30:37,076 INFO L153 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-12-02 13:30:37,076 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-02 13:30:37,077 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_00c9ff27-284a-4461-9d7b-b5a486c9139c/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_00c9ff27-284a-4461-9d7b-b5a486c9139c/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 ! call(reach_error())) ) 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e5d836305a9654c4a87b407d535438bc329bb78fc0805b3b823600303a7df507 [2023-12-02 13:30:37,275 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-02 13:30:37,295 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-02 13:30:37,297 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-02 13:30:37,299 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-02 13:30:37,299 INFO L274 PluginConnector]: CDTParser initialized [2023-12-02 13:30:37,300 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/../../sv-benchmarks/c/array-tiling/revcpyswp2.c [2023-12-02 13:30:40,033 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-02 13:30:40,186 INFO L384 CDTParser]: Found 1 translation units. [2023-12-02 13:30:40,187 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/sv-benchmarks/c/array-tiling/revcpyswp2.c [2023-12-02 13:30:40,193 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/data/d27bf4dc6/37b591efb0e3442b8d61c4169d1e42e8/FLAG84258fe02 [2023-12-02 13:30:40,204 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/data/d27bf4dc6/37b591efb0e3442b8d61c4169d1e42e8 [2023-12-02 13:30:40,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-02 13:30:40,208 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-12-02 13:30:40,209 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-02 13:30:40,209 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-02 13:30:40,214 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-02 13:30:40,215 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:30:40" (1/1) ... [2023-12-02 13:30:40,215 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a778060 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:30:40, skipping insertion in model container [2023-12-02 13:30:40,216 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 01:30:40" (1/1) ... [2023-12-02 13:30:40,235 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-02 13:30:40,378 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/sv-benchmarks/c/array-tiling/revcpyswp2.c[432,445] [2023-12-02 13:30:40,400 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:30:40,409 INFO L202 MainTranslator]: Completed pre-run [2023-12-02 13:30:40,422 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/sv-benchmarks/c/array-tiling/revcpyswp2.c[432,445] [2023-12-02 13:30:40,431 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-02 13:30:40,442 INFO L206 MainTranslator]: Completed translation [2023-12-02 13:30:40,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:30:40 WrapperNode [2023-12-02 13:30:40,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-02 13:30:40,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-02 13:30:40,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-02 13:30:40,444 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-02 13:30:40,449 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:30:40" (1/1) ... [2023-12-02 13:30:40,456 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:30:40" (1/1) ... [2023-12-02 13:30:40,478 INFO L138 Inliner]: procedures = 16, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 111 [2023-12-02 13:30:40,479 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-02 13:30:40,479 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-02 13:30:40,479 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-02 13:30:40,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-02 13:30:40,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:30:40" (1/1) ... [2023-12-02 13:30:40,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:30:40" (1/1) ... [2023-12-02 13:30:40,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:30:40" (1/1) ... [2023-12-02 13:30:40,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:30:40" (1/1) ... [2023-12-02 13:30:40,494 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:30:40" (1/1) ... [2023-12-02 13:30:40,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:30:40" (1/1) ... [2023-12-02 13:30:40,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:30:40" (1/1) ... [2023-12-02 13:30:40,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:30:40" (1/1) ... [2023-12-02 13:30:40,501 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-02 13:30:40,502 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-02 13:30:40,502 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-02 13:30:40,502 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-02 13:30:40,503 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:30:40" (1/1) ... [2023-12-02 13:30:40,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-12-02 13:30:40,517 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:30:40,526 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/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:30:40,528 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/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:30:40,556 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-02 13:30:40,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-12-02 13:30:40,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-12-02 13:30:40,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-02 13:30:40,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-02 13:30:40,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-02 13:30:40,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-12-02 13:30:40,626 INFO L241 CfgBuilder]: Building ICFG [2023-12-02 13:30:40,628 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-02 13:30:40,794 INFO L282 CfgBuilder]: Performing block encoding [2023-12-02 13:30:40,858 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-02 13:30:40,858 INFO L309 CfgBuilder]: Removed 5 assume(true) statements. [2023-12-02 13:30:40,859 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:30:40 BoogieIcfgContainer [2023-12-02 13:30:40,859 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-02 13:30:40,862 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-02 13:30:40,862 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-02 13:30:40,864 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-02 13:30:40,865 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 01:30:40" (1/3) ... [2023-12-02 13:30:40,865 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669b4cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:30:40, skipping insertion in model container [2023-12-02 13:30:40,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 01:30:40" (2/3) ... [2023-12-02 13:30:40,866 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@669b4cda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 01:30:40, skipping insertion in model container [2023-12-02 13:30:40,866 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 01:30:40" (3/3) ... [2023-12-02 13:30:40,867 INFO L112 eAbstractionObserver]: Analyzing ICFG revcpyswp2.c [2023-12-02 13:30:40,881 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-02 13:30:40,881 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-02 13:30:40,919 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-02 13:30:40,925 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=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@5680c573, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-02 13:30:40,925 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-02 13:30:40,928 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:40,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-02 13:30:40,933 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:40,933 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:30:40,934 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:30:40,938 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:40,938 INFO L85 PathProgramCache]: Analyzing trace with hash -808186464, now seen corresponding path program 1 times [2023-12-02 13:30:40,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:40,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825620641] [2023-12-02 13:30:40,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:40,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:41,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:41,177 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:30:41,177 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:41,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825620641] [2023-12-02 13:30:41,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825620641] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:41,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:41,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-02 13:30:41,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403564015] [2023-12-02 13:30:41,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:41,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-02 13:30:41,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:41,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-02 13:30:41,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:30:41,212 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:41,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:41,258 INFO L93 Difference]: Finished difference Result 24 states and 35 transitions. [2023-12-02 13:30:41,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-02 13:30:41,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-02 13:30:41,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:41,265 INFO L225 Difference]: With dead ends: 24 [2023-12-02 13:30:41,265 INFO L226 Difference]: Without dead ends: 12 [2023-12-02 13:30:41,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-02 13:30:41,270 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:41,271 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:30:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-02 13:30:41,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-12-02 13:30:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 11 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:30:41,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2023-12-02 13:30:41,297 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2023-12-02 13:30:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:41,297 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2023-12-02 13:30:41,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:41,298 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2023-12-02 13:30:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-02 13:30:41,298 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:41,298 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:30:41,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-02 13:30:41,299 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:30:41,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:41,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1284334477, now seen corresponding path program 1 times [2023-12-02 13:30:41,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:41,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141095498] [2023-12-02 13:30:41,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:41,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:41,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:41,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 13:30:41,409 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:41,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141095498] [2023-12-02 13:30:41,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141095498] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-02 13:30:41,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-02 13:30:41,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-02 13:30:41,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774737689] [2023-12-02 13:30:41,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-02 13:30:41,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-02 13:30:41,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:41,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-02 13:30:41,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-02 13:30:41,412 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:41,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:41,452 INFO L93 Difference]: Finished difference Result 27 states and 36 transitions. [2023-12-02 13:30:41,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-02 13:30:41,453 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-12-02 13:30:41,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:41,454 INFO L225 Difference]: With dead ends: 27 [2023-12-02 13:30:41,454 INFO L226 Difference]: Without dead ends: 20 [2023-12-02 13:30:41,454 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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:30:41,456 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:41,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 7 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-02 13:30:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-02 13:30:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 15. [2023-12-02 13:30:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2023-12-02 13:30:41,463 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 10 [2023-12-02 13:30:41,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:41,463 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2023-12-02 13:30:41,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:30:41,464 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2023-12-02 13:30:41,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-12-02 13:30:41,464 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:41,464 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:30:41,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-02 13:30:41,465 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:30:41,466 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:41,466 INFO L85 PathProgramCache]: Analyzing trace with hash 656114818, now seen corresponding path program 1 times [2023-12-02 13:30:41,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:41,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429446699] [2023-12-02 13:30:41,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:41,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 13:30:41,597 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429446699] [2023-12-02 13:30:41,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429446699] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:30:41,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600765153] [2023-12-02 13:30:41,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:41,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:30:41,598 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:30:41,608 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:30:41,610 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-02 13:30:41,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:41,701 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:30:41,706 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:30:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 13:30:41,773 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:30:41,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-12-02 13:30:41,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600765153] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:30:41,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [992419417] [2023-12-02 13:30:41,822 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 13:30:41,822 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:30:41,826 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:30:41,831 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:30:41,832 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:30:47,222 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:30:47,546 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '218#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= |ULTIMATE.start_main_#t~mem23#1| |ULTIMATE.start_main_#t~mem22#1|)) (<= 1 ~SIZE~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) |ULTIMATE.start_main_#t~mem22#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a_copy~0#1.base|) (+ (* ~SIZE~0 4) |ULTIMATE.start_main_~a_copy~0#1.offset| (- 4))) |ULTIMATE.start_main_#t~mem23#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-12-02 13:30:47,547 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:30:47,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:30:47,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-12-02 13:30:47,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248087325] [2023-12-02 13:30:47,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:30:47,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-02 13:30:47,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:47,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-02 13:30:47,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-12-02 13:30:47,549 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:30:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:47,637 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2023-12-02 13:30:47,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-02 13:30:47,637 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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 13 [2023-12-02 13:30:47,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:47,638 INFO L225 Difference]: With dead ends: 27 [2023-12-02 13:30:47,638 INFO L226 Difference]: Without dead ends: 16 [2023-12-02 13:30:47,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-12-02 13:30:47,640 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:47,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 11 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:30:47,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-02 13:30:47,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-02 13:30:47,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 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:30:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2023-12-02 13:30:47,645 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 13 [2023-12-02 13:30:47,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:47,645 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2023-12-02 13:30:47,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 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:30:47,646 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2023-12-02 13:30:47,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-02 13:30:47,646 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:47,647 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:30:47,653 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-02 13:30:47,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:30:47,847 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:30:47,848 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:47,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1512971247, now seen corresponding path program 2 times [2023-12-02 13:30:47,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:47,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676852839] [2023-12-02 13:30:47,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:47,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:47,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:47,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 13:30:47,970 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:47,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676852839] [2023-12-02 13:30:47,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [676852839] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:30:47,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599092675] [2023-12-02 13:30:47,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:30:47,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:30:47,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:30:47,975 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:30:47,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-02 13:30:48,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-02 13:30:48,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:30:48,064 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-02 13:30:48,066 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:30:48,127 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 13:30:48,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:30:48,167 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-02 13:30:48,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599092675] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:30:48,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [500515972] [2023-12-02 13:30:48,171 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 13:30:48,171 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:30:48,171 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:30:48,171 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:30:48,171 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:30:48,658 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:30:48,978 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '380#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= |ULTIMATE.start_main_#t~mem23#1| |ULTIMATE.start_main_#t~mem22#1|)) (<= 1 ~SIZE~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) |ULTIMATE.start_main_#t~mem22#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a_copy~0#1.base|) (+ (* ~SIZE~0 4) |ULTIMATE.start_main_~a_copy~0#1.offset| (- 4))) |ULTIMATE.start_main_#t~mem23#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-12-02 13:30:48,979 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:30:48,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:30:48,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2023-12-02 13:30:48,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47203400] [2023-12-02 13:30:48,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:30:48,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-02 13:30:48,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:30:48,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-02 13:30:48,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2023-12-02 13:30:48,981 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:30:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:30:49,098 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2023-12-02 13:30:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-02 13:30:49,098 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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 14 [2023-12-02 13:30:49,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:30:49,099 INFO L225 Difference]: With dead ends: 38 [2023-12-02 13:30:49,099 INFO L226 Difference]: Without dead ends: 29 [2023-12-02 13:30:49,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2023-12-02 13:30:49,101 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-02 13:30:49,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 16 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-02 13:30:49,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-02 13:30:49,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 19. [2023-12-02 13:30:49,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 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:30:49,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2023-12-02 13:30:49,107 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 14 [2023-12-02 13:30:49,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:30:49,107 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2023-12-02 13:30:49,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 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:30:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2023-12-02 13:30:49,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-02 13:30:49,108 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:30:49,108 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:30:49,122 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-02 13:30:49,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:30:49,309 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:30:49,310 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:30:49,310 INFO L85 PathProgramCache]: Analyzing trace with hash -388489824, now seen corresponding path program 3 times [2023-12-02 13:30:49,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:30:49,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611867562] [2023-12-02 13:30:49,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:30:49,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:30:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:30:51,905 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:30:51,905 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:30:51,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611867562] [2023-12-02 13:30:51,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611867562] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:30:51,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825479535] [2023-12-02 13:30:51,906 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 13:30:51,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:30:51,906 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:30:51,907 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:30:51,910 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-02 13:30:52,035 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 13:30:52,036 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:30:52,039 INFO L262 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 13:30:52,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:30:52,103 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-02 13:30:52,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 34 [2023-12-02 13:30:52,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-02 13:30:52,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 13:30:52,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2023-12-02 13:30:52,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-12-02 13:30:52,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2023-12-02 13:30:52,606 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-12-02 13:30:52,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 58 [2023-12-02 13:30:52,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2023-12-02 13:30:53,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:30:53,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2023-12-02 13:30:53,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 48 [2023-12-02 13:30:53,103 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 19 treesize of output 11 [2023-12-02 13:30:53,111 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:30:53,117 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 12 treesize of output 1 [2023-12-02 13:30:53,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2023-12-02 13:30:53,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2023-12-02 13:30:53,313 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 19 treesize of output 15 [2023-12-02 13:30:53,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-02 13:30:53,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 35 [2023-12-02 13:30:53,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2023-12-02 13:30:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:30:53,674 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:30:53,799 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_227 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |c_ULTIMATE.start_main_~i~0#1| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_227))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0)))))) is different from false [2023-12-02 13:30:53,832 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_227 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_224 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_138| (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_227))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2023-12-02 13:30:53,852 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_227 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_224 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_138| 1) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_227))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))))) is different from false [2023-12-02 13:30:53,909 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_227 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_221 Int) (v_ArrVal_219 Int) (v_ArrVal_224 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_138| 1) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_221)))) (let ((.cse2 (store (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_219))) (store (select (store .cse1 |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_227))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|))))) is different from false [2023-12-02 13:30:53,967 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_225 Int) (v_ArrVal_227 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_221 Int) (v_ArrVal_219 Int) (v_ArrVal_215 Int) (v_ArrVal_224 (Array Int Int))) (or (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse3 (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse5 .cse6 v_ArrVal_215)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse5 .cse6))))) (let ((.cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse4 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_221))) (let ((.cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse4 4 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_219))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_227))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))))) (< |v_ULTIMATE.start_main_~i~0#1_138| 1))) is different from false [2023-12-02 13:30:54,393 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_216 (Array Int Int)) (v_ArrVal_225 Int) (v_ArrVal_227 (Array Int Int)) (|v_ULTIMATE.start_main_~i~0#1_138| Int) (v_ArrVal_221 Int) (v_ArrVal_219 Int) (v_ArrVal_211 (Array Int Int)) (v_ArrVal_213 (Array Int Int)) (v_ArrVal_215 Int) (v_ArrVal_224 (Array Int Int))) (or (< |v_ULTIMATE.start_main_~i~0#1_138| 1) (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| 4)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_211))) (store (select .cse6 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 4) (select (select .cse6 |c_ULTIMATE.start_main_~a_copy~0#1.base|) |c_ULTIMATE.start_main_~a_copy~0#1.offset|)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~a~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_213) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse5 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_215)) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select .cse5 |c_ULTIMATE.start_main_~a~0#1.offset|))))) (let ((.cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_216) |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_221))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_219)) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_138| 4) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_227))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| .cse1 4))))))) is different from false [2023-12-02 13:30:55,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:30:55,159 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 3911 treesize of output 1932 [2023-12-02 13:30:57,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:30:57,185 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 9046038 treesize of output 8728398 [2023-12-02 13:30:57,734 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 13276 treesize of output 12892 [2023-12-02 13:30:57,833 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 758 treesize of output 698 [2023-12-02 13:30:57,858 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 515 treesize of output 507 [2023-12-02 13:30:57,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:30:57,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 730 treesize of output 672 [2023-12-02 13:30:58,511 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 227 treesize of output 207 [2023-12-02 13:30:59,153 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 2 times theorem prover too weak. 1 trivial. 8 not checked. [2023-12-02 13:30:59,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825479535] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:30:59,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [124230154] [2023-12-02 13:30:59,156 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 13:30:59,156 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:30:59,157 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:30:59,157 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:30:59,157 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:30:59,585 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:31:00,198 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '617#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= |ULTIMATE.start_main_#t~mem23#1| |ULTIMATE.start_main_#t~mem22#1|)) (<= 1 ~SIZE~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) |ULTIMATE.start_main_#t~mem22#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a_copy~0#1.base|) (+ (* ~SIZE~0 4) |ULTIMATE.start_main_~a_copy~0#1.offset| (- 4))) |ULTIMATE.start_main_#t~mem23#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-12-02 13:31:00,198 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:31:00,198 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:31:00,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 42 [2023-12-02 13:31:00,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397587366] [2023-12-02 13:31:00,198 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:31:00,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2023-12-02 13:31:00,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:31:00,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2023-12-02 13:31:00,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=1530, Unknown=10, NotChecked=522, Total=2352 [2023-12-02 13:31:00,202 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 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:31:05,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:31:05,292 INFO L93 Difference]: Finished difference Result 97 states and 113 transitions. [2023-12-02 13:31:05,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-12-02 13:31:05,292 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 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 17 [2023-12-02 13:31:05,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:31:05,295 INFO L225 Difference]: With dead ends: 97 [2023-12-02 13:31:05,295 INFO L226 Difference]: Without dead ends: 95 [2023-12-02 13:31:05,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1996 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=1120, Invalid=5864, Unknown=12, NotChecked=1014, Total=8010 [2023-12-02 13:31:05,301 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 199 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 132 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 637 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-02 13:31:05,301 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 122 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 472 Invalid, 7 Unknown, 637 Unchecked, 0.9s Time] [2023-12-02 13:31:05,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-12-02 13:31:05,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 34. [2023-12-02 13:31:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.3636363636363635) internal successors, (45), 33 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:31:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2023-12-02 13:31:05,317 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 45 transitions. Word has length 17 [2023-12-02 13:31:05,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:31:05,318 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 45 transitions. [2023-12-02 13:31:05,318 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.0952380952380953) internal successors, (46), 42 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:31:05,318 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 45 transitions. [2023-12-02 13:31:05,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-02 13:31:05,319 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:31:05,319 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:31:05,324 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-02 13:31:05,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:31:05,520 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:31:05,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:31:05,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1370880032, now seen corresponding path program 4 times [2023-12-02 13:31:05,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:31:05,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022700406] [2023-12-02 13:31:05,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:31:05,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:31:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:31:05,699 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-02 13:31:05,699 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:31:05,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022700406] [2023-12-02 13:31:05,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022700406] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:31:05,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214623790] [2023-12-02 13:31:05,699 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-12-02 13:31:05,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:31:05,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:31:05,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:31:05,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-02 13:31:05,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:31:05,802 INFO L262 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 13:31:05,804 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:31:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 13:31:05,911 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:31:05,982 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-12-02 13:31:05,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [214623790] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:31:05,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1766572362] [2023-12-02 13:31:05,985 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 13:31:05,985 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:31:05,985 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:31:05,985 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:31:05,985 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:31:06,315 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:31:06,542 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1041#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= |ULTIMATE.start_main_#t~mem23#1| |ULTIMATE.start_main_#t~mem22#1|)) (<= 1 ~SIZE~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) |ULTIMATE.start_main_#t~mem22#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a_copy~0#1.base|) (+ (* ~SIZE~0 4) |ULTIMATE.start_main_~a_copy~0#1.offset| (- 4))) |ULTIMATE.start_main_#t~mem23#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-12-02 13:31:06,542 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:31:06,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:31:06,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 15 [2023-12-02 13:31:06,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101386181] [2023-12-02 13:31:06,542 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:31:06,543 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-02 13:31:06,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:31:06,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-02 13:31:06,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=295, Unknown=0, NotChecked=0, Total=380 [2023-12-02 13:31:06,544 INFO L87 Difference]: Start difference. First operand 34 states and 45 transitions. Second operand has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:31:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:31:06,758 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2023-12-02 13:31:06,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-02 13:31:06,759 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-12-02 13:31:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:31:06,759 INFO L225 Difference]: With dead ends: 86 [2023-12-02 13:31:06,760 INFO L226 Difference]: Without dead ends: 61 [2023-12-02 13:31:06,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 42 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2023-12-02 13:31:06,761 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 40 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-02 13:31:06,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 40 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-02 13:31:06,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2023-12-02 13:31:06,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2023-12-02 13:31:06,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 0 states have call successors, (0), 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:31:06,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 48 transitions. [2023-12-02 13:31:06,775 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 48 transitions. Word has length 19 [2023-12-02 13:31:06,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:31:06,775 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 48 transitions. [2023-12-02 13:31:06,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.8) internal successors, (27), 15 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:31:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 48 transitions. [2023-12-02 13:31:06,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 13:31:06,776 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:31:06,776 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:31:06,782 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-02 13:31:06,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:31:06,977 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:31:06,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:31:06,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1071581599, now seen corresponding path program 5 times [2023-12-02 13:31:06,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:31:06,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981103220] [2023-12-02 13:31:06,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:31:06,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:31:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:31:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 13:31:07,181 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:31:07,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981103220] [2023-12-02 13:31:07,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981103220] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:31:07,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235791140] [2023-12-02 13:31:07,182 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-02 13:31:07,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:31:07,182 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:31:07,183 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:31:07,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-02 13:31:07,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-02 13:31:07,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:31:07,398 INFO L262 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-02 13:31:07,400 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:31:07,503 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 13:31:07,503 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:31:07,611 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-02 13:31:07,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235791140] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:31:07,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [686151854] [2023-12-02 13:31:07,613 INFO L159 IcfgInterpreter]: Started Sifa with 10 locations of interest [2023-12-02 13:31:07,613 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:31:07,613 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:31:07,613 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:31:07,613 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:31:07,883 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:31:08,194 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1386#(and (= |ULTIMATE.start_main_~i~0#1| 0) (not (= |ULTIMATE.start_main_#t~mem23#1| |ULTIMATE.start_main_#t~mem22#1|)) (<= 1 ~SIZE~0) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) |ULTIMATE.start_main_#t~mem22#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a_copy~0#1.base|) (+ (* ~SIZE~0 4) |ULTIMATE.start_main_~a_copy~0#1.offset| (- 4))) |ULTIMATE.start_main_#t~mem23#1|) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-12-02 13:31:08,194 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:31:08,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:31:08,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2023-12-02 13:31:08,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214568393] [2023-12-02 13:31:08,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:31:08,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-02 13:31:08,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:31:08,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-02 13:31:08,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2023-12-02 13:31:08,196 INFO L87 Difference]: Start difference. First operand 39 states and 48 transitions. Second operand has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:31:08,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:31:08,632 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2023-12-02 13:31:08,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-02 13:31:08,633 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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 20 [2023-12-02 13:31:08,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:31:08,633 INFO L225 Difference]: With dead ends: 69 [2023-12-02 13:31:08,633 INFO L226 Difference]: Without dead ends: 54 [2023-12-02 13:31:08,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 34 SyntacticMatches, 17 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2023-12-02 13:31:08,635 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 44 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-02 13:31:08,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 73 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-02 13:31:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-02 13:31:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2023-12-02 13:31:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:31:08,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2023-12-02 13:31:08,648 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 20 [2023-12-02 13:31:08,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:31:08,648 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2023-12-02 13:31:08,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 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:31:08,649 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2023-12-02 13:31:08,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-12-02 13:31:08,649 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:31:08,649 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:31:08,654 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-02 13:31:08,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:31:08,850 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:31:08,850 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:31:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1441917140, now seen corresponding path program 1 times [2023-12-02 13:31:08,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:31:08,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288910098] [2023-12-02 13:31:08,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:31:08,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:31:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:31:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:31:10,329 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:31:10,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288910098] [2023-12-02 13:31:10,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288910098] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:31:10,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1013200983] [2023-12-02 13:31:10,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:31:10,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:31:10,330 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:31:10,330 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:31:10,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-02 13:31:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:31:10,419 INFO L262 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 68 conjunts are in the unsatisfiable core [2023-12-02 13:31:10,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:31:10,445 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-12-02 13:31:10,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2023-12-02 13:31:10,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2023-12-02 13:31:10,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-12-02 13:31:10,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 37 [2023-12-02 13:31:10,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-12-02 13:31:10,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 55 [2023-12-02 13:31:10,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 22 [2023-12-02 13:31:10,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 22 [2023-12-02 13:31:10,925 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 16 treesize of output 15 [2023-12-02 13:31:11,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 22 [2023-12-02 13:31:11,147 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2023-12-02 13:31:11,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2023-12-02 13:31:11,157 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 23 treesize of output 19 [2023-12-02 13:31:11,429 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-02 13:31:11,430 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:31:11,601 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_523 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_523))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2023-12-02 13:31:11,614 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_523 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_54| Int) (v_ArrVal_519 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_519)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store .cse1 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_54|)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4) (select .cse2 (+ .cse3 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_523))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))))) is different from false [2023-12-02 13:31:11,629 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_523 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_54| Int) (v_ArrVal_519 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_519)))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_54|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|)))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_523))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8))))))) is different from false [2023-12-02 13:31:11,651 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_523 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_54| Int) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_519 Int) (v_ArrVal_516 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse5 .cse6 v_ArrVal_516)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse5 .cse6)))))) (let ((.cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_519))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_54|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_523))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8))))))) is different from false [2023-12-02 13:31:11,680 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_513 (Array Int Int)) (v_ArrVal_523 (Array Int Int)) (|v_ULTIMATE.start_main_~tmp~0#1_54| Int) (v_ArrVal_518 (Array Int Int)) (v_ArrVal_519 Int) (v_ArrVal_516 Int) (v_ArrVal_512 Int)) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse5 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_512)) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse6 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_513) |c_ULTIMATE.start_main_~a~0#1.base| (store .cse5 .cse6 v_ArrVal_516)) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse7 4 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse5 .cse6)))))) (let ((.cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_518) |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_519))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_54|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse1 (select .cse3 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_523))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) .cse1) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (* 4 c_~SIZE~0) (- 8))))))) is different from false [2023-12-02 13:31:12,062 INFO L349 Elim1Store]: treesize reduction 88, result has 40.9 percent of original size [2023-12-02 13:31:12,063 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 6092 treesize of output 4055 [2023-12-02 13:31:12,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:31:12,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2781 treesize of output 2624 [2023-12-02 13:31:12,147 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:31:12,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 493 treesize of output 419 [2023-12-02 13:31:12,278 INFO L349 Elim1Store]: treesize reduction 37, result has 60.6 percent of original size [2023-12-02 13:31:12,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 533 treesize of output 530 [2023-12-02 13:31:12,330 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 449 treesize of output 435 [2023-12-02 13:31:12,713 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2023-12-02 13:31:12,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1013200983] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-02 13:31:12,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [597219915] [2023-12-02 13:31:12,714 INFO L159 IcfgInterpreter]: Started Sifa with 11 locations of interest [2023-12-02 13:31:12,714 INFO L166 IcfgInterpreter]: Building call graph [2023-12-02 13:31:12,714 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2023-12-02 13:31:12,714 INFO L176 IcfgInterpreter]: Starting interpretation [2023-12-02 13:31:12,715 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2023-12-02 13:31:13,017 INFO L180 IcfgInterpreter]: Interpretation finished [2023-12-02 13:31:13,599 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1736#(and (not (= |ULTIMATE.start_main_#t~mem23#1| |ULTIMATE.start_main_#t~mem22#1|)) (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a_copy~0#1.base|) (+ (* ~SIZE~0 4) |ULTIMATE.start_main_~a_copy~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| (- 4)) (- 4))) |ULTIMATE.start_main_#t~mem23#1|) (<= 0 |ULTIMATE.start_main_~i~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~mem22#1|) (<= (+ |ULTIMATE.start_main_~i~0#1| 1) ~SIZE~0) (= |ULTIMATE.start___VERIFIER_assert_#in~cond#1| 0))' at error location [2023-12-02 13:31:13,599 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2023-12-02 13:31:13,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-12-02 13:31:13,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 44 [2023-12-02 13:31:13,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11237011] [2023-12-02 13:31:13,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-12-02 13:31:13,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-12-02 13:31:13,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-12-02 13:31:13,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-12-02 13:31:13,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1705, Unknown=11, NotChecked=450, Total=2450 [2023-12-02 13:31:13,602 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 44 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 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:31:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-02 13:31:15,043 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2023-12-02 13:31:15,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-02 13:31:15,043 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 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 20 [2023-12-02 13:31:15,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-02 13:31:15,044 INFO L225 Difference]: With dead ends: 54 [2023-12-02 13:31:15,044 INFO L226 Difference]: Without dead ends: 38 [2023-12-02 13:31:15,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 63 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 1352 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=488, Invalid=3061, Unknown=11, NotChecked=600, Total=4160 [2023-12-02 13:31:15,046 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 69 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-02 13:31:15,046 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 70 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 294 Invalid, 0 Unknown, 272 Unchecked, 0.4s Time] [2023-12-02 13:31:15,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2023-12-02 13:31:15,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 23. [2023-12-02 13:31:15,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-02 13:31:15,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2023-12-02 13:31:15,055 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 20 [2023-12-02 13:31:15,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-02 13:31:15,056 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2023-12-02 13:31:15,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 44 states have internal predecessors, (54), 0 states have call successors, (0), 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:31:15,056 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2023-12-02 13:31:15,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-02 13:31:15,057 INFO L187 NwaCegarLoop]: Found error trace [2023-12-02 13:31:15,057 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-02 13:31:15,061 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-02 13:31:15,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:31:15,257 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-02 13:31:15,258 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-02 13:31:15,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1144286590, now seen corresponding path program 6 times [2023-12-02 13:31:15,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-12-02 13:31:15,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345122380] [2023-12-02 13:31:15,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-02 13:31:15,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-02 13:31:15,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-02 13:31:17,476 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:31:17,476 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-12-02 13:31:17,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345122380] [2023-12-02 13:31:17,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345122380] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-02 13:31:17,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888683898] [2023-12-02 13:31:17,476 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-02 13:31:17,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-02 13:31:17,477 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 [2023-12-02 13:31:17,477 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-02 13:31:17,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_00c9ff27-284a-4461-9d7b-b5a486c9139c/bin/utaipan-verify-nQ1chXbOIh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-02 13:31:17,630 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-02 13:31:17,630 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-02 13:31:17,633 INFO L262 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 92 conjunts are in the unsatisfiable core [2023-12-02 13:31:17,638 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-02 13:31:17,656 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2023-12-02 13:31:17,656 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 187 treesize of output 177 [2023-12-02 13:31:17,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2023-12-02 13:31:17,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-12-02 13:31:18,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 27 [2023-12-02 13:31:18,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2023-12-02 13:31:18,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:31:18,202 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 48 [2023-12-02 13:31:18,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2023-12-02 13:31:18,366 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 69 [2023-12-02 13:31:18,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2023-12-02 13:31:18,680 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 52 [2023-12-02 13:31:18,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 45 [2023-12-02 13:31:18,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 35 [2023-12-02 13:31:19,140 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 35 [2023-12-02 13:31:19,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 35 [2023-12-02 13:31:19,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 50 [2023-12-02 13:31:19,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2023-12-02 13:31:19,443 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:31:19,697 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-02 13:31:19,698 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-02 13:31:19,811 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~b~0#1.offset|))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_666))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-12-02 13:31:19,824 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_663 Int) (|v_ULTIMATE.start_main_~tmp~0#1_61| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_663)))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store .cse1 |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_61|)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4) (select .cse2 (+ .cse3 4 |c_ULTIMATE.start_main_~b~0#1.offset|))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_666))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0)))))) is different from false [2023-12-02 13:31:19,859 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_663 Int) (|v_ULTIMATE.start_main_~tmp~0#1_61| Int) (|v_ULTIMATE.start_main_~tmp~0#1_62| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse3 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse6 (+ .cse3 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) .cse6))))) (let ((.cse4 (store (select .cse5 |c_ULTIMATE.start_main_~b~0#1.base|) .cse6 |v_ULTIMATE.start_main_~tmp~0#1_62|))) (let ((.cse1 (store (select (store .cse5 |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_663))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse4) |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ .cse3 4 |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_61|)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse3 8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse2 (+ .cse3 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_666))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0))) (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)))) is different from false [2023-12-02 13:31:19,889 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_663 Int) (|v_ULTIMATE.start_main_~tmp~0#1_61| Int) (|v_ULTIMATE.start_main_~tmp~0#1_62| Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|))))) (let ((.cse3 (store (select .cse4 |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_62|))) (let ((.cse1 (store (select (store .cse4 |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_663))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_61|)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse2 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_666))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0)))))) is different from false [2023-12-02 13:31:19,926 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (Array Int Int)) (v_ArrVal_663 Int) (|v_ULTIMATE.start_main_~tmp~0#1_61| Int) (|v_ULTIMATE.start_main_~tmp~0#1_62| Int) (v_ArrVal_656 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse7 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse8 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse9 (+ .cse7 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store .cse8 .cse9 v_ArrVal_656)))) (let ((.cse5 (store (select .cse6 |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse7 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse8 .cse9)))) (let ((.cse4 (store (select (store .cse6 |c_ULTIMATE.start_main_~b~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (let ((.cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_62|))) (let ((.cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_663))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_61|)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse2 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))))))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_666))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0)))))) is different from false [2023-12-02 13:31:19,995 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_653 Int) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_652 Int) (v_ArrVal_663 Int) (|v_ULTIMATE.start_main_~tmp~0#1_61| Int) (|v_ULTIMATE.start_main_~tmp~0#1_62| Int) (v_ArrVal_656 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse8 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_653)))) (let ((.cse7 (store (select .cse11 |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse8 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_652))) (let ((.cse9 (select (store .cse11 |c_ULTIMATE.start_main_~b~0#1.base| .cse7) |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse10 (+ .cse8 |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse6 (store .cse9 .cse10 v_ArrVal_656))) (let ((.cse5 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse7) |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~b~0#1.base|) (+ .cse8 4 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse9 .cse10)))) (let ((.cse4 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse6) |c_ULTIMATE.start_main_~b~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse5 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (let ((.cse3 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse5) |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_62|))) (let ((.cse1 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse4) |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4) v_ArrVal_663))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse3) |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse1) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse2 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|) |v_ULTIMATE.start_main_~tmp~0#1_61|)) |c_ULTIMATE.start_main_~a~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select .cse2 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|)))))))))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_666))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| (- 4) (* 4 c_~SIZE~0)))))) is different from false [2023-12-02 13:31:22,926 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_653 Int) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_652 Int) (v_ArrVal_663 Int) (v_ArrVal_646 (Array Int Int)) (v_ArrVal_651 Int) (|v_ULTIMATE.start_main_~tmp~0#1_61| Int) (|v_ULTIMATE.start_main_~tmp~0#1_62| Int) (v_ArrVal_656 Int) (v_ArrVal_642 (Array Int Int))) (let ((.cse1 (* |c_ULTIMATE.start_main_~i~0#1| 4))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| 8)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_642))) (store (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| 4) (select (select .cse20 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| 4))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_644))) (store (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 8 |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse19 |c_ULTIMATE.start_main_~a_copy~0#1.base|) |c_ULTIMATE.start_main_~a_copy~0#1.offset|)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_646) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_651))) (let ((.cse16 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_646) |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse15 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~b~0#1.base| .cse16) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9 v_ArrVal_653)) (.cse4 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse14 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse16) |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4 v_ArrVal_652))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~b~0#1.base| .cse14) |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse11 (store .cse13 .cse5 v_ArrVal_656))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse14) |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse10 (store .cse12 .cse6 (select .cse13 .cse5)))) (let ((.cse8 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~b~0#1.base| .cse10) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse12 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (let ((.cse7 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse10) |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_62|))) (let ((.cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~b~0#1.base| .cse7) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9 v_ArrVal_663))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse7) |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_main_~tmp~0#1_61|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5 (select .cse3 .cse6)))))))))))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_666))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| .cse1 8)))))) is different from false [2023-12-02 13:31:23,055 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_644 (Array Int Int)) (v_ArrVal_653 Int) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_652 Int) (v_ArrVal_663 Int) (v_ArrVal_646 (Array Int Int)) (v_ArrVal_651 Int) (|v_ULTIMATE.start_main_~tmp~0#1_61| Int) (|v_ULTIMATE.start_main_~tmp~0#1_62| Int) (v_ArrVal_656 Int) (v_ArrVal_642 (Array Int Int))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| 8))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse5 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse9 (+ |c_ULTIMATE.start_main_~a~0#1.offset| 4))) (let ((.cse18 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse19 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (let ((.cse20 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse1))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_642))) (store (select .cse20 |c_ULTIMATE.start_main_~a~0#1.base|) .cse9 (select (select .cse20 |c_ULTIMATE.start_main_~a_copy~0#1.base|) (+ |c_ULTIMATE.start_main_~a_copy~0#1.offset| 4))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_644))) (store (select .cse19 |c_ULTIMATE.start_main_~a~0#1.base|) .cse5 (select (select .cse19 |c_ULTIMATE.start_main_~a_copy~0#1.base|) |c_ULTIMATE.start_main_~a_copy~0#1.offset|)))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_646) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse17 (store .cse18 |c_ULTIMATE.start_main_~a~0#1.offset| v_ArrVal_651))) (let ((.cse16 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_646) |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| (select .cse18 |c_ULTIMATE.start_main_~a~0#1.offset|)))) (let ((.cse15 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse17) |c_ULTIMATE.start_main_~b~0#1.base| .cse16) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9 v_ArrVal_653)) (.cse4 (+ 4 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse14 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse16) |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~b~0#1.base|) .cse4 v_ArrVal_652))) (let ((.cse13 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse15) |c_ULTIMATE.start_main_~b~0#1.base| .cse14) |c_ULTIMATE.start_main_~a~0#1.base|))) (let ((.cse11 (store .cse13 .cse5 v_ArrVal_656))) (let ((.cse12 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse14) |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~b~0#1.base|)) (.cse6 (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|))) (let ((.cse10 (store .cse12 .cse6 (select .cse13 .cse5)))) (let ((.cse8 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse11) |c_ULTIMATE.start_main_~b~0#1.base| .cse10) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse12 |c_ULTIMATE.start_main_~b~0#1.offset|)))) (let ((.cse7 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse10) |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset| |v_ULTIMATE.start_main_~tmp~0#1_62|))) (let ((.cse2 (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse8) |c_ULTIMATE.start_main_~b~0#1.base| .cse7) |c_ULTIMATE.start_main_~a~0#1.base|) .cse9 v_ArrVal_663))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse7) |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base|))) (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| .cse2) |c_ULTIMATE.start_main_~b~0#1.base| (store .cse3 .cse4 |v_ULTIMATE.start_main_~tmp~0#1_61|)) |c_ULTIMATE.start_main_~a~0#1.base|) .cse5 (select .cse3 .cse6))))))))))))))))) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_666))) (= (select (select .cse0 |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) (select (select .cse0 |c_ULTIMATE.start_main_~a_copy~0#1.base|) .cse1))))) is different from false [2023-12-02 13:31:23,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-12-02 13:31:23,174 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 333673 treesize of output 164870