./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/verifythis/duplets.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 8393723b 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_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/verifythis/duplets.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS --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 32bit --witnessprinter.graph.data.programhash ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 --- 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-8393723 [2022-11-19 07:19:15,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 07:19:15,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 07:19:15,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 07:19:15,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 07:19:15,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 07:19:15,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 07:19:15,709 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 07:19:15,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 07:19:15,712 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 07:19:15,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 07:19:15,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 07:19:15,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 07:19:15,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 07:19:15,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 07:19:15,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 07:19:15,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 07:19:15,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 07:19:15,725 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 07:19:15,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 07:19:15,729 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 07:19:15,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 07:19:15,740 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 07:19:15,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 07:19:15,746 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 07:19:15,754 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 07:19:15,755 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 07:19:15,756 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 07:19:15,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 07:19:15,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 07:19:15,759 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 07:19:15,760 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 07:19:15,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 07:19:15,764 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 07:19:15,766 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 07:19:15,767 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 07:19:15,769 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 07:19:15,770 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 07:19:15,770 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 07:19:15,771 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 07:19:15,772 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 07:19:15,773 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/config/svcomp-Overflow-32bit-Taipan_Default.epf [2022-11-19 07:19:15,826 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 07:19:15,828 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 07:19:15,829 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 07:19:15,830 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 07:19:15,831 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 07:19:15,831 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 07:19:15,831 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 07:19:15,831 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 07:19:15,832 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 07:19:15,832 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 07:19:15,833 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 07:19:15,834 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 07:19:15,834 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 07:19:15,834 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 07:19:15,834 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 07:19:15,835 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 07:19:15,835 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 07:19:15,835 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 07:19:15,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 07:19:15,836 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 07:19:15,837 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-19 07:19:15,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 07:19:15,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 07:19:15,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 07:19:15,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 07:19:15,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 07:19:15,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 07:19:15,840 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-19 07:19:15,840 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 07:19:15,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 07:19:15,841 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 07:19:15,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 07:19:15,842 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 07:19:15,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 07:19:15,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:19:15,843 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 07:19:15,843 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 07:19:15,843 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 07:19:15,843 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 07:19:15,844 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 07:19:15,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 07:19:15,844 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 07:19:15,844 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 07:19:15,845 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_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/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_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac76721ba91522692e2c3e4d1ea27df0200031dd012c5066cc7280e0ae6e2244 [2022-11-19 07:19:16,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 07:19:16,209 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 07:19:16,212 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 07:19:16,214 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 07:19:16,215 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 07:19:16,216 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/verifythis/duplets.c [2022-11-19 07:19:16,312 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/data/796bea07d/4b2787e64537420fa8d8cefcc4060904/FLAG82015ef96 [2022-11-19 07:19:16,972 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 07:19:16,976 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/sv-benchmarks/c/verifythis/duplets.c [2022-11-19 07:19:16,986 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/data/796bea07d/4b2787e64537420fa8d8cefcc4060904/FLAG82015ef96 [2022-11-19 07:19:17,293 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/data/796bea07d/4b2787e64537420fa8d8cefcc4060904 [2022-11-19 07:19:17,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 07:19:17,301 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 07:19:17,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 07:19:17,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 07:19:17,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 07:19:17,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:19:17" (1/1) ... [2022-11-19 07:19:17,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@725994c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:19:17, skipping insertion in model container [2022-11-19 07:19:17,317 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:19:17" (1/1) ... [2022-11-19 07:19:17,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 07:19:17,347 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 07:19:17,563 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/sv-benchmarks/c/verifythis/duplets.c[485,498] [2022-11-19 07:19:17,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:19:17,636 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 07:19:17,652 WARN L234 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/sv-benchmarks/c/verifythis/duplets.c[485,498] [2022-11-19 07:19:17,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 07:19:17,684 INFO L208 MainTranslator]: Completed translation [2022-11-19 07:19:17,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:19:17 WrapperNode [2022-11-19 07:19:17,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 07:19:17,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 07:19:17,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 07:19:17,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 07:19:17,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:19:17" (1/1) ... [2022-11-19 07:19:17,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:19:17" (1/1) ... [2022-11-19 07:19:17,733 INFO L138 Inliner]: procedures = 21, calls = 43, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 126 [2022-11-19 07:19:17,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 07:19:17,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 07:19:17,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 07:19:17,735 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 07:19:17,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:19:17" (1/1) ... [2022-11-19 07:19:17,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:19:17" (1/1) ... [2022-11-19 07:19:17,750 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:19:17" (1/1) ... [2022-11-19 07:19:17,751 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:19:17" (1/1) ... [2022-11-19 07:19:17,758 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:19:17" (1/1) ... [2022-11-19 07:19:17,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:19:17" (1/1) ... [2022-11-19 07:19:17,764 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:19:17" (1/1) ... [2022-11-19 07:19:17,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:19:17" (1/1) ... [2022-11-19 07:19:17,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 07:19:17,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 07:19:17,770 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 07:19:17,770 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 07:19:17,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:19:17" (1/1) ... [2022-11-19 07:19:17,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 07:19:17,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:19:17,809 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 07:19:17,812 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 07:19:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 07:19:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-19 07:19:17,877 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-19 07:19:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 07:19:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 07:19:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 07:19:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-19 07:19:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 07:19:17,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 07:19:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 07:19:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-19 07:19:17,879 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-19 07:19:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 07:19:18,054 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 07:19:18,071 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 07:19:18,422 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 07:19:18,515 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 07:19:18,516 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-19 07:19:18,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:19:18 BoogieIcfgContainer [2022-11-19 07:19:18,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 07:19:18,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 07:19:18,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 07:19:18,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 07:19:18,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:19:17" (1/3) ... [2022-11-19 07:19:18,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e850f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:19:18, skipping insertion in model container [2022-11-19 07:19:18,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:19:17" (2/3) ... [2022-11-19 07:19:18,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10e850f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:19:18, skipping insertion in model container [2022-11-19 07:19:18,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:19:18" (3/3) ... [2022-11-19 07:19:18,538 INFO L112 eAbstractionObserver]: Analyzing ICFG duplets.c [2022-11-19 07:19:18,563 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 07:19:18,564 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-19 07:19:18,650 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 07:19:18,658 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;@339f80d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 07:19:18,658 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-19 07:19:18,664 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 20 states have (on average 1.45) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-19 07:19:18,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-19 07:19:18,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:18,687 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:19:18,688 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-19 07:19:18,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:18,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1183431264, now seen corresponding path program 1 times [2022-11-19 07:19:18,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:18,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773918303] [2022-11-19 07:19:18,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:18,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:19,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:19:19,169 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:19:19,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773918303] [2022-11-19 07:19:19,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773918303] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:19:19,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:19:19,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-19 07:19:19,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820478689] [2022-11-19 07:19:19,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:19:19,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 07:19:19,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:19,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 07:19:19,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:19:19,224 INFO L87 Difference]: Start difference. First operand has 38 states, 20 states have (on average 1.45) internal successors, (29), 26 states have internal predecessors, (29), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:19:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:19:19,393 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2022-11-19 07:19:19,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 07:19:19,418 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 17 [2022-11-19 07:19:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:19:19,427 INFO L225 Difference]: With dead ends: 65 [2022-11-19 07:19:19,427 INFO L226 Difference]: Without dead ends: 37 [2022-11-19 07:19:19,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 07:19:19,439 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 20 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:19:19,442 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 64 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:19:19,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-19 07:19:19,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2022-11-19 07:19:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.4375) internal successors, (23), 21 states have internal predecessors, (23), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:19:19,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-19 07:19:19,501 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2022-11-19 07:19:19,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:19:19,503 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-19 07:19:19,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:19:19,504 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-19 07:19:19,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 07:19:19,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:19,508 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:19:19,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 07:19:19,510 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-19 07:19:19,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1785803911, now seen corresponding path program 1 times [2022-11-19 07:19:19,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:19,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799665464] [2022-11-19 07:19:19,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:19,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:19,810 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:19:19,811 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:19:19,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799665464] [2022-11-19 07:19:19,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799665464] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:19:19,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:19:19,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 07:19:19,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042875637] [2022-11-19 07:19:19,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:19:19,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-19 07:19:19,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:19,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-19 07:19:19,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-19 07:19:19,825 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:19:19,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:19:19,922 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-11-19 07:19:19,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-19 07:19:19,927 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 20 [2022-11-19 07:19:19,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:19:19,930 INFO L225 Difference]: With dead ends: 37 [2022-11-19 07:19:19,930 INFO L226 Difference]: Without dead ends: 35 [2022-11-19 07:19:19,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-19 07:19:19,933 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:19:19,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 45 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:19:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-19 07:19:19,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2022-11-19 07:19:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 27 states have internal predecessors, (32), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:19:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-11-19 07:19:19,947 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2022-11-19 07:19:19,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:19:19,948 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-11-19 07:19:19,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:19:19,948 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-11-19 07:19:19,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 07:19:19,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:19,951 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:19:19,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-19 07:19:19,952 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-19 07:19:19,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:19,956 INFO L85 PathProgramCache]: Analyzing trace with hash -474743684, now seen corresponding path program 1 times [2022-11-19 07:19:19,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:19,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378600443] [2022-11-19 07:19:19,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:19,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:20,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:20,212 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:19:20,212 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:19:20,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378600443] [2022-11-19 07:19:20,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378600443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:19:20,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:19:20,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:19:20,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948589665] [2022-11-19 07:19:20,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:19:20,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:19:20,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:20,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:19:20,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:19:20,219 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:19:20,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:19:20,329 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2022-11-19 07:19:20,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 07:19:20,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 21 [2022-11-19 07:19:20,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:19:20,332 INFO L225 Difference]: With dead ends: 48 [2022-11-19 07:19:20,332 INFO L226 Difference]: Without dead ends: 47 [2022-11-19 07:19:20,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-19 07:19:20,334 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:19:20,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 81 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:19:20,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-19 07:19:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 36. [2022-11-19 07:19:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.44) internal successors, (36), 30 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:19:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-11-19 07:19:20,343 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 21 [2022-11-19 07:19:20,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:19:20,343 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-11-19 07:19:20,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:19:20,344 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-11-19 07:19:20,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-19 07:19:20,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:20,345 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:19:20,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-19 07:19:20,346 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-19 07:19:20,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:20,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1832152243, now seen corresponding path program 1 times [2022-11-19 07:19:20,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:20,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592975116] [2022-11-19 07:19:20,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:20,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:20,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:20,528 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:19:20,529 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:19:20,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592975116] [2022-11-19 07:19:20,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592975116] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:19:20,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 07:19:20,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-19 07:19:20,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572803575] [2022-11-19 07:19:20,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:19:20,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-19 07:19:20,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:20,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-19 07:19:20,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-19 07:19:20,535 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:19:20,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:19:20,632 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-11-19 07:19:20,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 07:19:20,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 22 [2022-11-19 07:19:20,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:19:20,636 INFO L225 Difference]: With dead ends: 43 [2022-11-19 07:19:20,637 INFO L226 Difference]: Without dead ends: 42 [2022-11-19 07:19:20,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-19 07:19:20,648 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:19:20,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 67 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:19:20,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-11-19 07:19:20,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2022-11-19 07:19:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.4) internal successors, (35), 30 states have internal predecessors, (35), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:19:20,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-11-19 07:19:20,657 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 22 [2022-11-19 07:19:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:19:20,657 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-11-19 07:19:20,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:19:20,658 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-11-19 07:19:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-19 07:19:20,658 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:20,659 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:19:20,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-19 07:19:20,659 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-19 07:19:20,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash -875503508, now seen corresponding path program 1 times [2022-11-19 07:19:20,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:20,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549769370] [2022-11-19 07:19:20,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:20,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:20,803 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:19:20,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:19:20,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549769370] [2022-11-19 07:19:20,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549769370] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:19:20,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1481434358] [2022-11-19 07:19:20,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:20,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:19:20,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:19:20,809 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:19:20,837 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 07:19:20,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:20,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 07:19:20,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:19:21,045 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:19:21,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:19:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:19:21,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1481434358] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:19:21,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1690046465] [2022-11-19 07:19:21,167 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2022-11-19 07:19:21,168 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:19:21,172 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:19:21,185 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:19:21,185 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:19:21,556 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 07:19:21,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 07:19:21,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:21,609 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 22 treesize of output 22 [2022-11-19 07:19:21,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-19 07:19:22,794 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:19:22,796 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:22,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-19 07:19:22,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:22,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:22,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:22,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:22,969 INFO L321 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-11-19 07:19:22,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 49 treesize of output 77 [2022-11-19 07:19:23,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:23,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:23,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:23,036 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:23,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 18 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2022-11-19 07:19:23,974 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 59 for LOIs [2022-11-19 07:19:24,001 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:19:29,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1690046465] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:19:29,213 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:19:29,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [4, 4, 4] total 20 [2022-11-19 07:19:29,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370471769] [2022-11-19 07:19:29,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:19:29,215 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-19 07:19:29,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:29,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-19 07:19:29,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-11-19 07:19:29,216 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 12 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:19:29,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:19:29,617 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2022-11-19 07:19:29,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-19 07:19:29,620 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 23 [2022-11-19 07:19:29,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:19:29,621 INFO L225 Difference]: With dead ends: 55 [2022-11-19 07:19:29,621 INFO L226 Difference]: Without dead ends: 38 [2022-11-19 07:19:29,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2022-11-19 07:19:29,623 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-19 07:19:29,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 57 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-19 07:19:29,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-19 07:19:29,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-11-19 07:19:29,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.36) internal successors, (34), 30 states have internal predecessors, (34), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:19:29,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-11-19 07:19:29,646 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 23 [2022-11-19 07:19:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:19:29,647 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-11-19 07:19:29,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:19:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-11-19 07:19:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 07:19:29,649 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:29,650 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:19:29,663 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 07:19:29,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:19:29,857 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-19 07:19:29,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:29,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1203009435, now seen corresponding path program 1 times [2022-11-19 07:19:29,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:29,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017420197] [2022-11-19 07:19:29,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:29,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:30,014 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:19:30,014 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:19:30,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017420197] [2022-11-19 07:19:30,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2017420197] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:19:30,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1256774046] [2022-11-19 07:19:30,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:30,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:19:30,016 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:19:30,017 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:19:30,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 07:19:30,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:30,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:19:30,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:19:30,192 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:19:30,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:19:30,305 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:19:30,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1256774046] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:19:30,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1581483875] [2022-11-19 07:19:30,308 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-19 07:19:30,309 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:19:30,309 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:19:30,310 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:19:30,310 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:19:30,458 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-19 07:19:30,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2022-11-19 07:19:30,536 INFO L321 Elim1Store]: treesize reduction 42, result has 40.0 percent of original size [2022-11-19 07:19:30,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2022-11-19 07:19:30,629 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 07:19:30,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 07:19:32,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:32,731 INFO L321 Elim1Store]: treesize reduction 144, result has 12.7 percent of original size [2022-11-19 07:19:32,731 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 382 treesize of output 387 [2022-11-19 07:19:32,969 INFO L321 Elim1Store]: treesize reduction 238, result has 9.8 percent of original size [2022-11-19 07:19:32,969 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 342 treesize of output 344 [2022-11-19 07:19:33,044 INFO L321 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2022-11-19 07:19:33,044 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 341 treesize of output 338 [2022-11-19 07:19:34,467 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 59 for LOIs [2022-11-19 07:19:34,485 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:19:41,881 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '910#(and (<= |ULTIMATE.start_mkdup_~a#1.offset| 0) (<= 0 |ULTIMATE.start_finddup_~_i#1.offset|) (<= 0 |ULTIMATE.start_main_~#i~2#1.base|) (<= |ULTIMATE.start_mkdup_~j~0#1| 1073741824) (= |ULTIMATE.start_#Ultimate.meminit_#sizeOfFields#1| 4) (<= |ULTIMATE.start_finddup_#in~_i#1.offset| 0) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 0 |ULTIMATE.start_finddup_#in~_i#1.offset|) (<= 0 |ULTIMATE.start_mkdup_~a#1.offset|) (<= |ULTIMATE.start_finddup_~a#1.offset| 0) (<= |ULTIMATE.start_mkdup_#in~a#1.offset| 0) (<= 0 (+ |ULTIMATE.start_mkdup_~x~0#1| 2147483648)) (<= |ULTIMATE.start_finddup_#in~n#1| 1073741824) (<= |ULTIMATE.start_finddup_~_i#1.offset| 0) (<= 1 |ULTIMATE.start_finddup_#in~n#1|) (<= |ULTIMATE.start_main_~n~0#1| 1073741824) (<= |ULTIMATE.start_finddup_~n#1| 1073741824) (not (<= |ULTIMATE.start_finddup_#t~post9#1| 2147483646)) (<= 0 |ULTIMATE.start_finddup_~a#1.offset|) (<= |ULTIMATE.start_mkdup_~i~0#1| 1073741824) (<= 0 |ULTIMATE.start_mkdup_~i~0#1|) (<= 1 |ULTIMATE.start_#Ultimate.meminit_#amountOfFields#1|) (<= |ULTIMATE.start_mkdup_~n#1| 1073741824) (<= 0 |ULTIMATE.start_mkdup_~j~0#1|) (<= 0 |ULTIMATE.start_finddup_#in~_j#1.offset|) (<= 0 |ULTIMATE.start_finddup_#in~_i#1.base|) (<= 0 |ULTIMATE.start_#Ultimate.meminit_#ptr#1.offset|) (<= 4 |ULTIMATE.start_#Ultimate.meminit_#product#1|) (<= |ULTIMATE.start_mkdup_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_mkdup_~n#1|) (<= 0 |ULTIMATE.start_finddup_~_i#1.base|) (= |ULTIMATE.start_finddup_~i~1#1| 0) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_finddup_#in~a#1.offset| 0) (= |ULTIMATE.start_finddup_~j~1#1| |ULTIMATE.start_finddup_#t~post9#1|) (= |ULTIMATE.start_main_~#j~2#1.offset| 0) (<= 0 |ULTIMATE.start_finddup_~_j#1.offset|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_mkdup_#in~a#1.offset|) (<= 0 |ULTIMATE.start_finddup_~_j#1.base|) (<= 0 |ULTIMATE.start_main_~#j~2#1.base|) (<= |ULTIMATE.start_#Ultimate.meminit_#product#1| 4294967296) (<= |ULTIMATE.start_finddup_~_j#1.offset| 0) (<= |ULTIMATE.start_#Ultimate.meminit_#amountOfFields#1| 1073741824) (<= 0 |ULTIMATE.start_finddup_#in~a#1.offset|) (<= 0 |ULTIMATE.start_finddup_#in~_j#1.base|) (<= 1 |ULTIMATE.start_finddup_~n#1|) (<= |ULTIMATE.start_mkdup_#in~n#1| 1073741824) (<= 1 |ULTIMATE.start_mkdup_#in~n#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_#Ultimate.meminit_#ptr#1.offset| 0) (<= |ULTIMATE.start_finddup_#in~_j#1.offset| 0) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~#i~2#1.offset| 0))' at error location [2022-11-19 07:19:41,881 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:19:41,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:19:41,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2022-11-19 07:19:41,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523545809] [2022-11-19 07:19:41,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:19:41,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-19 07:19:41,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:41,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-19 07:19:41,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=0, NotChecked=0, Total=870 [2022-11-19 07:19:41,885 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:19:42,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:19:42,221 INFO L93 Difference]: Finished difference Result 72 states and 82 transitions. [2022-11-19 07:19:42,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-19 07:19:42,232 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2022-11-19 07:19:42,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:19:42,234 INFO L225 Difference]: With dead ends: 72 [2022-11-19 07:19:42,234 INFO L226 Difference]: Without dead ends: 71 [2022-11-19 07:19:42,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=278, Invalid=1282, Unknown=0, NotChecked=0, Total=1560 [2022-11-19 07:19:42,237 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 125 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:19:42,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 116 Invalid, 118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:19:42,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-19 07:19:42,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 48. [2022-11-19 07:19:42,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 42 states have internal predecessors, (49), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:19:42,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2022-11-19 07:19:42,277 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 25 [2022-11-19 07:19:42,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:19:42,278 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2022-11-19 07:19:42,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 16 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:19:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2022-11-19 07:19:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-19 07:19:42,279 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:19:42,280 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:19:42,293 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 07:19:42,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:19:42,486 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-19 07:19:42,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:19:42,487 INFO L85 PathProgramCache]: Analyzing trace with hash -659220971, now seen corresponding path program 1 times [2022-11-19 07:19:42,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:19:42,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876752937] [2022-11-19 07:19:42,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:42,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:19:42,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:42,572 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-19 07:19:42,572 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:19:42,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876752937] [2022-11-19 07:19:42,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876752937] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:19:42,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407847158] [2022-11-19 07:19:42,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:19:42,574 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:19:42,574 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:19:42,575 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:19:42,597 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 07:19:42,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:19:42,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 07:19:42,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:19:42,725 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-19 07:19:42,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:19:42,790 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-19 07:19:42,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407847158] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:19:42,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1992706063] [2022-11-19 07:19:42,796 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-19 07:19:42,796 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:19:42,796 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:19:42,797 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:19:42,797 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:19:42,910 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2022-11-19 07:19:42,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 26 [2022-11-19 07:19:42,991 INFO L321 Elim1Store]: treesize reduction 42, result has 40.0 percent of original size [2022-11-19 07:19:42,991 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2022-11-19 07:19:43,077 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 07:19:43,077 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 07:19:44,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:19:44,813 INFO L321 Elim1Store]: treesize reduction 144, result has 12.7 percent of original size [2022-11-19 07:19:44,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 382 treesize of output 387 [2022-11-19 07:19:45,010 INFO L321 Elim1Store]: treesize reduction 238, result has 9.8 percent of original size [2022-11-19 07:19:45,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 19 case distinctions, treesize of input 342 treesize of output 344 [2022-11-19 07:19:45,081 INFO L321 Elim1Store]: treesize reduction 82, result has 9.9 percent of original size [2022-11-19 07:19:45,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 341 treesize of output 338 [2022-11-19 07:19:48,260 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 59 for LOIs [2022-11-19 07:19:48,277 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:19:56,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1992706063] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 07:19:56,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:19:56,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [4, 4, 4] total 25 [2022-11-19 07:19:56,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667272450] [2022-11-19 07:19:56,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 07:19:56,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-19 07:19:56,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:19:56,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-19 07:19:56,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=547, Unknown=0, NotChecked=0, Total=650 [2022-11-19 07:19:56,009 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand has 18 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:20:07,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:20:07,164 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-11-19 07:20:07,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-19 07:20:07,164 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 27 [2022-11-19 07:20:07,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:20:07,165 INFO L225 Difference]: With dead ends: 48 [2022-11-19 07:20:07,166 INFO L226 Difference]: Without dead ends: 43 [2022-11-19 07:20:07,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 18.3s TimeCoverageRelationStatistics Valid=196, Invalid=860, Unknown=0, NotChecked=0, Total=1056 [2022-11-19 07:20:07,167 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-19 07:20:07,168 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-19 07:20:07,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-19 07:20:07,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2022-11-19 07:20:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:20:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2022-11-19 07:20:07,193 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 27 [2022-11-19 07:20:07,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:20:07,193 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2022-11-19 07:20:07,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:20:07,194 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-11-19 07:20:07,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-19 07:20:07,195 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:20:07,195 INFO L195 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:20:07,201 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-19 07:20:07,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:20:07,401 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-19 07:20:07,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:20:07,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1384412559, now seen corresponding path program 1 times [2022-11-19 07:20:07,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:20:07,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458256632] [2022-11-19 07:20:07,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:20:07,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:20:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:20:07,548 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-19 07:20:07,549 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:20:07,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458256632] [2022-11-19 07:20:07,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458256632] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:20:07,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835447243] [2022-11-19 07:20:07,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:20:07,550 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:20:07,550 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:20:07,551 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:20:07,563 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 07:20:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:20:07,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-19 07:20:07,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:20:07,757 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:20:07,757 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:20:07,855 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:20:07,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835447243] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:20:07,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [418243682] [2022-11-19 07:20:07,859 INFO L159 IcfgInterpreter]: Started Sifa with 19 locations of interest [2022-11-19 07:20:07,859 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:20:07,859 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:20:07,860 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:20:07,860 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:20:07,980 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 07:20:07,980 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 07:20:08,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2022-11-19 07:20:08,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:08,019 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 22 treesize of output 22 [2022-11-19 07:20:08,640 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:20:08,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:08,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-19 07:20:08,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:08,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:08,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:08,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:08,766 INFO L321 Elim1Store]: treesize reduction 60, result has 33.3 percent of original size [2022-11-19 07:20:08,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 61 [2022-11-19 07:20:08,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:08,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:08,821 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:08,824 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:08,930 INFO L321 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-11-19 07:20:08,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 49 treesize of output 77 [2022-11-19 07:20:11,793 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 59 for LOIs [2022-11-19 07:20:11,814 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:20:21,697 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1592#(and (<= |ULTIMATE.start_mkdup_~a#1.offset| 0) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 0 |ULTIMATE.start_finddup_~_i#1.offset|) (<= 0 |ULTIMATE.start_main_~#i~2#1.base|) (= |ULTIMATE.start_#Ultimate.meminit_#sizeOfFields#1| 4) (<= |ULTIMATE.start_#Ultimate.meminit_#product#1| 8589934588) (<= |ULTIMATE.start_finddup_#in~_i#1.offset| 0) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 0 |ULTIMATE.start_finddup_#in~_i#1.offset|) (<= |ULTIMATE.start_mkdup_~j~0#1| 2147483647) (<= 0 |ULTIMATE.start_mkdup_~a#1.offset|) (<= |ULTIMATE.start_mkdup_~i~0#1| 2147483647) (<= |ULTIMATE.start_finddup_~a#1.offset| 0) (<= |ULTIMATE.start_mkdup_~n#1| 2147483647) (<= |ULTIMATE.start_mkdup_#in~a#1.offset| 0) (<= 0 (+ |ULTIMATE.start_mkdup_~x~0#1| 2147483648)) (<= |ULTIMATE.start_finddup_~_i#1.offset| 0) (<= 1 |ULTIMATE.start_finddup_#in~n#1|) (<= |ULTIMATE.start_#Ultimate.meminit_#amountOfFields#1| 2147483647) (not (<= |ULTIMATE.start_finddup_#t~post9#1| 2147483646)) (<= 0 |ULTIMATE.start_finddup_~a#1.offset|) (<= 1 |ULTIMATE.start_#Ultimate.meminit_#amountOfFields#1|) (<= 0 |ULTIMATE.start_finddup_~i~1#1|) (<= 0 |ULTIMATE.start_finddup_#in~_j#1.offset|) (<= 0 (+ |ULTIMATE.start_mkdup_~j~0#1| 2147483648)) (<= 0 |ULTIMATE.start_finddup_#in~_i#1.base|) (<= |ULTIMATE.start_mkdup_#in~n#1| 2147483647) (<= 0 |ULTIMATE.start_#Ultimate.meminit_#ptr#1.offset|) (<= 4 |ULTIMATE.start_#Ultimate.meminit_#product#1|) (<= |ULTIMATE.start_mkdup_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_mkdup_~n#1|) (<= 0 |ULTIMATE.start_finddup_~_i#1.base|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_finddup_~n#1| 2147483647) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_finddup_#in~n#1| 2147483647) (<= |ULTIMATE.start_finddup_#in~a#1.offset| 0) (= |ULTIMATE.start_finddup_~j~1#1| |ULTIMATE.start_finddup_#t~post9#1|) (= |ULTIMATE.start_main_~#j~2#1.offset| 0) (<= 0 |ULTIMATE.start_finddup_~_j#1.offset|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_mkdup_#in~a#1.offset|) (<= 0 |ULTIMATE.start_finddup_~_j#1.base|) (<= 0 |ULTIMATE.start_main_~#j~2#1.base|) (<= |ULTIMATE.start_finddup_~_j#1.offset| 0) (<= 0 (+ |ULTIMATE.start_mkdup_~i~0#1| 2147483648)) (<= 0 |ULTIMATE.start_finddup_#in~a#1.offset|) (<= 0 |ULTIMATE.start_finddup_#in~_j#1.base|) (<= 1 |ULTIMATE.start_finddup_~n#1|) (<= 1 |ULTIMATE.start_mkdup_#in~n#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_#Ultimate.meminit_#ptr#1.offset| 0) (<= |ULTIMATE.start_finddup_#in~_j#1.offset| 0) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~#i~2#1.offset| 0))' at error location [2022-11-19 07:20:21,697 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:20:21,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:20:21,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 13 [2022-11-19 07:20:21,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384227903] [2022-11-19 07:20:21,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:20:21,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-19 07:20:21,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:20:21,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-19 07:20:21,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=769, Unknown=0, NotChecked=0, Total=870 [2022-11-19 07:20:21,700 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:20:22,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:20:22,404 INFO L93 Difference]: Finished difference Result 104 states and 121 transitions. [2022-11-19 07:20:22,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-19 07:20:22,405 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2022-11-19 07:20:22,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:20:22,406 INFO L225 Difference]: With dead ends: 104 [2022-11-19 07:20:22,407 INFO L226 Difference]: Without dead ends: 73 [2022-11-19 07:20:22,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=281, Invalid=2169, Unknown=0, NotChecked=0, Total=2450 [2022-11-19 07:20:22,409 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 136 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-19 07:20:22,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 107 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-19 07:20:22,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-19 07:20:22,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 54. [2022-11-19 07:20:22,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-19 07:20:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2022-11-19 07:20:22,447 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 31 [2022-11-19 07:20:22,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:20:22,447 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2022-11-19 07:20:22,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.8461538461538463) internal successors, (37), 13 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-19 07:20:22,448 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2022-11-19 07:20:22,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 07:20:22,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 07:20:22,449 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:20:22,461 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-19 07:20:22,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-19 07:20:22,655 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 3 more)] === [2022-11-19 07:20:22,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 07:20:22,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1761509664, now seen corresponding path program 2 times [2022-11-19 07:20:22,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 07:20:22,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213848735] [2022-11-19 07:20:22,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 07:20:22,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 07:20:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 07:20:22,960 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-19 07:20:22,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 07:20:22,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213848735] [2022-11-19 07:20:22,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213848735] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 07:20:22,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201957783] [2022-11-19 07:20:22,961 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 07:20:22,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 07:20:22,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 07:20:22,962 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 07:20:22,964 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 07:20:23,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2022-11-19 07:20:23,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 07:20:23,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 07:20:23,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 07:20:23,142 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-19 07:20:23,142 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 07:20:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-19 07:20:23,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201957783] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 07:20:23,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [535364548] [2022-11-19 07:20:23,258 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-19 07:20:23,258 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 07:20:23,259 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 07:20:23,260 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 07:20:23,260 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 07:20:23,378 INFO L321 Elim1Store]: treesize reduction 42, result has 40.0 percent of original size [2022-11-19 07:20:23,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2022-11-19 07:20:23,459 INFO L321 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2022-11-19 07:20:23,460 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 32 treesize of output 53 [2022-11-19 07:20:23,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:23,480 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 22 treesize of output 22 [2022-11-19 07:20:23,991 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 07:20:23,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:23,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2022-11-19 07:20:24,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:24,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:24,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:24,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:24,136 INFO L321 Elim1Store]: treesize reduction 98, result has 24.6 percent of original size [2022-11-19 07:20:24,137 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 16 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 49 treesize of output 77 [2022-11-19 07:20:24,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:24,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:24,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:24,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 07:20:24,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 18 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 47 [2022-11-19 07:20:25,432 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 59 for LOIs [2022-11-19 07:20:25,454 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 07:20:32,927 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2087#(and (<= |ULTIMATE.start_mkdup_~a#1.offset| 0) (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (<= 0 |ULTIMATE.start_finddup_~_i#1.offset|) (<= 0 |ULTIMATE.start_main_~#i~2#1.base|) (= |ULTIMATE.start_#Ultimate.meminit_#sizeOfFields#1| 4) (<= |ULTIMATE.start_#Ultimate.meminit_#product#1| 8589934588) (<= |ULTIMATE.start_finddup_#in~_i#1.offset| 0) (<= 0 |ULTIMATE.start_main_~a~0#1.offset|) (<= 0 |ULTIMATE.start_finddup_#in~_i#1.offset|) (<= |ULTIMATE.start_mkdup_~j~0#1| 2147483647) (<= 0 |ULTIMATE.start_mkdup_~a#1.offset|) (<= |ULTIMATE.start_mkdup_~i~0#1| 2147483647) (<= |ULTIMATE.start_finddup_~a#1.offset| 0) (<= |ULTIMATE.start_mkdup_~n#1| 2147483647) (<= |ULTIMATE.start_mkdup_#in~a#1.offset| 0) (<= 0 (+ |ULTIMATE.start_mkdup_~x~0#1| 2147483648)) (<= |ULTIMATE.start_finddup_~_i#1.offset| 0) (<= 1 |ULTIMATE.start_finddup_#in~n#1|) (<= |ULTIMATE.start_#Ultimate.meminit_#amountOfFields#1| 2147483647) (not (<= |ULTIMATE.start_finddup_#t~post9#1| 2147483646)) (<= 0 |ULTIMATE.start_finddup_~a#1.offset|) (<= 1 |ULTIMATE.start_#Ultimate.meminit_#amountOfFields#1|) (<= 0 |ULTIMATE.start_finddup_#in~_j#1.offset|) (<= 0 (+ |ULTIMATE.start_mkdup_~j~0#1| 2147483648)) (<= 0 |ULTIMATE.start_finddup_#in~_i#1.base|) (<= |ULTIMATE.start_mkdup_#in~n#1| 2147483647) (<= 0 |ULTIMATE.start_#Ultimate.meminit_#ptr#1.offset|) (<= 4 |ULTIMATE.start_#Ultimate.meminit_#product#1|) (<= |ULTIMATE.start_mkdup_~x~0#1| 2147483647) (<= 1 |ULTIMATE.start_mkdup_~n#1|) (<= 0 |ULTIMATE.start_finddup_~_i#1.base|) (= |ULTIMATE.start_finddup_~i~1#1| 0) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (<= |ULTIMATE.start_finddup_~n#1| 2147483647) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_finddup_#in~n#1| 2147483647) (<= |ULTIMATE.start_finddup_#in~a#1.offset| 0) (= |ULTIMATE.start_finddup_~j~1#1| |ULTIMATE.start_finddup_#t~post9#1|) (= |ULTIMATE.start_main_~#j~2#1.offset| 0) (<= 0 |ULTIMATE.start_finddup_~_j#1.offset|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_mkdup_#in~a#1.offset|) (<= 0 |ULTIMATE.start_finddup_~_j#1.base|) (<= 0 |ULTIMATE.start_main_~#j~2#1.base|) (<= |ULTIMATE.start_finddup_~_j#1.offset| 0) (<= 0 (+ |ULTIMATE.start_mkdup_~i~0#1| 2147483648)) (<= 0 |ULTIMATE.start_finddup_#in~a#1.offset|) (<= 0 |ULTIMATE.start_finddup_#in~_j#1.base|) (<= 1 |ULTIMATE.start_finddup_~n#1|) (<= 1 |ULTIMATE.start_mkdup_#in~n#1|) (<= 0 |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_#Ultimate.meminit_#ptr#1.offset| 0) (<= |ULTIMATE.start_finddup_#in~_j#1.offset| 0) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~#i~2#1.offset| 0))' at error location [2022-11-19 07:20:32,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 07:20:32,927 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 07:20:32,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 5, 5] total 17 [2022-11-19 07:20:32,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418890013] [2022-11-19 07:20:32,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 07:20:32,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-19 07:20:32,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 07:20:32,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-19 07:20:32,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2022-11-19 07:20:32,930 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 18 states have internal predecessors, (39), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 07:20:33,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 07:20:33,522 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2022-11-19 07:20:33,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-19 07:20:33,523 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 18 states have internal predecessors, (39), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 37 [2022-11-19 07:20:33,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 07:20:33,523 INFO L225 Difference]: With dead ends: 74 [2022-11-19 07:20:33,523 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 07:20:33,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 87 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 840 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=452, Invalid=1900, Unknown=0, NotChecked=0, Total=2352 [2022-11-19 07:20:33,525 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 159 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-19 07:20:33,526 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 82 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-19 07:20:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 07:20:33,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 07:20:33,527 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-11-19 07:20:33,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 07:20:33,527 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2022-11-19 07:20:33,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 07:20:33,528 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 07:20:33,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 18 states have internal predecessors, (39), 2 states have call successors, (8), 1 states have call predecessors, (8), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-19 07:20:33,528 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 07:20:33,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 07:20:33,532 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 6 remaining) [2022-11-19 07:20:33,532 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 6 remaining) [2022-11-19 07:20:33,533 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 6 remaining) [2022-11-19 07:20:33,533 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 6 remaining) [2022-11-19 07:20:33,533 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 6 remaining) [2022-11-19 07:20:33,534 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 6 remaining) [2022-11-19 07:20:33,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 07:20:33,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-19 07:20:33,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 07:20:40,036 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-19 07:20:40,036 INFO L902 garLoopResultBuilder]: At program point L60-2(line 60) the Hoare annotation is: true [2022-11-19 07:20:40,037 INFO L899 garLoopResultBuilder]: For program point L60-3(line 60) no Hoare annotation was computed. [2022-11-19 07:20:40,037 INFO L895 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_mkdup_#in~a#1.base|) (= (select |#length| 3) 12) (= |ULTIMATE.start_#Ultimate.meminit_#sizeOfFields#1| 4) (<= |ULTIMATE.start_mkdup_~j~0#1| 2147483647) (<= |ULTIMATE.start_mkdup_~i~0#1| 2147483647) (= |ULTIMATE.start_mkdup_#in~n#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= |ULTIMATE.start_#Ultimate.meminit_#product#1| (* |ULTIMATE.start_main_~n~0#1| 4)) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (not (= 3 |ULTIMATE.start_main_#t~malloc13#1.base|)) (<= 0 (+ |ULTIMATE.start_mkdup_~j~0#1| 2147483648)) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_#Ultimate.meminit_#amountOfFields#1|) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_#t~malloc13#1.offset|) (= (select |#valid| |ULTIMATE.start_main_#t~malloc13#1.base|) 1) (not (= (ite (and (< |ULTIMATE.start_main_~n~0#1| 1073741824) (<= 0 |ULTIMATE.start_main_~n~0#1|)) 1 0) 0)) (= |ULTIMATE.start_main_#t~malloc13#1.offset| |ULTIMATE.start_#Ultimate.meminit_#ptr#1.offset|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (= (select |#valid| 1) 1) (= |ULTIMATE.start_mkdup_#in~n#1| |ULTIMATE.start_mkdup_~n#1|) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_mkdup_#in~a#1.offset|) (= (select |#valid| 0) 0) (= |ULTIMATE.start_#Ultimate.meminit_#ptr#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= (* (mod |ULTIMATE.start_main_~n~0#1| 1073741824) 4) (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|)) (<= 0 (+ |ULTIMATE.start_mkdup_~i~0#1| 2147483648)) (= |ULTIMATE.start_mkdup_~a#1.base| |ULTIMATE.start_mkdup_#in~a#1.base|) (= |ULTIMATE.start_mkdup_~a#1.offset| |ULTIMATE.start_mkdup_#in~a#1.offset|) (= 10 (select |#length| 2)) (= (select .cse0 1) 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_#Ultimate.meminit_#ptr#1.base|)) (< |ULTIMATE.start_main_#t~malloc13#1.base| |#StackHeapBarrier|) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-19 07:20:40,038 INFO L895 garLoopResultBuilder]: At program point L23-1(line 23) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_mkdup_#in~a#1.base|) (= (select |#length| 3) 12) (= |ULTIMATE.start_#Ultimate.meminit_#sizeOfFields#1| 4) (<= |ULTIMATE.start_mkdup_~j~0#1| 2147483647) (= |ULTIMATE.start_mkdup_#in~n#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= |ULTIMATE.start_#Ultimate.meminit_#product#1| (* |ULTIMATE.start_main_~n~0#1| 4)) (= 2 (select |#length| 1)) (not (= (ite (and (< |ULTIMATE.start_mkdup_~i~0#1| |ULTIMATE.start_mkdup_~n#1|) (<= 0 |ULTIMATE.start_mkdup_~i~0#1|)) 1 0) 0)) (= (select |#valid| 3) 1) (not (= 3 |ULTIMATE.start_main_#t~malloc13#1.base|)) (<= 0 (+ |ULTIMATE.start_mkdup_~j~0#1| 2147483648)) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_#Ultimate.meminit_#amountOfFields#1|) (= (select |#valid| |ULTIMATE.start_main_#t~malloc13#1.base|) 1) (not (= (ite (and (< |ULTIMATE.start_main_~n~0#1| 1073741824) (<= 0 |ULTIMATE.start_main_~n~0#1|)) 1 0) 0)) (= |ULTIMATE.start_main_#t~malloc13#1.offset| |ULTIMATE.start_#Ultimate.meminit_#ptr#1.offset|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (= (select |#valid| 1) 1) (= |ULTIMATE.start_mkdup_#in~n#1| |ULTIMATE.start_mkdup_~n#1|) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_mkdup_#in~a#1.offset|) (= (select |#valid| 0) 0) (= |ULTIMATE.start_#Ultimate.meminit_#ptr#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_mkdup_#in~a#1.offset|) (= (select .cse0 0) 48) (= (* (mod |ULTIMATE.start_main_~n~0#1| 1073741824) 4) (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|)) (= |ULTIMATE.start_mkdup_~a#1.base| |ULTIMATE.start_mkdup_#in~a#1.base|) (= |ULTIMATE.start_mkdup_~a#1.offset| |ULTIMATE.start_mkdup_#in~a#1.offset|) (= 10 (select |#length| 2)) (= (select .cse0 1) 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_#Ultimate.meminit_#ptr#1.base|)) (< |ULTIMATE.start_main_#t~malloc13#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-19 07:20:40,038 INFO L899 garLoopResultBuilder]: For program point L36-3(line 36) no Hoare annotation was computed. [2022-11-19 07:20:40,038 INFO L899 garLoopResultBuilder]: For program point L36-4(line 36) no Hoare annotation was computed. [2022-11-19 07:20:40,038 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-19 07:20:40,040 INFO L895 garLoopResultBuilder]: At program point L36-5(lines 36 44) the Hoare annotation is: (let ((.cse58 (select |#memory_int| 1))) (let ((.cse0 (= (select |#length| 3) 12)) (.cse3 (= 2 (select |#length| 1))) (.cse5 (= (select |#valid| 3) 1)) (.cse10 (not (= (ite (and (< |ULTIMATE.start_main_~n~0#1| 1073741824) (<= 0 |ULTIMATE.start_main_~n~0#1|)) 1 0) 0))) (.cse11 (= (select |#valid| 1) 1)) (.cse12 (= (select |#valid| 0) 0)) (.cse14 (= (select |#valid| 2) 1)) (.cse17 (= (select .cse58 0) 48)) (.cse1 (<= 4 |ULTIMATE.start_#Ultimate.meminit_#sizeOfFields#1|)) (.cse2 (<= 0 (+ |ULTIMATE.start_mkdup_~x~0#1| 2147483648))) (.cse4 (<= 0 |ULTIMATE.start_mkdup_~i~0#1|)) (.cse7 (<= 0 |ULTIMATE.start_mkdup_~j~0#1|)) (.cse6 (<= 0 |ULTIMATE.start_finddup_#in~_j#1.offset|)) (.cse8 (<= |ULTIMATE.start_mkdup_~x~0#1| 2147483647)) (.cse9 (<= |ULTIMATE.start_#Ultimate.meminit_#sizeOfFields#1| 4)) (.cse13 (<= 0 |ULTIMATE.start_finddup_~_j#1.offset|)) (.cse15 (<= 0 |ULTIMATE.start_mkdup_#in~a#1.offset|)) (.cse16 (<= |ULTIMATE.start_finddup_~_j#1.offset| 0)) (.cse18 (= 10 (select |#length| 2))) (.cse19 (= (select .cse58 1) 0)) (.cse20 (<= |ULTIMATE.start_main_~a~0#1.offset| 0)) (.cse21 (<= |ULTIMATE.start_finddup_#in~_j#1.offset| 0)) (.cse22 (< 0 |#StackHeapBarrier|)) (.cse23 (= |#NULL.base| 0)) (.cse24 (= |ULTIMATE.start_main_~#i~2#1.offset| 0))) (or (and (= |ULTIMATE.start_main_~#j~2#1.base| |ULTIMATE.start_finddup_#in~_j#1.base|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_mkdup_#in~a#1.base|) .cse0 (= (select |#valid| |ULTIMATE.start_main_~#j~2#1.base|) 1) .cse1 (= |ULTIMATE.start_finddup_#in~a#1.base| |ULTIMATE.start_main_~a~0#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#i~2#1.base|) .cse2 (= |ULTIMATE.start_mkdup_#in~n#1| |ULTIMATE.start_main_~n~0#1|) (= (select |#length| |ULTIMATE.start_main_~#i~2#1.base|) 4) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= |ULTIMATE.start_finddup_~_j#1.base| |ULTIMATE.start_finddup_#in~_j#1.base|) (< |#StackHeapBarrier| |ULTIMATE.start_main_~#j~2#1.base|) (= |ULTIMATE.start_#Ultimate.meminit_#product#1| (* |ULTIMATE.start_main_~n~0#1| 4)) (= |ULTIMATE.start_finddup_~_i#1.base| |ULTIMATE.start_finddup_#in~_i#1.base|) (= |ULTIMATE.start_main_~#i~2#1.base| |ULTIMATE.start_finddup_#in~_i#1.base|) (= |ULTIMATE.start_finddup_#in~a#1.base| |ULTIMATE.start_finddup_~a#1.base|) (= (select |#length| |ULTIMATE.start_main_~#j~2#1.base|) 4) (= (select |#valid| |ULTIMATE.start_main_~#i~2#1.base|) 1) .cse3 (not (= (ite (and (< |ULTIMATE.start_mkdup_~i~0#1| |ULTIMATE.start_mkdup_~n#1|) .cse4) 1 0) 0)) (= |ULTIMATE.start_finddup_#in~a#1.offset| |ULTIMATE.start_finddup_~a#1.offset|) .cse5 (not (= 3 |ULTIMATE.start_main_#t~malloc13#1.base|)) .cse6 (not (= (ite (and (< |ULTIMATE.start_mkdup_~j~0#1| |ULTIMATE.start_mkdup_~n#1|) .cse7) 1 0) 0)) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_#Ultimate.meminit_#amountOfFields#1|) .cse8 (= (select |#valid| |ULTIMATE.start_main_#t~malloc13#1.base|) 1) (not (= |ULTIMATE.start_main_~#j~2#1.base| |ULTIMATE.start_main_~#i~2#1.base|)) .cse9 (= |ULTIMATE.start_main_~#i~2#1.offset| |ULTIMATE.start_finddup_#in~_i#1.offset|) (not (= (ite (not (= |ULTIMATE.start_mkdup_~i~0#1| |ULTIMATE.start_mkdup_~j~0#1|)) 1 0) 0)) .cse10 (= |ULTIMATE.start_main_#t~malloc13#1.offset| |ULTIMATE.start_#Ultimate.meminit_#ptr#1.offset|) (= |ULTIMATE.start_finddup_~i~1#1| 0) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) .cse11 (= |ULTIMATE.start_mkdup_#in~n#1| |ULTIMATE.start_mkdup_~n#1|) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_mkdup_#in~a#1.offset|) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_finddup_#in~a#1.offset|) .cse12 (= |ULTIMATE.start_main_~#j~2#1.offset| 0) (= |ULTIMATE.start_#Ultimate.meminit_#ptr#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= |ULTIMATE.start_finddup_#in~_i#1.offset| |ULTIMATE.start_finddup_~_i#1.offset|) .cse13 .cse14 (= |#NULL.offset| 0) .cse15 .cse16 .cse17 (= (* (mod |ULTIMATE.start_main_~n~0#1| 1073741824) 4) (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|)) (= |ULTIMATE.start_finddup_~n#1| |ULTIMATE.start_finddup_#in~n#1|) (= |ULTIMATE.start_mkdup_~a#1.base| |ULTIMATE.start_mkdup_#in~a#1.base|) (= |ULTIMATE.start_mkdup_~a#1.offset| |ULTIMATE.start_mkdup_#in~a#1.offset|) .cse18 .cse19 (< |ULTIMATE.start_main_#t~malloc13#1.base| |#StackHeapBarrier|) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_finddup_#in~n#1|) .cse20 .cse21 .cse22 .cse23 .cse24 (= (select |#memory_int| |ULTIMATE.start_#Ultimate.meminit_#ptr#1.base|) (store (store ((as const (Array Int Int)) 0) (+ |ULTIMATE.start_mkdup_~a#1.offset| (* |ULTIMATE.start_mkdup_~i~0#1| 4)) |ULTIMATE.start_mkdup_~x~0#1|) (+ |ULTIMATE.start_mkdup_~a#1.offset| (* |ULTIMATE.start_mkdup_~j~0#1| 4)) |ULTIMATE.start_mkdup_~x~0#1|))) (and .cse0 (<= 1 |ULTIMATE.start_finddup_#in~n#1|) (<= |ULTIMATE.start_finddup_~j~1#1| 2147483647) .cse3 (<= 1 |ULTIMATE.start_#Ultimate.meminit_#amountOfFields#1|) .cse5 (<= 4 |ULTIMATE.start_#Ultimate.meminit_#product#1|) .cse10 (<= 1 |ULTIMATE.start_mkdup_~n#1|) .cse11 (<= 1 |ULTIMATE.start_main_~n~0#1|) .cse12 .cse14 .cse17 (let ((.cse25 (<= |ULTIMATE.start_mkdup_~a#1.offset| 0)) (.cse26 (<= 0 |ULTIMATE.start_finddup_~_i#1.offset|)) (.cse27 (<= 0 |ULTIMATE.start_main_~#i~2#1.base|)) (.cse28 (<= |ULTIMATE.start_mkdup_~j~0#1| 1073741824)) (.cse29 (<= |ULTIMATE.start_finddup_#in~_i#1.offset| 0)) (.cse30 (<= 0 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse31 (<= 0 |ULTIMATE.start_finddup_#in~_i#1.offset|)) (.cse32 (<= 0 |ULTIMATE.start_mkdup_~a#1.offset|)) (.cse33 (<= |ULTIMATE.start_finddup_~a#1.offset| 0)) (.cse34 (<= |ULTIMATE.start_mkdup_#in~a#1.offset| 0)) (.cse35 (<= |ULTIMATE.start_finddup_#in~n#1| 1073741824)) (.cse36 (<= |ULTIMATE.start_finddup_~_i#1.offset| 0)) (.cse37 (<= |ULTIMATE.start_main_~#j~2#1.offset| 0)) (.cse38 (<= |ULTIMATE.start_finddup_~n#1| 1073741824)) (.cse39 (<= 0 |ULTIMATE.start_finddup_~a#1.offset|)) (.cse40 (<= |ULTIMATE.start_mkdup_~i~0#1| 1073741824)) (.cse41 (<= |ULTIMATE.start_mkdup_~n#1| 1073741824)) (.cse42 (<= 0 |ULTIMATE.start_main_#t~malloc13#1.offset|)) (.cse43 (<= |#NULL.offset| 0)) (.cse44 (<= 0 |ULTIMATE.start_finddup_#in~_i#1.base|)) (.cse45 (<= 0 |ULTIMATE.start_#Ultimate.meminit_#ptr#1.offset|)) (.cse46 (<= 0 |ULTIMATE.start_main_~#j~2#1.offset|)) (.cse47 (<= 0 |ULTIMATE.start_finddup_~_i#1.base|)) (.cse48 (<= |ULTIMATE.start_finddup_#in~a#1.offset| 0)) (.cse49 (<= |ULTIMATE.start_main_#t~malloc13#1.offset| 0)) (.cse50 (<= 0 |ULTIMATE.start_finddup_~_j#1.base|)) (.cse51 (<= 0 |ULTIMATE.start_main_~#j~2#1.base|)) (.cse52 (<= |ULTIMATE.start_#Ultimate.meminit_#product#1| 4294967296)) (.cse53 (<= |ULTIMATE.start_#Ultimate.meminit_#amountOfFields#1| 1073741824)) (.cse54 (<= 0 |ULTIMATE.start_finddup_#in~a#1.offset|)) (.cse55 (<= 0 |ULTIMATE.start_finddup_#in~_j#1.base|)) (.cse56 (<= |ULTIMATE.start_mkdup_#in~n#1| 1073741824)) (.cse57 (<= 0 |#NULL.offset|))) (or (and .cse25 (<= 2 |ULTIMATE.start_finddup_~j~1#1|) .cse26 .cse27 .cse28 (<= |ULTIMATE.start_finddup_~i~1#1| 2147483647) .cse1 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse2 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse4 .cse41 .cse7 .cse42 .cse43 .cse6 .cse44 .cse45 .cse46 .cse8 .cse9 .cse47 .cse48 .cse13 .cse49 .cse15 .cse50 .cse51 .cse52 .cse16 .cse53 .cse54 .cse55 .cse56 .cse57 (<= 1 |ULTIMATE.start_finddup_~i~1#1|)) (and .cse25 .cse26 .cse27 .cse28 .cse1 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse2 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse4 .cse41 (<= 0 |ULTIMATE.start_finddup_~i~1#1|) .cse7 .cse42 .cse43 .cse6 .cse44 .cse45 .cse46 .cse8 .cse9 .cse47 (<= |ULTIMATE.start_finddup_~i~1#1| 0) .cse48 .cse13 .cse49 .cse15 .cse50 .cse51 .cse52 .cse16 .cse53 .cse54 .cse55 .cse56 .cse57))) .cse18 (<= |ULTIMATE.start_finddup_~n#1| |ULTIMATE.start_finddup_~j~1#1|) (<= 1 |ULTIMATE.start_finddup_~n#1|) (<= 1 |ULTIMATE.start_mkdup_#in~n#1|) .cse19 .cse20 (<= |ULTIMATE.start_#Ultimate.meminit_#ptr#1.offset| 0) .cse21 .cse22 .cse23 .cse24)))) [2022-11-19 07:20:40,040 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 07:20:40,041 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2022-11-19 07:20:40,041 INFO L902 garLoopResultBuilder]: At program point L61-2(line 61) the Hoare annotation is: true [2022-11-19 07:20:40,041 INFO L899 garLoopResultBuilder]: For program point L61-3(line 61) no Hoare annotation was computed. [2022-11-19 07:20:40,041 INFO L895 garLoopResultBuilder]: At program point L24(line 24) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_mkdup_#in~a#1.base|) (= (select |#length| 3) 12) (= |ULTIMATE.start_#Ultimate.meminit_#sizeOfFields#1| 4) (= |ULTIMATE.start_mkdup_#in~n#1| |ULTIMATE.start_main_~n~0#1|) (= |ULTIMATE.start_main_~a~0#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= |ULTIMATE.start_#Ultimate.meminit_#product#1| (* |ULTIMATE.start_main_~n~0#1| 4)) (= 2 (select |#length| 1)) (not (= (ite (and (< |ULTIMATE.start_mkdup_~i~0#1| |ULTIMATE.start_mkdup_~n#1|) (<= 0 |ULTIMATE.start_mkdup_~i~0#1|)) 1 0) 0)) (= (select |#valid| 3) 1) (not (= 3 |ULTIMATE.start_main_#t~malloc13#1.base|)) (not (= (ite (and (< |ULTIMATE.start_mkdup_~j~0#1| |ULTIMATE.start_mkdup_~n#1|) (<= 0 |ULTIMATE.start_mkdup_~j~0#1|)) 1 0) 0)) (= |ULTIMATE.start_main_~n~0#1| |ULTIMATE.start_#Ultimate.meminit_#amountOfFields#1|) (= (select |#valid| |ULTIMATE.start_main_#t~malloc13#1.base|) 1) (not (= (ite (and (< |ULTIMATE.start_main_~n~0#1| 1073741824) (<= 0 |ULTIMATE.start_main_~n~0#1|)) 1 0) 0)) (= |ULTIMATE.start_main_#t~malloc13#1.offset| |ULTIMATE.start_#Ultimate.meminit_#ptr#1.offset|) (= |ULTIMATE.start_main_#t~malloc13#1.offset| 0) (= (select |#valid| 1) 1) (= |ULTIMATE.start_mkdup_#in~n#1| |ULTIMATE.start_mkdup_~n#1|) (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_mkdup_#in~a#1.offset|) (= (select |#valid| 0) 0) (= |ULTIMATE.start_#Ultimate.meminit_#ptr#1.base| |ULTIMATE.start_main_#t~malloc13#1.base|) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_mkdup_#in~a#1.offset|) (= (select .cse0 0) 48) (= (* (mod |ULTIMATE.start_main_~n~0#1| 1073741824) 4) (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|)) (= |ULTIMATE.start_mkdup_~a#1.base| |ULTIMATE.start_mkdup_#in~a#1.base|) (= |ULTIMATE.start_mkdup_~a#1.offset| |ULTIMATE.start_mkdup_#in~a#1.offset|) (= 10 (select |#length| 2)) (= (select .cse0 1) 0) (= ((as const (Array Int Int)) 0) (select |#memory_int| |ULTIMATE.start_#Ultimate.meminit_#ptr#1.base|)) (< |ULTIMATE.start_main_#t~malloc13#1.base| |#StackHeapBarrier|) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0))) [2022-11-19 07:20:40,042 INFO L902 garLoopResultBuilder]: At program point L45(lines 33 46) the Hoare annotation is: true [2022-11-19 07:20:40,042 INFO L899 garLoopResultBuilder]: For program point L37(line 37) no Hoare annotation was computed. [2022-11-19 07:20:40,042 INFO L899 garLoopResultBuilder]: For program point L37-1(line 37) no Hoare annotation was computed. [2022-11-19 07:20:40,042 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-19 07:20:40,042 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 07:20:40,043 INFO L899 garLoopResultBuilder]: For program point L37-5(line 37) no Hoare annotation was computed. [2022-11-19 07:20:40,043 INFO L899 garLoopResultBuilder]: For program point L37-6(line 37) no Hoare annotation was computed. [2022-11-19 07:20:40,044 INFO L895 garLoopResultBuilder]: At program point L37-7(lines 37 43) the Hoare annotation is: (let ((.cse28 (select |#memory_int| 1))) (and (< |ULTIMATE.start_finddup_~i~1#1| |ULTIMATE.start_finddup_~n#1|) (= (select |#length| 3) 12) (<= 1 |ULTIMATE.start_finddup_#in~n#1|) (<= |ULTIMATE.start_finddup_~j~1#1| 2147483647) (= 2 (select |#length| 1)) (<= 1 |ULTIMATE.start_#Ultimate.meminit_#amountOfFields#1|) (= (select |#valid| 3) 1) (<= 1 |ULTIMATE.start_finddup_~j~1#1|) (<= 4 |ULTIMATE.start_#Ultimate.meminit_#product#1|) (not (= (ite (and (< |ULTIMATE.start_main_~n~0#1| 1073741824) (<= 0 |ULTIMATE.start_main_~n~0#1|)) 1 0) 0)) (let ((.cse0 (<= |ULTIMATE.start_mkdup_~a#1.offset| 0)) (.cse1 (<= 0 |ULTIMATE.start_finddup_~_i#1.offset|)) (.cse2 (<= 0 |ULTIMATE.start_main_~#i~2#1.base|)) (.cse3 (<= |ULTIMATE.start_mkdup_~j~0#1| 1073741824)) (.cse4 (<= 4 |ULTIMATE.start_#Ultimate.meminit_#sizeOfFields#1|)) (.cse5 (<= |ULTIMATE.start_finddup_#in~_i#1.offset| 0)) (.cse6 (<= 0 |ULTIMATE.start_main_~a~0#1.offset|)) (.cse7 (<= 0 |ULTIMATE.start_finddup_#in~_i#1.offset|)) (.cse8 (<= 0 |ULTIMATE.start_mkdup_~a#1.offset|)) (.cse9 (<= |ULTIMATE.start_finddup_~a#1.offset| 0)) (.cse10 (<= |ULTIMATE.start_mkdup_#in~a#1.offset| 0)) (.cse11 (<= 0 (+ |ULTIMATE.start_mkdup_~x~0#1| 2147483648))) (.cse12 (<= |ULTIMATE.start_finddup_#in~n#1| 1073741824)) (.cse13 (<= |ULTIMATE.start_finddup_~_i#1.offset| 0)) (.cse14 (<= |ULTIMATE.start_finddup_~n#1| 1073741824)) (.cse15 (<= 0 |ULTIMATE.start_finddup_~a#1.offset|)) (.cse16 (<= |ULTIMATE.start_mkdup_~i~0#1| 1073741824)) (.cse17 (<= 0 |ULTIMATE.start_mkdup_~i~0#1|)) (.cse18 (<= |ULTIMATE.start_mkdup_~n#1| 1073741824)) (.cse19 (<= 0 |ULTIMATE.start_mkdup_~j~0#1|)) (.cse20 (<= 0 |ULTIMATE.start_main_#t~malloc13#1.offset|)) (.cse21 (<= 0 |ULTIMATE.start_finddup_#in~_j#1.offset|)) (.cse22 (<= 0 |ULTIMATE.start_finddup_#in~_i#1.base|)) (.cse23 (<= 0 |ULTIMATE.start_#Ultimate.meminit_#ptr#1.offset|)) (.cse24 (<= |ULTIMATE.start_mkdup_~x~0#1| 2147483647)) (.cse25 (<= |ULTIMATE.start_#Ultimate.meminit_#sizeOfFields#1| 4)) (.cse26 (<= 0 |ULTIMATE.start_finddup_~_i#1.base|)) (.cse27 (<= |ULTIMATE.start_main_#t~malloc13#1.offset| 0))) (or (and .cse0 (<= 2 |ULTIMATE.start_finddup_~j~1#1|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 (<= 1 |ULTIMATE.start_finddup_~i~1#1|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 0 |ULTIMATE.start_finddup_~i~1#1|) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (<= |ULTIMATE.start_finddup_~i~1#1| 0) .cse27))) (<= 1 |ULTIMATE.start_mkdup_~n#1|) (= (select |#valid| 1) 1) (<= 1 |ULTIMATE.start_main_~n~0#1|) (<= |ULTIMATE.start_finddup_#in~a#1.offset| 0) (= (select |#valid| 0) 0) (= |ULTIMATE.start_main_~#j~2#1.offset| 0) (<= 0 |ULTIMATE.start_finddup_~_j#1.offset|) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_mkdup_#in~a#1.offset|) (<= 0 |ULTIMATE.start_finddup_~_j#1.base|) (<= 0 |ULTIMATE.start_main_~#j~2#1.base|) (<= |ULTIMATE.start_#Ultimate.meminit_#product#1| 4294967296) (<= |ULTIMATE.start_finddup_~_j#1.offset| 0) (= (select .cse28 0) 48) (<= |ULTIMATE.start_#Ultimate.meminit_#amountOfFields#1| 1073741824) (<= 0 |ULTIMATE.start_finddup_#in~a#1.offset|) (<= 0 |ULTIMATE.start_finddup_#in~_j#1.base|) (= 10 (select |#length| 2)) (<= |ULTIMATE.start_mkdup_#in~n#1| 1073741824) (<= 1 |ULTIMATE.start_mkdup_#in~n#1|) (= (select .cse28 1) 0) (<= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= |ULTIMATE.start_#Ultimate.meminit_#ptr#1.offset| 0) (<= |ULTIMATE.start_finddup_#in~_j#1.offset| 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= |ULTIMATE.start_main_~#i~2#1.offset| 0))) [2022-11-19 07:20:40,044 INFO L902 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: true [2022-11-19 07:20:40,044 INFO L899 garLoopResultBuilder]: For program point L62-1(line 62) no Hoare annotation was computed. [2022-11-19 07:20:40,044 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 36) no Hoare annotation was computed. [2022-11-19 07:20:40,044 INFO L899 garLoopResultBuilder]: For program point L25(line 25) no Hoare annotation was computed. [2022-11-19 07:20:40,044 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 42) no Hoare annotation was computed. [2022-11-19 07:20:40,044 INFO L902 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: true [2022-11-19 07:20:40,045 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 37) no Hoare annotation was computed. [2022-11-19 07:20:40,045 INFO L902 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: true [2022-11-19 07:20:40,045 INFO L902 garLoopResultBuilder]: At program point L59(line 59) the Hoare annotation is: true [2022-11-19 07:20:40,045 INFO L899 garLoopResultBuilder]: For program point L59-1(line 59) no Hoare annotation was computed. [2022-11-19 07:20:40,045 INFO L895 garLoopResultBuilder]: At program point L51(line 51) the Hoare annotation is: (let ((.cse0 (select |#memory_int| 1))) (and (<= |ULTIMATE.start_main_~n~0#1| 2147483647) (= (select |#length| 3) 12) (= 2 (select |#length| 1)) (= (select |#valid| 3) 1) (= (select |#valid| 1) 1) (= (select |#valid| 0) 0) (= (select |#valid| 2) 1) (= |#NULL.offset| 0) (= (select .cse0 0) 48) (= 10 (select |#length| 2)) (= (select .cse0 1) 0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (<= 0 (+ |ULTIMATE.start_main_~n~0#1| 2147483648)))) [2022-11-19 07:20:40,045 INFO L899 garLoopResultBuilder]: For program point L51-1(line 51) no Hoare annotation was computed. [2022-11-19 07:20:40,046 INFO L902 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 15 17) the Hoare annotation is: true [2022-11-19 07:20:40,046 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 15 17) no Hoare annotation was computed. [2022-11-19 07:20:40,046 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 9 11) the Hoare annotation is: true [2022-11-19 07:20:40,046 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 11) no Hoare annotation was computed. [2022-11-19 07:20:40,050 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 07:20:40,053 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 07:20:40,067 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-19 07:20:40,069 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-19 07:20:40,070 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-19 07:20:40,079 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-19 07:20:40,080 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-19 07:20:40,081 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-19 07:20:40,087 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:265) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:347) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translateStore(Term2Expression.java:347) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:173) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:137) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:401) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:455) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-11-19 07:20:40,115 INFO L158 Benchmark]: Toolchain (without parser) took 82814.70ms. Allocated memory was 115.3MB in the beginning and 343.9MB in the end (delta: 228.6MB). Free memory was 78.5MB in the beginning and 222.9MB in the end (delta: -144.4MB). Peak memory consumption was 196.0MB. Max. memory is 16.1GB. [2022-11-19 07:20:40,116 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 115.3MB. Free memory was 85.8MB in the beginning and 85.8MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:20:40,116 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.16ms. Allocated memory is still 115.3MB. Free memory was 78.3MB in the beginning and 88.6MB in the end (delta: -10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 07:20:40,117 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.70ms. Allocated memory is still 115.3MB. Free memory was 88.6MB in the beginning and 86.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 07:20:40,117 INFO L158 Benchmark]: Boogie Preprocessor took 34.34ms. Allocated memory is still 115.3MB. Free memory was 86.5MB in the beginning and 85.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 07:20:40,118 INFO L158 Benchmark]: RCFGBuilder took 749.25ms. Allocated memory is still 115.3MB. Free memory was 85.0MB in the beginning and 66.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-19 07:20:40,118 INFO L158 Benchmark]: TraceAbstraction took 81585.44ms. Allocated memory was 115.3MB in the beginning and 343.9MB in the end (delta: 228.6MB). Free memory was 65.0MB in the beginning and 222.9MB in the end (delta: -157.9MB). Peak memory consumption was 183.8MB. Max. memory is 16.1GB. [2022-11-19 07:20:40,120 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.24ms. Allocated memory is still 115.3MB. Free memory was 85.8MB in the beginning and 85.8MB in the end (delta: 30.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.16ms. Allocated memory is still 115.3MB. Free memory was 78.3MB in the beginning and 88.6MB in the end (delta: -10.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.70ms. Allocated memory is still 115.3MB. Free memory was 88.6MB in the beginning and 86.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.34ms. Allocated memory is still 115.3MB. Free memory was 86.5MB in the beginning and 85.5MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 749.25ms. Allocated memory is still 115.3MB. Free memory was 85.0MB in the beginning and 66.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 81585.44ms. Allocated memory was 115.3MB in the beginning and 343.9MB in the end (delta: 228.6MB). Free memory was 65.0MB in the beginning and 222.9MB in the end (delta: -157.9MB). Peak memory consumption was 183.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled * 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: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 37]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 36]: 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 3 procedures, 38 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 81.4s, OverallIterations: 9, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 13.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 6.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 629 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 616 mSDsluCounter, 623 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 476 mSDsCounter, 84 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 947 IncrementalHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 84 mSolverCounterUnsat, 147 mSDtfsCounter, 947 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 529 GetRequests, 313 SyntacticMatches, 19 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2563 ImplicationChecksByTransitivity, 49.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=8, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 79 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 27 PreInvPairs, 55 NumberOfFragments, 1591 HoareAnnotationTreeSize, 27 FomulaSimplifications, 64 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 15 FomulaSimplificationsInter, 16494 FormulaSimplificationTreeSizeReductionInter, 5.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 366 NumberOfCodeBlocks, 340 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 490 ConstructedInterpolants, 0 QuantifiedInterpolants, 1126 SizeOfPredicates, 15 NumberOfNonLiveVariables, 885 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 298/384 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: OVERALL_TIME: 8.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 4, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 44, DAG_INTERPRETER_EARLY_EXITS: 1, TOOLS_POST_APPLICATIONS: 81, TOOLS_POST_TIME: 4.4s, TOOLS_POST_CALL_APPLICATIONS: 24, TOOLS_POST_CALL_TIME: 2.1s, TOOLS_POST_RETURN_APPLICATIONS: 16, TOOLS_POST_RETURN_TIME: 0.4s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 121, TOOLS_QUANTIFIERELIM_TIME: 6.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.6s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 166, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 38, DOMAIN_JOIN_TIME: 1.1s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 7, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 44, DOMAIN_ISBOTTOM_TIME: 0.2s, LOOP_SUMMARIZER_APPLICATIONS: 6, LOOP_SUMMARIZER_CACHE_MISSES: 6, LOOP_SUMMARIZER_OVERALL_TIME: 2.1s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 2.1s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 7, CALL_SUMMARIZER_APPLICATIONS: 16, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 828, DAG_COMPRESSION_RETAINED_NODES: 135, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 6 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant [2022-11-19 07:20:40,137 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-19 07:20:40,137 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-19 07:20:40,138 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-19 07:20:40,141 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-19 07:20:40,142 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled [2022-11-19 07:20:40,142 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.meminit_#ptr#1 : $Pointer$ not handled Derived loop invariant: (((((((((((((((((((((((((((((((((((((i < n && unknown-#length-unknown[3] == 12) && 1 <= \old(n)) && j <= 2147483647) && 2 == unknown-#length-unknown[1]) && 1 <= unknown-#amountOfFields-unknown) && \valid[3] == 1) && 1 <= j) && 4 <= unknown-#product-unknown) && !((if n < 1073741824 && 0 <= n then 1 else 0) == 0)) && ((((((((((((((((((((((((((((((a <= 0 && 2 <= j) && 0 <= _i) && 0 <= i) && j <= 1073741824) && 4 <= unknown-#sizeOfFields-unknown) && _i <= 0) && 0 <= a) && 0 <= _i) && 0 <= a) && a <= 0) && a <= 0) && 0 <= x + 2147483648) && \old(n) <= 1073741824) && _i <= 0) && n <= 1073741824) && 0 <= a) && i <= 1073741824) && 0 <= i) && n <= 1073741824) && 0 <= j) && 0 <= calloc(n, sizeof(int))) && 0 <= _j) && 0 <= _i) && 0 <= #Ultimate.meminit_#ptr#1) && x <= 2147483647) && unknown-#sizeOfFields-unknown <= 4) && 0 <= _i) && calloc(n, sizeof(int)) <= 0) && 1 <= i) || (((((((((((((((((((((((((((((a <= 0 && 0 <= _i) && 0 <= i) && j <= 1073741824) && 4 <= unknown-#sizeOfFields-unknown) && _i <= 0) && 0 <= a) && 0 <= _i) && 0 <= a) && a <= 0) && a <= 0) && 0 <= x + 2147483648) && \old(n) <= 1073741824) && _i <= 0) && n <= 1073741824) && 0 <= a) && i <= 1073741824) && 0 <= i) && n <= 1073741824) && 0 <= i) && 0 <= j) && 0 <= calloc(n, sizeof(int))) && 0 <= _j) && 0 <= _i) && 0 <= #Ultimate.meminit_#ptr#1) && x <= 2147483647) && unknown-#sizeOfFields-unknown <= 4) && 0 <= _i) && i <= 0) && calloc(n, sizeof(int)) <= 0))) && 1 <= n) && \valid[1] == 1) && 1 <= n) && a <= 0) && \valid[0] == 0) && j == 0) && 0 <= _j) && \valid[2] == 1) && #NULL == 0) && 0 <= a) && 0 <= _j) && 0 <= j) && unknown-#product-unknown <= 4294967296) && _j <= 0) && unknown-#memory_int-unknown[1][0] == 48) && unknown-#amountOfFields-unknown <= 1073741824) && 0 <= a) && 0 <= _j) && 10 == unknown-#length-unknown[2]) && \old(n) <= 1073741824) && 1 <= \old(n)) && unknown-#memory_int-unknown[1][1] == 0) && a <= 0) && #Ultimate.meminit_#ptr#1 <= 0) && _j <= 0) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && i == 0 - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:265) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-11-19 07:20:40,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_23d9dc6b-9327-44a2-b6dc-b93fd4ad929f/bin/utaipan-I9t0OCRTmS/config using search string *Overflow*32bit*_Bitvector*.epf No suitable settings file found using Overflow*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int))