./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-memory-alloca/ex3a-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-memory-alloca/ex3a-alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a5b1197714500d659d0acf4ebb2204b824a1c828702d044651e5c066ddbe97af --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-14 15:42:51,764 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 15:42:51,765 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 15:42:51,786 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 15:42:51,786 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 15:42:51,787 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 15:42:51,788 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 15:42:51,790 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 15:42:51,791 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 15:42:51,792 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 15:42:51,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 15:42:51,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 15:42:51,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 15:42:51,795 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 15:42:51,796 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 15:42:51,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 15:42:51,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 15:42:51,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 15:42:51,800 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 15:42:51,802 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 15:42:51,804 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 15:42:51,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 15:42:51,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 15:42:51,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 15:42:51,810 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 15:42:51,810 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 15:42:51,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 15:42:51,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 15:42:51,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 15:42:51,812 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 15:42:51,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 15:42:51,813 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 15:42:51,814 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 15:42:51,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 15:42:51,816 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 15:42:51,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 15:42:51,816 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 15:42:51,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 15:42:51,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 15:42:51,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 15:42:51,818 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 15:42:51,819 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-12-14 15:42:51,839 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 15:42:51,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 15:42:51,840 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 15:42:51,840 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 15:42:51,841 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 15:42:51,841 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 15:42:51,841 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 15:42:51,841 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 15:42:51,841 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 15:42:51,841 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 15:42:51,842 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 15:42:51,842 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 15:42:51,842 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 15:42:51,842 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 15:42:51,842 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 15:42:51,843 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 15:42:51,843 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 15:42:51,843 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 15:42:51,844 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 15:42:51,844 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-14 15:42:51,844 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 15:42:51,844 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 15:42:51,844 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 15:42:51,844 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 15:42:51,845 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 15:42:51,845 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-14 15:42:51,845 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 15:42:51,845 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 15:42:51,845 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 15:42:51,846 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 15:42:51,846 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 15:42:51,846 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:42:51,846 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 15:42:51,846 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 15:42:51,847 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 15:42:51,847 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 15:42:51,847 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 15:42:51,847 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 15:42:51,847 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 15:42:51,847 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 15:42:51,848 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a5b1197714500d659d0acf4ebb2204b824a1c828702d044651e5c066ddbe97af [2022-12-14 15:42:52,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 15:42:52,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 15:42:52,061 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 15:42:52,062 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 15:42:52,062 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 15:42:52,063 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/termination-memory-alloca/ex3a-alloca.i [2022-12-14 15:42:54,657 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 15:42:54,827 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 15:42:54,828 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/sv-benchmarks/c/termination-memory-alloca/ex3a-alloca.i [2022-12-14 15:42:54,836 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/data/5bee51463/c3412268ad52444aa0858230d7b92dc6/FLAGace3b28b2 [2022-12-14 15:42:54,847 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/data/5bee51463/c3412268ad52444aa0858230d7b92dc6 [2022-12-14 15:42:54,849 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 15:42:54,851 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 15:42:54,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 15:42:54,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 15:42:54,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 15:42:54,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:42:54" (1/1) ... [2022-12-14 15:42:54,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c13a7d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:42:54, skipping insertion in model container [2022-12-14 15:42:54,856 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 03:42:54" (1/1) ... [2022-12-14 15:42:54,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 15:42:54,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 15:42:55,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:42:55,060 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 15:42:55,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 15:42:55,103 INFO L208 MainTranslator]: Completed translation [2022-12-14 15:42:55,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:42:55 WrapperNode [2022-12-14 15:42:55,104 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 15:42:55,105 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 15:42:55,105 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 15:42:55,105 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 15:42:55,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:42:55" (1/1) ... [2022-12-14 15:42:55,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:42:55" (1/1) ... [2022-12-14 15:42:55,137 INFO L138 Inliner]: procedures = 111, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2022-12-14 15:42:55,137 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 15:42:55,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 15:42:55,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 15:42:55,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 15:42:55,147 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:42:55" (1/1) ... [2022-12-14 15:42:55,147 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:42:55" (1/1) ... [2022-12-14 15:42:55,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:42:55" (1/1) ... [2022-12-14 15:42:55,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:42:55" (1/1) ... [2022-12-14 15:42:55,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:42:55" (1/1) ... [2022-12-14 15:42:55,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:42:55" (1/1) ... [2022-12-14 15:42:55,157 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:42:55" (1/1) ... [2022-12-14 15:42:55,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:42:55" (1/1) ... [2022-12-14 15:42:55,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 15:42:55,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 15:42:55,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 15:42:55,161 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 15:42:55,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:42:55" (1/1) ... [2022-12-14 15:42:55,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 15:42:55,179 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:42:55,190 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 15:42:55,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 15:42:55,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-14 15:42:55,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-14 15:42:55,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-14 15:42:55,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-14 15:42:55,226 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 15:42:55,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 15:42:55,330 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 15:42:55,332 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 15:42:55,419 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 15:42:55,442 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 15:42:55,442 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 15:42:55,444 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:42:55 BoogieIcfgContainer [2022-12-14 15:42:55,444 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 15:42:55,447 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 15:42:55,447 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 15:42:55,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 15:42:55,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 03:42:54" (1/3) ... [2022-12-14 15:42:55,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a27847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:42:55, skipping insertion in model container [2022-12-14 15:42:55,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 03:42:55" (2/3) ... [2022-12-14 15:42:55,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62a27847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 03:42:55, skipping insertion in model container [2022-12-14 15:42:55,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:42:55" (3/3) ... [2022-12-14 15:42:55,453 INFO L112 eAbstractionObserver]: Analyzing ICFG ex3a-alloca.i [2022-12-14 15:42:55,470 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 15:42:55,470 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2022-12-14 15:42:55,504 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 15:42:55,508 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=LoopsAndPotentialCycles, 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;@3cc839e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 15:42:55,509 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-12-14 15:42:55,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 8 states have (on average 1.75) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:42:55,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-12-14 15:42:55,515 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:42:55,516 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-12-14 15:42:55,516 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 15:42:55,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:42:55,521 INFO L85 PathProgramCache]: Analyzing trace with hash 2065766, now seen corresponding path program 1 times [2022-12-14 15:42:55,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:42:55,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745968944] [2022-12-14 15:42:55,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:42:55,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:42:55,636 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 15:42:55,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1929781625] [2022-12-14 15:42:55,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:42:55,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:42:55,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:42:55,638 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:42:55,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 15:42:55,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:42:55,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 7 conjunts are in the unsatisfiable core [2022-12-14 15:42:55,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:42:55,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-14 15:42:55,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:42:55,892 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:42:55,893 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:42:55,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745968944] [2022-12-14 15:42:55,893 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 15:42:55,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929781625] [2022-12-14 15:42:55,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929781625] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:42:55,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:42:55,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:42:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446326057] [2022-12-14 15:42:55,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:42:55,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:42:55,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:42:55,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:42:55,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:42:55,928 INFO L87 Difference]: Start difference. First operand has 13 states, 8 states have (on average 1.75) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:42:55,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:42:55,974 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-12-14 15:42:55,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:42:55,977 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-12-14 15:42:55,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:42:55,982 INFO L225 Difference]: With dead ends: 15 [2022-12-14 15:42:55,982 INFO L226 Difference]: Without dead ends: 10 [2022-12-14 15:42:55,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:42:55,986 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:42:55,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 11 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:42:55,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-12-14 15:42:56,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-12-14 15:42:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 9 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) [2022-12-14 15:42:56,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-12-14 15:42:56,007 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 4 [2022-12-14 15:42:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:42:56,007 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-12-14 15:42:56,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:42:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-12-14 15:42:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-12-14 15:42:56,008 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:42:56,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-12-14 15:42:56,013 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 15:42:56,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-12-14 15:42:56,210 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 15:42:56,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:42:56,213 INFO L85 PathProgramCache]: Analyzing trace with hash 64038798, now seen corresponding path program 1 times [2022-12-14 15:42:56,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:42:56,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499636514] [2022-12-14 15:42:56,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:42:56,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:42:56,267 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 15:42:56,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1047099070] [2022-12-14 15:42:56,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:42:56,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:42:56,270 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:42:56,273 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:42:56,277 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 15:42:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:42:56,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 8 conjunts are in the unsatisfiable core [2022-12-14 15:42:56,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:42:56,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2022-12-14 15:42:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:42:56,518 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:42:56,519 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:42:56,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499636514] [2022-12-14 15:42:56,519 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 15:42:56,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047099070] [2022-12-14 15:42:56,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047099070] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:42:56,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:42:56,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-14 15:42:56,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346717038] [2022-12-14 15:42:56,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:42:56,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:42:56,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:42:56,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:42:56,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:42:56,522 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:42:56,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:42:56,553 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-12-14 15:42:56,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:42:56,554 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-12-14 15:42:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:42:56,554 INFO L225 Difference]: With dead ends: 10 [2022-12-14 15:42:56,554 INFO L226 Difference]: Without dead ends: 9 [2022-12-14 15:42:56,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:42:56,556 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:42:56,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:42:56,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-12-14 15:42:56,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-12-14 15:42:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:42:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-12-14 15:42:56,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2022-12-14 15:42:56,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:42:56,558 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-12-14 15:42:56,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:42:56,558 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-12-14 15:42:56,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-12-14 15:42:56,559 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:42:56,559 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-12-14 15:42:56,564 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 15:42:56,759 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:42:56,761 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 15:42:56,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:42:56,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1985202792, now seen corresponding path program 1 times [2022-12-14 15:42:56,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:42:56,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437852252] [2022-12-14 15:42:56,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:42:56,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:42:56,816 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 15:42:56,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013304616] [2022-12-14 15:42:56,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:42:56,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:42:56,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:42:56,822 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:42:56,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 15:42:56,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:42:56,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2022-12-14 15:42:56,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:42:56,989 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-14 15:42:56,990 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-12-14 15:42:56,998 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 15:42:57,009 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 15:42:57,042 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:57,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:57,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2022-12-14 15:42:57,049 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-14 15:42:57,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 15:42:57,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:57,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 15:42:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:42:57,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:42:57,105 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:42:57,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437852252] [2022-12-14 15:42:57,105 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 15:42:57,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013304616] [2022-12-14 15:42:57,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013304616] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:42:57,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:42:57,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-14 15:42:57,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380713517] [2022-12-14 15:42:57,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:42:57,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 15:42:57,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:42:57,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 15:42:57,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 15:42:57,107 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:42:57,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:42:57,127 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2022-12-14 15:42:57,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 15:42:57,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-12-14 15:42:57,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:42:57,128 INFO L225 Difference]: With dead ends: 9 [2022-12-14 15:42:57,128 INFO L226 Difference]: Without dead ends: 8 [2022-12-14 15:42:57,128 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-14 15:42:57,129 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 4 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:42:57,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:42:57,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-12-14 15:42:57,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-12-14 15:42:57,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:42:57,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2022-12-14 15:42:57,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2022-12-14 15:42:57,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:42:57,131 INFO L495 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2022-12-14 15:42:57,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:42:57,131 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2022-12-14 15:42:57,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-12-14 15:42:57,131 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:42:57,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-12-14 15:42:57,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 15:42:57,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-12-14 15:42:57,332 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 15:42:57,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:42:57,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1411744464, now seen corresponding path program 1 times [2022-12-14 15:42:57,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:42:57,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63173109] [2022-12-14 15:42:57,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:42:57,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:42:57,346 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 15:42:57,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [111657056] [2022-12-14 15:42:57,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:42:57,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:42:57,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:42:57,347 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:42:57,348 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 15:42:57,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:42:57,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 18 conjunts are in the unsatisfiable core [2022-12-14 15:42:57,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:42:57,431 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-14 15:42:57,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-12-14 15:42:57,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 15:42:57,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 15:42:57,465 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:57,466 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2022-12-14 15:42:57,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-14 15:42:57,749 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-12-14 15:42:57,749 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 54 [2022-12-14 15:42:57,755 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2022-12-14 15:42:57,762 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-12-14 15:42:57,773 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2022-12-14 15:42:57,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:42:57,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 15:42:57,789 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:42:57,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63173109] [2022-12-14 15:42:57,789 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 15:42:57,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111657056] [2022-12-14 15:42:57,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111657056] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 15:42:57,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 15:42:57,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 15:42:57,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560939823] [2022-12-14 15:42:57,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 15:42:57,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-14 15:42:57,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:42:57,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-14 15:42:57,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=19, Unknown=2, NotChecked=0, Total=30 [2022-12-14 15:42:57,791 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:42:57,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:42:57,926 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-12-14 15:42:57,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 15:42:57,927 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-12-14 15:42:57,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:42:57,927 INFO L225 Difference]: With dead ends: 15 [2022-12-14 15:42:57,927 INFO L226 Difference]: Without dead ends: 14 [2022-12-14 15:42:57,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=35, Unknown=4, NotChecked=0, Total=56 [2022-12-14 15:42:57,928 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:42:57,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 9 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 15:42:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-12-14 15:42:57,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-12-14 15:42:57,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:42:57,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-12-14 15:42:57,933 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 7 [2022-12-14 15:42:57,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:42:57,933 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-12-14 15:42:57,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:42:57,933 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-12-14 15:42:57,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-12-14 15:42:57,934 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:42:57,934 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1] [2022-12-14 15:42:57,938 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-14 15:42:58,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:42:58,135 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 15:42:58,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:42:58,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1164978077, now seen corresponding path program 1 times [2022-12-14 15:42:58,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:42:58,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817474469] [2022-12-14 15:42:58,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:42:58,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:42:58,153 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 15:42:58,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1108088561] [2022-12-14 15:42:58,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:42:58,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:42:58,154 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:42:58,155 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:42:58,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 15:42:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:42:58,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 23 conjunts are in the unsatisfiable core [2022-12-14 15:42:58,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:42:58,279 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-14 15:42:58,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-12-14 15:42:58,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 15:42:58,291 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 15:42:58,315 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:58,316 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:58,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2022-12-14 15:42:58,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-14 15:42:58,475 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 15:42:58,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 15:42:58,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:42:58,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:58,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 15:42:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:42:58,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:42:58,567 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_149 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-12-14 15:42:58,585 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_148 Int) (v_ArrVal_149 (Array Int Int))) (or (not (<= v_ArrVal_148 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_148)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-12-14 15:42:58,605 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_148 Int) (v_ArrVal_149 (Array Int Int)) (v_ArrVal_146 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_146))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_148) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_148)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2022-12-14 15:42:58,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-12-14 15:42:58,688 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:42:58,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817474469] [2022-12-14 15:42:58,688 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 15:42:58,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108088561] [2022-12-14 15:42:58,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108088561] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:42:58,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [161352671] [2022-12-14 15:42:58,702 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 15:42:58,702 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:42:58,705 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:42:58,709 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:42:58,709 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:42:58,747 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-14 15:42:58,748 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 29 [2022-12-14 15:42:58,756 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-12-14 15:42:58,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:58,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-14 15:42:58,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:58,817 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 41 [2022-12-14 15:42:58,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:42:58,845 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-12-14 15:42:58,958 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:58,972 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-12-14 15:42:58,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 228 [2022-12-14 15:42:59,076 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:59,090 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-12-14 15:42:59,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 248 [2022-12-14 15:42:59,227 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:42:59,261 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:59,281 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 15:42:59,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-12-14 15:42:59,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:42:59,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:42:59,452 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 15:42:59,453 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-12-14 15:42:59,514 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:42:59,931 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '286#(and (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (exists ((|v_ULTIMATE.start_test_fun_#t~mem8#1_15| Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_15| Int)) (and (<= 0 (+ (* |v_ULTIMATE.start_test_fun_#t~mem7#1_15| |v_ULTIMATE.start_test_fun_#t~mem8#1_15|) 2147483648)) (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_15| |v_ULTIMATE.start_test_fun_#t~mem8#1_15|) 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (* |v_ULTIMATE.start_test_fun_#t~mem7#1_15| |v_ULTIMATE.start_test_fun_#t~mem8#1_15|)))) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_main_#t~nondet11#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (= |#NULL.offset| 0) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem9#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet11#1|)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (< 2147483646 |ULTIMATE.start_test_fun_#t~mem9#1|))' at error location [2022-12-14 15:42:59,931 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:42:59,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:42:59,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2022-12-14 15:42:59,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946930218] [2022-12-14 15:42:59,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:42:59,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-12-14 15:42:59,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:42:59,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-12-14 15:42:59,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=222, Unknown=3, NotChecked=96, Total=380 [2022-12-14 15:42:59,933 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:43:00,129 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((v_ArrVal_148 Int) (v_ArrVal_149 (Array Int Int)) (v_ArrVal_146 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_146))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_148) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_148)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (and .cse0 (forall ((v_ArrVal_149 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (let ((.cse1 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or .cse0 (< .cse1 2) (not (< .cse1 100)))))) is different from false [2022-12-14 15:43:00,133 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_148 Int) (v_ArrVal_149 (Array Int Int)) (v_ArrVal_146 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_146))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_148) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_148)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (forall ((v_ArrVal_149 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-12-14 15:43:00,137 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_148 Int) (v_ArrVal_149 (Array Int Int))) (or (not (<= v_ArrVal_148 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_148)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_149) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) (<= |c_ULTIMATE.start_test_fun_#t~mem9#1| 2147483646)) is different from false [2022-12-14 15:43:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:43:00,154 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-12-14 15:43:00,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:43:00,155 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-12-14 15:43:00,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:43:00,156 INFO L225 Difference]: With dead ends: 33 [2022-12-14 15:43:00,156 INFO L226 Difference]: Without dead ends: 32 [2022-12-14 15:43:00,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=400, Unknown=10, NotChecked=282, Total=812 [2022-12-14 15:43:00,157 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:43:00,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 14 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 53 Invalid, 1 Unknown, 41 Unchecked, 0.0s Time] [2022-12-14 15:43:00,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-12-14 15:43:00,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-12-14 15:43:00,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.032258064516129) internal successors, (32), 31 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:43:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2022-12-14 15:43:00,161 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 13 [2022-12-14 15:43:00,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:43:00,161 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2022-12-14 15:43:00,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:43:00,162 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2022-12-14 15:43:00,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 15:43:00,162 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:43:00,162 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 1, 1] [2022-12-14 15:43:00,167 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 15:43:00,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:43:00,363 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 15:43:00,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:43:00,365 INFO L85 PathProgramCache]: Analyzing trace with hash 2110260100, now seen corresponding path program 2 times [2022-12-14 15:43:00,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:43:00,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451918708] [2022-12-14 15:43:00,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:43:00,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:43:00,419 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 15:43:00,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [507608444] [2022-12-14 15:43:00,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:43:00,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:43:00,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:43:00,423 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:43:00,426 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-12-14 15:43:00,638 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 15:43:00,638 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:43:00,640 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-14 15:43:00,644 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:43:00,650 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 15:43:00,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:43:00,654 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 14 [2022-12-14 15:43:00,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 15:43:00,673 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:43:00,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:43:00,710 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:43:00,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:43:00,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:43:00,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:43:00,795 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:43:00,820 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:43:00,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:43:00,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 15:43:00,850 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:43:00,851 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:43:00,862 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_226 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-12-14 15:43:00,876 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_225)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_225 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))))) is different from false [2022-12-14 15:43:00,891 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_223 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_223))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_225)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_225))))) is different from false [2022-12-14 15:43:00,925 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_221 Int) (v_ArrVal_223 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_221)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_223))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_225)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_225) (not (<= v_ArrVal_221 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))))))) is different from false [2022-12-14 15:43:00,952 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_221 Int) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_223 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_220))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_221)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_223))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_225) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_221) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_225)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) is different from false [2022-12-14 15:43:01,012 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_221 Int) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_218 Int) (v_ArrVal_223 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_218)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_220))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_221)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_223))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_225)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_225) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_221) (not (<= v_ArrVal_218 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))))))))) is different from false [2022-12-14 15:43:01,055 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_217 (Array Int Int)) (v_ArrVal_221 Int) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_218 Int) (v_ArrVal_223 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_217))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_218)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_220))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_221)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_223))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_218) (< (+ 1 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|)) v_ArrVal_221) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_225)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_225))))))))) is different from false [2022-12-14 15:43:01,148 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_217 (Array Int Int)) (v_ArrVal_221 Int) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_218 Int) (v_ArrVal_223 (Array Int Int)) (v_ArrVal_216 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_216)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_217))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_218)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_220))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_221)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_223))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_221) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_225) (not (<= v_ArrVal_216 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_225)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_218))))))))) is different from false [2022-12-14 15:43:01,202 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (v_ArrVal_226 (Array Int Int)) (v_ArrVal_217 (Array Int Int)) (v_ArrVal_221 Int) (v_ArrVal_220 (Array Int Int)) (v_ArrVal_218 Int) (v_ArrVal_223 (Array Int Int)) (v_ArrVal_214 (Array Int Int)) (v_ArrVal_216 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_214))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_216)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_217))) (let ((.cse4 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_218)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_220))) (let ((.cse2 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_221)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_223))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_216) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_225) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_221) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_225)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_226) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_218))))))))))) is different from false [2022-12-14 15:43:01,268 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 60 not checked. [2022-12-14 15:43:01,269 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:43:01,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451918708] [2022-12-14 15:43:01,269 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 15:43:01,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [507608444] [2022-12-14 15:43:01,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [507608444] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:43:01,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1272371035] [2022-12-14 15:43:01,271 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 15:43:01,271 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:43:01,271 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:43:01,272 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:43:01,272 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:43:01,283 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:43:01,293 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 15:43:01,293 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 15:43:01,311 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-14 15:43:01,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 29 [2022-12-14 15:43:01,319 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-12-14 15:43:01,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:43:01,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 45 [2022-12-14 15:43:01,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:43:01,418 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 72 [2022-12-14 15:43:01,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:43:01,527 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:43:01,546 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 15:43:01,546 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-12-14 15:43:01,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:43:01,675 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:43:01,694 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 15:43:01,695 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-12-14 15:43:01,752 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:43:02,144 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '589#(and (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_main_#t~nondet11#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (exists ((|v_ULTIMATE.start_test_fun_#t~mem7#1_23| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_23| Int)) (and (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_23| |v_ULTIMATE.start_test_fun_#t~mem8#1_23|) 2147483647) (<= 0 (+ (* |v_ULTIMATE.start_test_fun_#t~mem7#1_23| |v_ULTIMATE.start_test_fun_#t~mem8#1_23|) 2147483648)) (= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_23| |v_ULTIMATE.start_test_fun_#t~mem8#1_23|) (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)))) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (= |#NULL.offset| 0) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem9#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet11#1|)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (< 2147483646 |ULTIMATE.start_test_fun_#t~mem9#1|))' at error location [2022-12-14 15:43:02,144 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:43:02,144 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:43:02,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 20 [2022-12-14 15:43:02,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192296764] [2022-12-14 15:43:02,145 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:43:02,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-12-14 15:43:02,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:43:02,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-12-14 15:43:02,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=269, Unknown=9, NotChecked=378, Total=756 [2022-12-14 15:43:02,147 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:43:02,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:43:02,291 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2022-12-14 15:43:02,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-12-14 15:43:02,292 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 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 31 [2022-12-14 15:43:02,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:43:02,293 INFO L225 Difference]: With dead ends: 39 [2022-12-14 15:43:02,293 INFO L226 Difference]: Without dead ends: 38 [2022-12-14 15:43:02,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 65 SyntacticMatches, 9 SemanticMatches, 27 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=109, Invalid=298, Unknown=9, NotChecked=396, Total=812 [2022-12-14 15:43:02,294 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:43:02,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 23 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 128 Unchecked, 0.0s Time] [2022-12-14 15:43:02,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-12-14 15:43:02,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-12-14 15:43:02,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:43:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-12-14 15:43:02,300 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 31 [2022-12-14 15:43:02,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:43:02,300 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-12-14 15:43:02,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.9523809523809526) internal successors, (62), 21 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:43:02,300 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-12-14 15:43:02,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-12-14 15:43:02,301 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:43:02,301 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 1, 1] [2022-12-14 15:43:02,306 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-12-14 15:43:02,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:43:02,503 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 15:43:02,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:43:02,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2098483537, now seen corresponding path program 3 times [2022-12-14 15:43:02,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:43:02,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142089568] [2022-12-14 15:43:02,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:43:02,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:43:02,543 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 15:43:02,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [22133923] [2022-12-14 15:43:02,543 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-14 15:43:02,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:43:02,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:43:02,544 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:43:02,545 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-12-14 15:43:02,607 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-14 15:43:02,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:43:02,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 41 conjunts are in the unsatisfiable core [2022-12-14 15:43:02,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:43:02,634 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-14 15:43:02,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-12-14 15:43:02,639 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 15:43:02,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 15:43:02,656 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-12-14 15:43:02,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-14 15:43:02,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-12-14 15:43:02,696 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:43:02,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:43:02,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:43:02,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:43:02,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:43:02,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:43:02,810 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:43:02,832 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:43:02,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:43:02,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:43:02,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:43:02,907 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 15:43:02,916 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:43:02,916 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:43:02,926 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_314 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-12-14 15:43:02,940 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_314 (Array Int Int))) (or (not (<= v_ArrVal_312 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_312)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-12-14 15:43:02,955 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_311 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_311))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_312)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_312))))) is different from false [2022-12-14 15:43:02,986 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_309 Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_309)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_311))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_312) (not (<= v_ArrVal_309 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_312)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2022-12-14 15:43:03,021 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_308))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_309)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_311))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_309) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_312)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_312))))))) is different from false [2022-12-14 15:43:03,079 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 Int) (v_ArrVal_307 Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_307)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_308))) (let ((.cse0 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_309)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_311))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_309) (not (<= v_ArrVal_307 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_312) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_312)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) is different from false [2022-12-14 15:43:03,120 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 Int) (v_ArrVal_307 Int) (v_ArrVal_311 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_305))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_307)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_308))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_309)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_311))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_309) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_312)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_312) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_307))))))))) is different from false [2022-12-14 15:43:03,205 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 Int) (v_ArrVal_307 Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_303 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_303)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_305))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_307)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_308))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_309)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_311))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_309) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_307) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_312) (not (<= v_ArrVal_303 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_312)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))) is different from false [2022-12-14 15:43:03,256 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 Int) (v_ArrVal_307 Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_303 Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_302))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_303)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_305))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_307)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_308))) (let ((.cse1 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_309)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_311))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_307) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_309) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_312) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_312)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_303))))))))))) is different from false [2022-12-14 15:43:03,365 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_300 Int) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 Int) (v_ArrVal_307 Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_303 Int)) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_300)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_302))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_303)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_305))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_307)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_308))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_309)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_311))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_309) (not (<= v_ArrVal_300 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_303) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_312) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_307) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_312)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))) is different from false [2022-12-14 15:43:03,445 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_312 Int) (v_ArrVal_314 (Array Int Int)) (v_ArrVal_300 Int) (v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_309 Int) (v_ArrVal_307 Int) (v_ArrVal_311 (Array Int Int)) (v_ArrVal_299 (Array Int Int)) (v_ArrVal_302 (Array Int Int)) (v_ArrVal_303 Int)) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_299))) (let ((.cse4 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_300)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_302))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_303)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_305))) (let ((.cse1 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_307)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_308))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_309)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_311))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_309) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_307) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_312) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_312)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_314) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_300) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_303))))))))))))) is different from false [2022-12-14 15:43:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 90 not checked. [2022-12-14 15:43:03,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:43:03,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142089568] [2022-12-14 15:43:03,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 15:43:03,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [22133923] [2022-12-14 15:43:03,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [22133923] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:43:03,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1149154915] [2022-12-14 15:43:03,551 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 15:43:03,551 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:43:03,551 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:43:03,551 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:43:03,552 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:43:03,571 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-14 15:43:03,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 29 [2022-12-14 15:43:03,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-12-14 15:43:03,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:43:03,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-12-14 15:43:03,630 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:43:03,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 41 [2022-12-14 15:43:03,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:43:03,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2022-12-14 15:43:03,766 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:43:03,785 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-12-14 15:43:03,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 228 [2022-12-14 15:43:03,889 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:43:03,904 INFO L321 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2022-12-14 15:43:03,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 273 treesize of output 248 [2022-12-14 15:43:04,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:43:04,054 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:43:04,073 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 15:43:04,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-12-14 15:43:04,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:43:04,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:43:04,186 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 15:43:04,186 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-12-14 15:43:04,239 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:43:04,585 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '937#(and (exists ((|v_ULTIMATE.start_test_fun_#t~mem7#1_33| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_33| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (* |v_ULTIMATE.start_test_fun_#t~mem7#1_33| |v_ULTIMATE.start_test_fun_#t~mem8#1_33|)) (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_33| |v_ULTIMATE.start_test_fun_#t~mem8#1_33|) 2147483647) (<= 0 (+ (* |v_ULTIMATE.start_test_fun_#t~mem7#1_33| |v_ULTIMATE.start_test_fun_#t~mem8#1_33|) 2147483648)))) (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_main_#t~nondet11#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (= |#NULL.offset| 0) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem9#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet11#1|)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (< 2147483646 |ULTIMATE.start_test_fun_#t~mem9#1|))' at error location [2022-12-14 15:43:04,585 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:43:04,585 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:43:04,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 24 [2022-12-14 15:43:04,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47085758] [2022-12-14 15:43:04,586 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:43:04,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-12-14 15:43:04,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:43:04,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-12-14 15:43:04,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=328, Unknown=11, NotChecked=528, Total=992 [2022-12-14 15:43:04,587 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 26 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:43:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:43:04,740 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2022-12-14 15:43:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:43:04,740 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-12-14 15:43:04,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:43:04,741 INFO L225 Difference]: With dead ends: 45 [2022-12-14 15:43:04,741 INFO L226 Difference]: Without dead ends: 44 [2022-12-14 15:43:04,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 79 SyntacticMatches, 11 SemanticMatches, 31 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=360, Unknown=11, NotChecked=550, Total=1056 [2022-12-14 15:43:04,743 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 15:43:04,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 34 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 212 Unchecked, 0.0s Time] [2022-12-14 15:43:04,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-12-14 15:43:04,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-12-14 15:43:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.0232558139534884) internal successors, (44), 43 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:43:04,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2022-12-14 15:43:04,746 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 37 [2022-12-14 15:43:04,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:43:04,746 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2022-12-14 15:43:04,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.96) internal successors, (74), 25 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:43:04,747 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2022-12-14 15:43:04,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-14 15:43:04,747 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:43:04,747 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 1, 1] [2022-12-14 15:43:04,752 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-12-14 15:43:04,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:43:04,949 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 15:43:04,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:43:04,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1871728990, now seen corresponding path program 4 times [2022-12-14 15:43:04,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:43:04,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722355314] [2022-12-14 15:43:04,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:43:04,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:43:04,972 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 15:43:04,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1425771633] [2022-12-14 15:43:04,972 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-12-14 15:43:04,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:43:04,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:43:04,974 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:43:04,975 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-12-14 15:43:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 15:43:05,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 48 conjunts are in the unsatisfiable core [2022-12-14 15:43:05,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:43:05,085 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-14 15:43:05,085 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-12-14 15:43:05,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 15:43:05,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 15:43:05,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:43:05,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 15 [2022-12-14 15:43:05,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-14 15:43:05,248 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-12-14 15:43:05,248 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2022-12-14 15:43:05,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:43:05,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:43:05,326 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:43:05,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:43:05,387 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:43:05,412 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:43:05,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:43:05,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:43:05,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:43:05,520 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-12-14 15:43:05,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2022-12-14 15:43:05,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:43:05,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-12-14 15:43:05,584 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 15:43:05,584 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:43:05,597 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_411 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) is different from false [2022-12-14 15:43:05,606 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_409 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))))) is different from false [2022-12-14 15:43:05,618 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) is different from false [2022-12-14 15:43:05,644 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (not (<= v_ArrVal_407 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))) is different from false [2022-12-14 15:43:05,667 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) is different from false [2022-12-14 15:43:05,710 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (not (<= v_ArrVal_403 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))))) is different from false [2022-12-14 15:43:05,741 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse3 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407))))))))) is different from false [2022-12-14 15:43:05,805 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse1 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse2 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (not (<= v_ArrVal_400 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403))))))))) is different from false [2022-12-14 15:43:05,855 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse4 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse3 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse0 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))))))))) is different from false [2022-12-14 15:43:05,973 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_398 Int) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_398)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse3 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse0 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse5 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_398 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407))))))))))) is different from false [2022-12-14 15:43:06,029 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_398 Int) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_398)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_398) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403))))))))))))) is different from false [2022-12-14 15:43:06,144 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int)) (v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_398 Int) (v_ArrVal_394 Int) (v_ArrVal_408 (Array Int Int))) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_394)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse3 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_398)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse2 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (not (<= v_ArrVal_394 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1))) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_398) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403))))))))))))) is different from false [2022-12-14 15:43:06,222 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int)) (v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_398 Int) (v_ArrVal_394 Int) (v_ArrVal_408 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_393))) (let ((.cse0 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_394)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse4 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse9 (store (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_398)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse2 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse3 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_394) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_398) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))))) is different from false [2022-12-14 15:43:06,435 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 126 not checked. [2022-12-14 15:43:06,435 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:43:06,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722355314] [2022-12-14 15:43:06,436 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 15:43:06,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1425771633] [2022-12-14 15:43:06,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1425771633] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:43:06,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [348683284] [2022-12-14 15:43:06,437 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 15:43:06,437 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:43:06,437 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:43:06,437 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:43:06,437 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:43:06,454 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:43:06,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-12-14 15:43:06,460 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:43:06,469 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 15:43:06,469 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 15:43:06,484 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-14 15:43:06,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 29 [2022-12-14 15:43:06,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:43:06,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 45 [2022-12-14 15:43:06,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:43:06,558 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 72 [2022-12-14 15:43:06,623 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:43:06,646 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:43:06,660 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 15:43:06,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-12-14 15:43:06,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:43:06,764 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:43:06,778 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 15:43:06,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-12-14 15:43:06,832 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:43:07,199 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1345#(and (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_main_#t~nondet11#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (= |#NULL.offset| 0) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (exists ((|v_ULTIMATE.start_test_fun_#t~mem7#1_43| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_43| Int)) (and (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_43| |v_ULTIMATE.start_test_fun_#t~mem8#1_43|) 2147483647) (<= 0 (+ (* |v_ULTIMATE.start_test_fun_#t~mem7#1_43| |v_ULTIMATE.start_test_fun_#t~mem8#1_43|) 2147483648)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (* |v_ULTIMATE.start_test_fun_#t~mem7#1_43| |v_ULTIMATE.start_test_fun_#t~mem8#1_43|)))) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem9#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet11#1|)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (< 2147483646 |ULTIMATE.start_test_fun_#t~mem9#1|))' at error location [2022-12-14 15:43:07,199 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:43:07,199 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:43:07,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 32 [2022-12-14 15:43:07,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420298514] [2022-12-14 15:43:07,199 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:43:07,200 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-12-14 15:43:07,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:43:07,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-12-14 15:43:07,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=552, Unknown=13, NotChecked=806, Total=1560 [2022-12-14 15:43:07,201 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 33 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:43:08,256 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse12 (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int)) (v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_398 Int) (v_ArrVal_394 Int) (v_ArrVal_408 (Array Int Int))) (let ((.cse43 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_393))) (let ((.cse32 (select .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse42 (store (store .cse43 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_394)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse36 (select .cse42 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse41 (store (store .cse42 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_398)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse34 (select .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse40 (store (store .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse35 (select .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse39 (store (store .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse37 (select .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse38 (store (store .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse33 (select .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_394) (< (+ (select .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (+ (select .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (+ (select .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_398) (< (+ (select .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))))))) (and (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_398 Int) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_398)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_398) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403))))))))))))) (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (select (select (store (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (let ((.cse13 (select (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or .cse12 (< .cse13 2) (not (< .cse13 100)))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse15 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse14 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse25 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse22 (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse24 (store (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse21 (select .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse23 (store (store .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse18 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse20 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (+ (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (+ (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))))))))) (forall ((v_ArrVal_411 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse31 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse26 (select .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse30 (store (store .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse29 (select .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse27 (store (store .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse28 (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (select (select (store (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407))))))))) (or .cse12 (not |c_ULTIMATE.start_test_fun_#t~short6#1|)))) is different from false [2022-12-14 15:43:08,270 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_398 Int) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_398)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_398) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403))))))))))))) (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (select (select (store (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse20 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse19 (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse21 (store (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse16 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (+ (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (+ (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))))))))) (forall ((v_ArrVal_411 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse24 (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse28 (store (store .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse27 (select .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse25 (store (store .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (select (select (store (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407))))))))) (or (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int)) (v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_398 Int) (v_ArrVal_394 Int) (v_ArrVal_408 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_393))) (let ((.cse30 (select .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse40 (store (store .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_394)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse34 (select .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse39 (store (store .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_398)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse32 (select .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse38 (store (store .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse33 (select .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse37 (store (store .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse35 (select .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse36 (store (store .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse31 (select .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_394) (< (+ (select .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (+ (select .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (+ (select .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_398) (< (+ (select .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))))) (not |c_ULTIMATE.start_test_fun_#t~short6#1|))) is different from false [2022-12-14 15:43:08,284 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_398 Int) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_398)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_398) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403))))))))))))) (forall ((v_ArrVal_393 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int)) (v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_398 Int) (v_ArrVal_394 Int) (v_ArrVal_408 (Array Int Int))) (let ((.cse21 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_393))) (let ((.cse10 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_394)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse14 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse19 (store (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_398)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse12 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse13 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse15 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse11 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_394) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (+ (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (+ (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_398) (< (+ (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))))))))))) (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse22 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (select (select (store (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse27 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse25 (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse26 (store (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse24 (select .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse35 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse32 (select .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse34 (store (store .cse35 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse31 (select .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse33 (store (store .cse34 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse28 (select .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse29 (store (store .cse33 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse30 (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (+ (select .cse32 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (+ (select .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))))))))) (forall ((v_ArrVal_411 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse41 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse36 (select .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse40 (store (store .cse41 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse39 (select .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse37 (store (store .cse40 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse38 (select .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse36 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (select (select (store (store .cse37 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse38 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse39 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407)))))))))) is different from false [2022-12-14 15:43:08,298 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_398 Int) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_398)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_398 .cse3)) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407))))))))))) (<= |c_ULTIMATE.start_test_fun_#t~mem9#1| 2147483646) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (not (<= v_ArrVal_403 .cse3)) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))))) (forall ((v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_409 .cse3)))) (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (not (<= v_ArrVal_407 .cse3)) (< (select (select (store (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))) (forall ((v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int)) (v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_398 Int) (v_ArrVal_394 Int) (v_ArrVal_408 (Array Int Int))) (let ((.cse25 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_394)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse19 (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse24 (store (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_398)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse20 (select .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse23 (store (store .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse21 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse18 (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse16 (store (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse17 (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (+ (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (not (<= v_ArrVal_394 .cse3)) (< (+ (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_398) (< (+ (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (+ (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403))))))))))))) (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse29 (select .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse30 (store (store .cse31 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse27 (select .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse28 (store (store .cse30 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse26 (select .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (not (<= v_ArrVal_400 .cse3)) (< (+ (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403))))))))))) is different from false [2022-12-14 15:43:08,310 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_398 Int) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_396 (Array Int Int)) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_396))) (let ((.cse0 (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse8 (store (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_398)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse2 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse5 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse1 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse3 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse4 (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_398) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (select (select (store (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403))))))))))))) (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse10 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (select (select (store (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse13 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse14 (store (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse12 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse20 (select .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse22 (store (store .cse23 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse19 (select .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse21 (store (store .cse22 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse16 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse17 (store (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse18 (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (+ (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (+ (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))))))))) (forall ((v_ArrVal_411 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse29 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse24 (select .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse28 (store (store .cse29 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse27 (select .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse25 (store (store .cse28 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse26 (select .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse24 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (select (select (store (store .cse25 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse26 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse27 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407)))))))))) is different from false [2022-12-14 15:43:08,321 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1)) (.cse9 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_398 Int) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_398)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse4 (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse0 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse6 (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse5 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse1 (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_398 .cse3)) (< (+ (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407))))))))))) (<= |c_ULTIMATE.start_test_fun_#t~mem9#1| 2147483646) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse11 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (not (<= v_ArrVal_403 .cse3)) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))))) (forall ((v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_409 .cse3)))) (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse15 (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (not (<= v_ArrVal_407 .cse3)) (< (select (select (store (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))) (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse19 (select .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse20 (store (store .cse21 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse17 (select .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store (store .cse20 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse16 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (not (<= v_ArrVal_400 .cse3)) (< (+ (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403))))))))))) is different from false [2022-12-14 15:43:08,330 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_399 (Array Int Int)) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_399))) (let ((.cse10 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse12 (store (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse9 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse11 (store (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse6 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (+ (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_400) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))))))))) (forall ((v_ArrVal_411 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse19 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse14 (select .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse18 (store (store .cse19 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse17 (select .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse15 (store (store .cse18 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse16 (select .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse14 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (select (select (store (store .cse15 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse16 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse17 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407)))))))))) is different from false [2022-12-14 15:43:08,339 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (<= |c_ULTIMATE.start_test_fun_#t~mem9#1| 2147483646) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (not (<= v_ArrVal_403 .cse3)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))))) (forall ((v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_409 .cse3)))) (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (not (<= v_ArrVal_407 .cse3)) (< (select (select (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))) (forall ((v_ArrVal_400 Int) (v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_400)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse11 (select .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse12 (store (store .cse13 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse9 (select .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store .cse12 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (not (<= v_ArrVal_400 .cse3)) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403))))))))))) is different from false [2022-12-14 15:43:08,346 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (forall ((v_ArrVal_411 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse11 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_402))) (let ((.cse6 (select .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse10 (store (store .cse11 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse9 (select .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse7 (store (store .cse10 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse8 (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_403) (< (select (select (store (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse8 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse9 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407)))))))))) is different from false [2022-12-14 15:43:08,352 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1)) (.cse5 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (<= |c_ULTIMATE.start_test_fun_#t~mem9#1| 2147483646) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_403 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_403)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse0 (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (select (select (store (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (not (<= v_ArrVal_403 .cse3)) (< (+ (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))))) (forall ((v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_409 .cse3)))) (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (not (<= v_ArrVal_407 .cse3)) (< (select (select (store (store .cse6 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse7 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))))) is different from false [2022-12-14 15:43:08,357 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (forall ((v_ArrVal_405 (Array Int Int)) (v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_405))) (let ((.cse3 (select .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (let ((.cse4 (store (store .cse5 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse2 (select .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_407) (< (select (select (store (store .cse4 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))))) (forall ((v_ArrVal_411 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-12-14 15:43:08,362 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1)) (.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (and (<= |c_ULTIMATE.start_test_fun_#t~mem9#1| 2147483646) (forall ((v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_409 .cse1)))) (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_407 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_407)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (not (<= v_ArrVal_407 .cse1)) (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (< (+ (select .cse3 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409))))))) is different from false [2022-12-14 15:43:08,366 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_408 (Array Int Int)) (v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_408))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base|))) (or (< (+ (select .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 1) v_ArrVal_409) (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~c~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))))) (forall ((v_ArrVal_411 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647))) is different from false [2022-12-14 15:43:08,369 WARN L837 $PredicateComparison]: unable to prove that (and (<= |c_ULTIMATE.start_test_fun_#t~mem9#1| 2147483646) (forall ((v_ArrVal_409 Int) (v_ArrVal_411 (Array Int Int))) (or (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset| v_ArrVal_409)) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| v_ArrVal_411) |c_ULTIMATE.start_test_fun_~c~0#1.base|) |c_ULTIMATE.start_test_fun_~c~0#1.offset|) 2147483647) (not (<= v_ArrVal_409 (+ |c_ULTIMATE.start_test_fun_#t~mem9#1| 1)))))) is different from false [2022-12-14 15:43:08,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:43:08,395 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-12-14 15:43:08,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-12-14 15:43:08,396 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 33 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-12-14 15:43:08,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:43:08,397 INFO L225 Difference]: With dead ends: 93 [2022-12-14 15:43:08,397 INFO L226 Difference]: Without dead ends: 92 [2022-12-14 15:43:08,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 89 SyntacticMatches, 17 SemanticMatches, 57 ConstructedPredicates, 27 IntricatePredicates, 0 DeprecatedPredicates, 498 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=290, Invalid=783, Unknown=27, NotChecked=2322, Total=3422 [2022-12-14 15:43:08,399 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 184 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 15:43:08,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 86 Invalid, 0 Unknown, 184 Unchecked, 0.1s Time] [2022-12-14 15:43:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-12-14 15:43:08,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-12-14 15:43:08,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.010989010989011) internal successors, (92), 91 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:43:08,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2022-12-14 15:43:08,408 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 43 [2022-12-14 15:43:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:43:08,408 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2022-12-14 15:43:08,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.606060606060606) internal successors, (86), 33 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:43:08,409 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2022-12-14 15:43:08,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-12-14 15:43:08,409 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 15:43:08,409 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 1, 1] [2022-12-14 15:43:08,414 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-12-14 15:43:08,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:43:08,610 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 1 more)] === [2022-12-14 15:43:08,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 15:43:08,611 INFO L85 PathProgramCache]: Analyzing trace with hash -779427130, now seen corresponding path program 5 times [2022-12-14 15:43:08,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 15:43:08,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246873223] [2022-12-14 15:43:08,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 15:43:08,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 15:43:08,633 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-12-14 15:43:08,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [712890072] [2022-12-14 15:43:08,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-14 15:43:08,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:43:08,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 15:43:08,635 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 15:43:08,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-12-14 15:43:08,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-12-14 15:43:08,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-14 15:43:08,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 44 conjunts are in the unsatisfiable core [2022-12-14 15:43:08,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 15:43:08,837 INFO L321 Elim1Store]: treesize reduction 26, result has 42.2 percent of original size [2022-12-14 15:43:08,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 74 [2022-12-14 15:43:08,844 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-12-14 15:43:08,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-12-14 15:43:08,869 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:43:08,870 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:43:08,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 9 [2022-12-14 15:43:08,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2022-12-14 15:43:08,922 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:43:08,923 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2022-12-14 15:43:09,167 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 20 [2022-12-14 15:43:09,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:43:09,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 24 [2022-12-14 15:43:09,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:43:09,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2022-12-14 15:43:11,315 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-12-14 15:43:12,204 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2022-12-14 15:43:12,495 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 263 proven. 47 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2022-12-14 15:43:12,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 15:43:12,609 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_560 Int) (v_ArrVal_562 (Array Int Int))) (or (not (<= (* |c_ULTIMATE.start_test_fun_#t~mem7#1| |c_ULTIMATE.start_test_fun_#t~mem8#1|) v_ArrVal_560)) (not (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_560)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 100)))) is different from false [2022-12-14 15:43:12,630 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_test_fun_#t~mem8#1_48| Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_48| Int)) (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (forall ((v_ArrVal_560 Int) (v_ArrVal_562 (Array Int Int))) (or (not (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_48| |v_ULTIMATE.start_test_fun_#t~mem8#1_48|) v_ArrVal_560)) (not (< (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse0 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_560)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 100)))) (not (<= .cse1 |v_ULTIMATE.start_test_fun_#t~mem8#1_48|)) (not (<= .cse1 |v_ULTIMATE.start_test_fun_#t~mem7#1_48|)))))) is different from false [2022-12-14 15:43:12,655 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_559 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem8#1_48| Int) (v_ArrVal_560 Int) (v_ArrVal_562 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem7#1_48| Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_559))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (not (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_48| |v_ULTIMATE.start_test_fun_#t~mem8#1_48|) v_ArrVal_560)) (not (<= .cse0 |v_ULTIMATE.start_test_fun_#t~mem7#1_48|)) (not (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_560)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 100)) (not (<= .cse0 |v_ULTIMATE.start_test_fun_#t~mem8#1_48|))))))) is different from false [2022-12-14 15:43:12,685 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_559 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem8#1_48| Int) (v_ArrVal_560 Int) (v_ArrVal_562 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem7#1_48| Int) (v_ArrVal_557 Int)) (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_557)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_559))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (not (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_48| |v_ULTIMATE.start_test_fun_#t~mem8#1_48|) v_ArrVal_560)) (not (<= .cse0 |v_ULTIMATE.start_test_fun_#t~mem7#1_48|)) (not (<= .cse0 |v_ULTIMATE.start_test_fun_#t~mem8#1_48|)) (not (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_560)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 100)) (not (<= (* |c_ULTIMATE.start_test_fun_#t~mem7#1| |c_ULTIMATE.start_test_fun_#t~mem8#1|) v_ArrVal_557))))))) is different from false [2022-12-14 15:43:13,112 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_test_fun_#t~mem8#1_49| Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem8#1_48| Int) (v_ArrVal_560 Int) (v_ArrVal_562 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem7#1_48| Int) (v_ArrVal_557 Int)) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_556))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse1 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_557)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_559))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (not (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_48| |v_ULTIMATE.start_test_fun_#t~mem8#1_48|) v_ArrVal_560)) (not (< .cse0 100)) (not (<= (* .cse0 |v_ULTIMATE.start_test_fun_#t~mem8#1_49|) v_ArrVal_557)) (not (<= .cse0 |v_ULTIMATE.start_test_fun_#t~mem8#1_49|)) (not (< (select (select (store (store .cse1 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_560)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 100)) (not (<= .cse3 |v_ULTIMATE.start_test_fun_#t~mem8#1_48|)) (< .cse0 2) (not (<= .cse3 |v_ULTIMATE.start_test_fun_#t~mem7#1_48|))))))))) is different from false [2022-12-14 15:43:13,293 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_555 Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_49| Int) (v_ArrVal_556 (Array Int Int)) (v_ArrVal_559 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem8#1_48| Int) (v_ArrVal_560 Int) (v_ArrVal_562 (Array Int Int)) (|v_ULTIMATE.start_test_fun_#t~mem7#1_48| Int) (v_ArrVal_557 Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_555)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_556))) (let ((.cse4 (select .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse2 (store (store .cse5 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_557)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_559))) (let ((.cse3 (select .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse4 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse1 (select .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|))) (or (not (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_48| |v_ULTIMATE.start_test_fun_#t~mem8#1_48|) v_ArrVal_560)) (not (<= (* .cse0 |v_ULTIMATE.start_test_fun_#t~mem8#1_49|) v_ArrVal_557)) (not (<= (* |c_ULTIMATE.start_test_fun_#t~mem7#1| |c_ULTIMATE.start_test_fun_#t~mem8#1|) v_ArrVal_555)) (not (<= .cse1 |v_ULTIMATE.start_test_fun_#t~mem8#1_48|)) (not (< (select (select (store (store .cse2 |c_ULTIMATE.start_test_fun_~x_ref~0#1.base| (store .cse3 |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset| v_ArrVal_560)) |c_ULTIMATE.start_test_fun_~c~0#1.base| v_ArrVal_562) |c_ULTIMATE.start_test_fun_~x_ref~0#1.base|) |c_ULTIMATE.start_test_fun_~x_ref~0#1.offset|) 100)) (not (<= .cse0 |v_ULTIMATE.start_test_fun_#t~mem8#1_49|)) (< .cse0 2) (not (< .cse0 100)) (not (<= .cse1 |v_ULTIMATE.start_test_fun_#t~mem7#1_48|))))))))) is different from false [2022-12-14 15:43:13,827 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-14 15:43:13,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 276 treesize of output 172 [2022-12-14 15:43:13,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 318 treesize of output 298 [2022-12-14 15:43:13,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2022-12-14 15:43:13,880 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 102 [2022-12-14 15:43:13,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 93 [2022-12-14 15:43:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 107 proven. 52 refuted. 1 times theorem prover too weak. 320 trivial. 150 not checked. [2022-12-14 15:43:14,362 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 15:43:14,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246873223] [2022-12-14 15:43:14,362 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-12-14 15:43:14,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712890072] [2022-12-14 15:43:14,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712890072] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 15:43:14,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [90055825] [2022-12-14 15:43:14,364 INFO L159 IcfgInterpreter]: Started Sifa with 8 locations of interest [2022-12-14 15:43:14,364 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 15:43:14,364 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 15:43:14,364 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 15:43:14,365 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 15:43:14,375 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:43:14,382 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-12-14 15:43:14,382 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 19 [2022-12-14 15:43:14,395 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-12-14 15:43:14,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2022-12-14 15:43:14,409 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-12-14 15:43:14,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 29 [2022-12-14 15:43:14,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:43:14,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 45 [2022-12-14 15:43:14,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-12-14 15:43:14,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 72 [2022-12-14 15:43:14,551 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:43:14,569 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:43:14,593 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 15:43:14,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-12-14 15:43:14,666 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-12-14 15:43:14,688 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-14 15:43:14,702 INFO L321 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-12-14 15:43:14,702 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 42 [2022-12-14 15:43:14,759 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 15:43:15,962 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2190#(and (= |ULTIMATE.start_test_fun_#t~malloc2#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_#t~malloc2#1.base|) (<= |ULTIMATE.start_test_fun_~x#1| 2147483647) (= |ULTIMATE.start_test_fun_#t~malloc3#1.offset| 0) (<= 0 (+ |ULTIMATE.start_test_fun_~x#1| 2147483648)) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.base|) (exists ((|v_ULTIMATE.start_test_fun_#t~mem7#1_64| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_64| Int)) (and (<= 0 (+ (* |v_ULTIMATE.start_test_fun_#t~mem7#1_64| |v_ULTIMATE.start_test_fun_#t~mem8#1_64|) 2147483648)) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|) |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (* |v_ULTIMATE.start_test_fun_#t~mem7#1_64| |v_ULTIMATE.start_test_fun_#t~mem8#1_64|)) (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_64| |v_ULTIMATE.start_test_fun_#t~mem8#1_64|) 2147483647))) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.base|) (<= 0 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|) (<= |ULTIMATE.start_main_#t~nondet11#1| 2147483647) (<= 0 |ULTIMATE.start_test_fun_#t~malloc3#1.base|) (<= |ULTIMATE.start_test_fun_~c~0#1.offset| 0) (<= 0 |ULTIMATE.start_test_fun_~c~0#1.offset|) (<= 0 (+ 2147483648 |ULTIMATE.start_test_fun_#in~x#1|)) (= |#NULL.offset| 0) (<= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0) (<= |ULTIMATE.start_test_fun_#in~x#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|) |ULTIMATE.start_test_fun_#t~mem9#1|) (<= 0 (+ 2147483648 |ULTIMATE.start_main_#t~nondet11#1|)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (< 2147483646 |ULTIMATE.start_test_fun_#t~mem9#1|))' at error location [2022-12-14 15:43:15,962 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 15:43:15,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-12-14 15:43:15,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 28 [2022-12-14 15:43:15,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613319288] [2022-12-14 15:43:15,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-12-14 15:43:15,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-12-14 15:43:15,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 15:43:15,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-12-14 15:43:15,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=648, Unknown=15, NotChecked=354, Total=1190 [2022-12-14 15:43:15,963 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:43:18,959 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2022-12-14 15:43:23,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2022-12-14 15:43:24,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 15:43:24,435 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2022-12-14 15:43:24,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 15:43:24,435 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 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 91 [2022-12-14 15:43:24,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 15:43:24,435 INFO L225 Difference]: With dead ends: 92 [2022-12-14 15:43:24,435 INFO L226 Difference]: Without dead ends: 0 [2022-12-14 15:43:24,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 238 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 6 IntricatePredicates, 3 DeprecatedPredicates, 400 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=324, Invalid=1167, Unknown=15, NotChecked=474, Total=1980 [2022-12-14 15:43:24,436 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 4 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-12-14 15:43:24,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 23 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 128 Invalid, 2 Unknown, 86 Unchecked, 4.9s Time] [2022-12-14 15:43:24,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-14 15:43:24,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-14 15:43:24,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:43:24,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-14 15:43:24,437 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 91 [2022-12-14 15:43:24,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 15:43:24,437 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-14 15:43:24,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-14 15:43:24,437 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-14 15:43:24,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-14 15:43:24,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 4 remaining) [2022-12-14 15:43:24,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 4 remaining) [2022-12-14 15:43:24,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 4 remaining) [2022-12-14 15:43:24,439 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 4 remaining) [2022-12-14 15:43:24,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-12-14 15:43:24,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 15:43:24,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-14 15:43:26,471 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 554) no Hoare annotation was computed. [2022-12-14 15:43:26,471 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-14 15:43:26,471 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2022-12-14 15:43:26,471 INFO L899 garLoopResultBuilder]: For program point L554(line 554) no Hoare annotation was computed. [2022-12-14 15:43:26,471 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-14 15:43:26,471 INFO L899 garLoopResultBuilder]: For program point L554-1(line 554) no Hoare annotation was computed. [2022-12-14 15:43:26,471 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 554) no Hoare annotation was computed. [2022-12-14 15:43:26,471 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 555) no Hoare annotation was computed. [2022-12-14 15:43:26,471 INFO L899 garLoopResultBuilder]: For program point L555(line 555) no Hoare annotation was computed. [2022-12-14 15:43:26,471 INFO L899 garLoopResultBuilder]: For program point L555-1(line 555) no Hoare annotation was computed. [2022-12-14 15:43:26,471 INFO L899 garLoopResultBuilder]: For program point L553-3(lines 553 556) no Hoare annotation was computed. [2022-12-14 15:43:26,471 INFO L895 garLoopResultBuilder]: At program point L553-5(lines 553 556) the Hoare annotation is: (let ((.cse3 (select (select |#memory_int| |ULTIMATE.start_test_fun_~c~0#1.base|) |ULTIMATE.start_test_fun_~c~0#1.offset|)) (.cse7 (select |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (let ((.cse0 (select .cse7 |ULTIMATE.start_test_fun_~x_ref~0#1.offset|)) (.cse1 (= |ULTIMATE.start_test_fun_~x_ref~0#1.offset| 0)) (.cse2 (<= 0 .cse3)) (.cse4 (= |ULTIMATE.start_test_fun_~c~0#1.offset| 0))) (or (and (exists ((|v_ULTIMATE.start_test_fun_#t~mem7#1_44| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_44| Int)) (and (<= 2 |v_ULTIMATE.start_test_fun_#t~mem7#1_44|) (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_44| |v_ULTIMATE.start_test_fun_#t~mem8#1_44|) .cse0) (<= 2 |v_ULTIMATE.start_test_fun_#t~mem8#1_44|))) .cse1 .cse2 (<= .cse3 1) .cse4) (and .cse1 .cse2 (not (= |ULTIMATE.start_test_fun_~x_ref~0#1.base| |ULTIMATE.start_test_fun_~c~0#1.base|)) .cse4 (exists ((v_DerPreprocessor_3 (Array Int Int)) (v_DerPreprocessor_4 (Array Int Int))) (let ((.cse5 (select v_DerPreprocessor_4 |ULTIMATE.start_test_fun_~c~0#1.offset|)) (.cse6 (select (store (store (store (store |#memory_int| |ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_4) |ULTIMATE.start_test_fun_~x_ref~0#1.base| v_DerPreprocessor_3) |ULTIMATE.start_test_fun_~c~0#1.base| v_DerPreprocessor_4) |ULTIMATE.start_test_fun_~x_ref~0#1.base|))) (and (<= .cse5 0) (= .cse3 .cse5) (= v_DerPreprocessor_3 .cse6) (= .cse7 .cse6))))) (and (exists ((|v_ULTIMATE.start_test_fun_#t~mem7#1_44| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_45| Int) (v_arrayElimCell_127 Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_44| Int)) (and (<= v_arrayElimCell_127 |v_ULTIMATE.start_test_fun_#t~mem8#1_45|) (<= 2 |v_ULTIMATE.start_test_fun_#t~mem7#1_44|) (< v_arrayElimCell_127 100) (<= (* v_arrayElimCell_127 |v_ULTIMATE.start_test_fun_#t~mem8#1_45|) .cse0) (<= 2 |v_ULTIMATE.start_test_fun_#t~mem8#1_44|) (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_44| |v_ULTIMATE.start_test_fun_#t~mem8#1_44|) v_arrayElimCell_127))) .cse1 .cse2 .cse4 (<= .cse3 2)) (and (exists ((|v_ULTIMATE.start_test_fun_#t~mem7#1_44| Int) (|v_ULTIMATE.start_test_fun_#t~mem7#1_46| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_45| Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_46| Int) (v_arrayElimCell_127 Int) (|v_ULTIMATE.start_test_fun_#t~mem8#1_44| Int)) (let ((.cse8 (* v_arrayElimCell_127 |v_ULTIMATE.start_test_fun_#t~mem8#1_45|))) (and (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_46| |v_ULTIMATE.start_test_fun_#t~mem8#1_46|) .cse0) (<= .cse8 |v_ULTIMATE.start_test_fun_#t~mem7#1_46|) (<= v_arrayElimCell_127 |v_ULTIMATE.start_test_fun_#t~mem8#1_45|) (<= 2 |v_ULTIMATE.start_test_fun_#t~mem7#1_44|) (< v_arrayElimCell_127 100) (<= .cse8 |v_ULTIMATE.start_test_fun_#t~mem8#1_46|) (<= 2 |v_ULTIMATE.start_test_fun_#t~mem8#1_44|) (<= (* |v_ULTIMATE.start_test_fun_#t~mem7#1_44| |v_ULTIMATE.start_test_fun_#t~mem8#1_44|) v_arrayElimCell_127)))) .cse1 .cse2 .cse4 (<= .cse3 3))))) [2022-12-14 15:43:26,471 INFO L902 garLoopResultBuilder]: At program point L553-6(lines 553 556) the Hoare annotation is: true [2022-12-14 15:43:26,474 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1] [2022-12-14 15:43:26,475 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 15:43:26,481 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,481 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,482 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,482 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,482 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,482 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,483 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,484 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-12-14 15:43:26,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_46,QUANTIFIED] [2022-12-14 15:43:26,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-12-14 15:43:26,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,485 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_46,QUANTIFIED] [2022-12-14 15:43:26,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,486 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,492 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,493 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,494 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,495 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-12-14 15:43:26,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_46,QUANTIFIED] [2022-12-14 15:43:26,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,496 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-12-14 15:43:26,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_46,QUANTIFIED] [2022-12-14 15:43:26,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,497 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,498 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,498 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 03:43:26 BoogieIcfgContainer [2022-12-14 15:43:26,500 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 15:43:26,500 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 15:43:26,500 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 15:43:26,501 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 15:43:26,501 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 03:42:55" (3/4) ... [2022-12-14 15:43:26,503 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-14 15:43:26,511 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-12-14 15:43:26,512 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-12-14 15:43:26,512 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-14 15:43:26,512 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-14 15:43:26,528 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists v_ULTIMATE.start_test_fun_#t~mem7#1_44 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_44 : int :: (2 <= v_ULTIMATE.start_test_fun_#t~mem7#1_44 && v_ULTIMATE.start_test_fun_#t~mem7#1_44 * v_ULTIMATE.start_test_fun_#t~mem8#1_44 <= unknown-#memory_int-unknown[x_ref][x_ref]) && 2 <= v_ULTIMATE.start_test_fun_#t~mem8#1_44) && x_ref == 0) && 0 <= unknown-#memory_int-unknown[c][c]) && unknown-#memory_int-unknown[c][c] <= 1) && c == 0) || ((((x_ref == 0 && 0 <= unknown-#memory_int-unknown[c][c]) && !(x_ref == c)) && c == 0) && (\exists v_DerPreprocessor_3 : [int]int, v_DerPreprocessor_4 : [int]int :: ((v_DerPreprocessor_4[c] <= 0 && unknown-#memory_int-unknown[c][c] == v_DerPreprocessor_4[c]) && v_DerPreprocessor_3 == unknown-#memory_int-unknown[x_ref := v_DerPreprocessor_3][c := v_DerPreprocessor_4][x_ref := v_DerPreprocessor_3][c := v_DerPreprocessor_4][x_ref]) && unknown-#memory_int-unknown[x_ref] == unknown-#memory_int-unknown[x_ref := v_DerPreprocessor_3][c := v_DerPreprocessor_4][x_ref := v_DerPreprocessor_3][c := v_DerPreprocessor_4][x_ref]))) || (((((\exists v_ULTIMATE.start_test_fun_#t~mem7#1_44 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_45 : int, v_arrayElimCell_127 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_44 : int :: ((((v_arrayElimCell_127 <= v_ULTIMATE.start_test_fun_#t~mem8#1_45 && 2 <= v_ULTIMATE.start_test_fun_#t~mem7#1_44) && v_arrayElimCell_127 < 100) && v_arrayElimCell_127 * v_ULTIMATE.start_test_fun_#t~mem8#1_45 <= unknown-#memory_int-unknown[x_ref][x_ref]) && 2 <= v_ULTIMATE.start_test_fun_#t~mem8#1_44) && v_ULTIMATE.start_test_fun_#t~mem7#1_44 * v_ULTIMATE.start_test_fun_#t~mem8#1_44 <= v_arrayElimCell_127) && x_ref == 0) && 0 <= unknown-#memory_int-unknown[c][c]) && c == 0) && unknown-#memory_int-unknown[c][c] <= 2)) || (((((\exists v_ULTIMATE.start_test_fun_#t~mem7#1_44 : int, v_ULTIMATE.start_test_fun_#t~mem7#1_46 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_45 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_46 : int, v_arrayElimCell_127 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_44 : int :: ((((((v_ULTIMATE.start_test_fun_#t~mem7#1_46 * v_ULTIMATE.start_test_fun_#t~mem8#1_46 <= unknown-#memory_int-unknown[x_ref][x_ref] && v_arrayElimCell_127 * v_ULTIMATE.start_test_fun_#t~mem8#1_45 <= v_ULTIMATE.start_test_fun_#t~mem7#1_46) && v_arrayElimCell_127 <= v_ULTIMATE.start_test_fun_#t~mem8#1_45) && 2 <= v_ULTIMATE.start_test_fun_#t~mem7#1_44) && v_arrayElimCell_127 < 100) && v_arrayElimCell_127 * v_ULTIMATE.start_test_fun_#t~mem8#1_45 <= v_ULTIMATE.start_test_fun_#t~mem8#1_46) && 2 <= v_ULTIMATE.start_test_fun_#t~mem8#1_44) && v_ULTIMATE.start_test_fun_#t~mem7#1_44 * v_ULTIMATE.start_test_fun_#t~mem8#1_44 <= v_arrayElimCell_127) && x_ref == 0) && 0 <= unknown-#memory_int-unknown[c][c]) && c == 0) && unknown-#memory_int-unknown[c][c] <= 3) [2022-12-14 15:43:26,533 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 15:43:26,533 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 15:43:26,533 INFO L158 Benchmark]: Toolchain (without parser) took 31682.98ms. Allocated memory was 146.8MB in the beginning and 270.5MB in the end (delta: 123.7MB). Free memory was 93.0MB in the beginning and 217.9MB in the end (delta: -124.9MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. [2022-12-14 15:43:26,533 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 107.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:43:26,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.47ms. Allocated memory is still 146.8MB. Free memory was 93.0MB in the beginning and 77.5MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-14 15:43:26,534 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.51ms. Allocated memory is still 146.8MB. Free memory was 77.5MB in the beginning and 75.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:43:26,534 INFO L158 Benchmark]: Boogie Preprocessor took 22.62ms. Allocated memory is still 146.8MB. Free memory was 75.6MB in the beginning and 74.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 15:43:26,534 INFO L158 Benchmark]: RCFGBuilder took 283.17ms. Allocated memory is still 146.8MB. Free memory was 74.4MB in the beginning and 111.4MB in the end (delta: -37.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-14 15:43:26,534 INFO L158 Benchmark]: TraceAbstraction took 31053.28ms. Allocated memory was 146.8MB in the beginning and 270.5MB in the end (delta: 123.7MB). Free memory was 110.3MB in the beginning and 220.0MB in the end (delta: -109.7MB). Peak memory consumption was 156.2MB. Max. memory is 16.1GB. [2022-12-14 15:43:26,534 INFO L158 Benchmark]: Witness Printer took 32.73ms. Allocated memory is still 270.5MB. Free memory was 220.0MB in the beginning and 217.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 15:43:26,535 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 146.8MB. Free memory is still 107.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.47ms. Allocated memory is still 146.8MB. Free memory was 93.0MB in the beginning and 77.5MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.51ms. Allocated memory is still 146.8MB. Free memory was 77.5MB in the beginning and 75.6MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.62ms. Allocated memory is still 146.8MB. Free memory was 75.6MB in the beginning and 74.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 283.17ms. Allocated memory is still 146.8MB. Free memory was 74.4MB in the beginning and 111.4MB in the end (delta: -37.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 31053.28ms. Allocated memory was 146.8MB in the beginning and 270.5MB in the end (delta: 123.7MB). Free memory was 110.3MB in the beginning and 220.0MB in the end (delta: -109.7MB). Peak memory consumption was 156.2MB. Max. memory is 16.1GB. * Witness Printer took 32.73ms. Allocated memory is still 270.5MB. Free memory was 220.0MB in the beginning and 217.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_46,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 554]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 555]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 4 error locations. Started 1 CEGAR loops. OverallTime: 31.0s, OverallIterations: 9, TraceHistogramMax: 15, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 7 mSolverCounterUnknown, 34 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34 mSDsluCounter, 155 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 651 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 448 IncrementalHoareTripleChecker+Invalid, 1131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 22 mSDtfsCounter, 448 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 739 GetRequests, 498 SyntacticMatches, 41 SemanticMatches, 200 ConstructedPredicates, 59 IntricatePredicates, 3 DeprecatedPredicates, 1398 ImplicationChecksByTransitivity, 10.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=8, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 218 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 155 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.8s InterpolantComputationTime, 237 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 438 ConstructedInterpolants, 148 QuantifiedInterpolants, 37959 SizeOfPredicates, 71 NumberOfNonLiveVariables, 1126 ConjunctsInSsa, 239 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 1010/1824 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 553]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 553]: Loop Invariant [2022-12-14 15:43:26,541 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,542 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,542 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,542 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,542 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,542 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,542 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,542 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,542 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,543 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-12-14 15:43:26,544 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_46,QUANTIFIED] [2022-12-14 15:43:26,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-12-14 15:43:26,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,545 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,546 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_46,QUANTIFIED] [2022-12-14 15:43:26,546 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,546 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,546 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,546 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,547 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,548 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,548 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,548 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,548 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,548 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,548 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,548 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,549 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,549 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,549 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,549 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,549 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,549 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_3,QUANTIFIED] [2022-12-14 15:43:26,549 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_DerPreprocessor_4,QUANTIFIED] [2022-12-14 15:43:26,549 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,549 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,550 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,550 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,550 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,550 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,550 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,550 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,550 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,550 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,550 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-12-14 15:43:26,551 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_46,QUANTIFIED] [2022-12-14 15:43:26,551 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,551 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,551 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_46,QUANTIFIED] [2022-12-14 15:43:26,551 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,551 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,551 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,551 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,551 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] [2022-12-14 15:43:26,552 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_45,QUANTIFIED] [2022-12-14 15:43:26,552 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_46,QUANTIFIED] [2022-12-14 15:43:26,552 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,552 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem7#1_44,QUANTIFIED] [2022-12-14 15:43:26,552 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_test_fun_#t~mem8#1_44,QUANTIFIED] [2022-12-14 15:43:26,552 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_127,QUANTIFIED] Derived loop invariant: (((((((\exists v_ULTIMATE.start_test_fun_#t~mem7#1_44 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_44 : int :: (2 <= v_ULTIMATE.start_test_fun_#t~mem7#1_44 && v_ULTIMATE.start_test_fun_#t~mem7#1_44 * v_ULTIMATE.start_test_fun_#t~mem8#1_44 <= unknown-#memory_int-unknown[x_ref][x_ref]) && 2 <= v_ULTIMATE.start_test_fun_#t~mem8#1_44) && x_ref == 0) && 0 <= unknown-#memory_int-unknown[c][c]) && unknown-#memory_int-unknown[c][c] <= 1) && c == 0) || ((((x_ref == 0 && 0 <= unknown-#memory_int-unknown[c][c]) && !(x_ref == c)) && c == 0) && (\exists v_DerPreprocessor_3 : [int]int, v_DerPreprocessor_4 : [int]int :: ((v_DerPreprocessor_4[c] <= 0 && unknown-#memory_int-unknown[c][c] == v_DerPreprocessor_4[c]) && v_DerPreprocessor_3 == unknown-#memory_int-unknown[x_ref := v_DerPreprocessor_3][c := v_DerPreprocessor_4][x_ref := v_DerPreprocessor_3][c := v_DerPreprocessor_4][x_ref]) && unknown-#memory_int-unknown[x_ref] == unknown-#memory_int-unknown[x_ref := v_DerPreprocessor_3][c := v_DerPreprocessor_4][x_ref := v_DerPreprocessor_3][c := v_DerPreprocessor_4][x_ref]))) || (((((\exists v_ULTIMATE.start_test_fun_#t~mem7#1_44 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_45 : int, v_arrayElimCell_127 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_44 : int :: ((((v_arrayElimCell_127 <= v_ULTIMATE.start_test_fun_#t~mem8#1_45 && 2 <= v_ULTIMATE.start_test_fun_#t~mem7#1_44) && v_arrayElimCell_127 < 100) && v_arrayElimCell_127 * v_ULTIMATE.start_test_fun_#t~mem8#1_45 <= unknown-#memory_int-unknown[x_ref][x_ref]) && 2 <= v_ULTIMATE.start_test_fun_#t~mem8#1_44) && v_ULTIMATE.start_test_fun_#t~mem7#1_44 * v_ULTIMATE.start_test_fun_#t~mem8#1_44 <= v_arrayElimCell_127) && x_ref == 0) && 0 <= unknown-#memory_int-unknown[c][c]) && c == 0) && unknown-#memory_int-unknown[c][c] <= 2)) || (((((\exists v_ULTIMATE.start_test_fun_#t~mem7#1_44 : int, v_ULTIMATE.start_test_fun_#t~mem7#1_46 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_45 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_46 : int, v_arrayElimCell_127 : int, v_ULTIMATE.start_test_fun_#t~mem8#1_44 : int :: ((((((v_ULTIMATE.start_test_fun_#t~mem7#1_46 * v_ULTIMATE.start_test_fun_#t~mem8#1_46 <= unknown-#memory_int-unknown[x_ref][x_ref] && v_arrayElimCell_127 * v_ULTIMATE.start_test_fun_#t~mem8#1_45 <= v_ULTIMATE.start_test_fun_#t~mem7#1_46) && v_arrayElimCell_127 <= v_ULTIMATE.start_test_fun_#t~mem8#1_45) && 2 <= v_ULTIMATE.start_test_fun_#t~mem7#1_44) && v_arrayElimCell_127 < 100) && v_arrayElimCell_127 * v_ULTIMATE.start_test_fun_#t~mem8#1_45 <= v_ULTIMATE.start_test_fun_#t~mem8#1_46) && 2 <= v_ULTIMATE.start_test_fun_#t~mem8#1_44) && v_ULTIMATE.start_test_fun_#t~mem7#1_44 * v_ULTIMATE.start_test_fun_#t~mem8#1_44 <= v_arrayElimCell_127) && x_ref == 0) && 0 <= unknown-#memory_int-unknown[c][c]) && c == 0) && unknown-#memory_int-unknown[c][c] <= 3) RESULT: Ultimate proved your program to be correct! [2022-12-14 15:43:26,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_38306525-bf6f-43ae-951b-8797d047919c/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE