./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/reducercommutativity/sum05-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/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_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/config/TaipanReach.xml -i ../../sv-benchmarks/c/reducercommutativity/sum05-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 11bff2dc480380b1206bedd51506b0437b9af4529e78b5beefb811437146f17f --- 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 06:35:08,869 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-19 06:35:08,872 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-19 06:35:08,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-19 06:35:08,901 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-19 06:35:08,905 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-19 06:35:08,908 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-19 06:35:08,915 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-19 06:35:08,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-19 06:35:08,921 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-19 06:35:08,923 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-19 06:35:08,925 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-19 06:35:08,926 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-19 06:35:08,927 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-19 06:35:08,929 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-19 06:35:08,930 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-19 06:35:08,935 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-19 06:35:08,941 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-19 06:35:08,942 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-19 06:35:08,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-19 06:35:08,948 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-19 06:35:08,950 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-19 06:35:08,951 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-19 06:35:08,952 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-19 06:35:08,956 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-19 06:35:08,960 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-19 06:35:08,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-19 06:35:08,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-19 06:35:08,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-19 06:35:08,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-19 06:35:08,968 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-19 06:35:08,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-19 06:35:08,970 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-19 06:35:08,972 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-19 06:35:08,973 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-19 06:35:08,974 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-19 06:35:08,975 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-19 06:35:08,975 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-19 06:35:08,976 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-19 06:35:08,976 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-19 06:35:08,978 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-19 06:35:08,978 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-19 06:35:09,008 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-19 06:35:09,009 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-19 06:35:09,009 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-19 06:35:09,009 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-19 06:35:09,010 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-19 06:35:09,010 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-19 06:35:09,010 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-19 06:35:09,011 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-19 06:35:09,011 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-19 06:35:09,011 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-19 06:35:09,011 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-19 06:35:09,011 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-19 06:35:09,012 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-19 06:35:09,012 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-19 06:35:09,012 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-19 06:35:09,012 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-19 06:35:09,013 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-19 06:35:09,013 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-19 06:35:09,013 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-19 06:35:09,014 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-19 06:35:09,014 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-19 06:35:09,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-19 06:35:09,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-19 06:35:09,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-19 06:35:09,015 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-19 06:35:09,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-19 06:35:09,015 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-19 06:35:09,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-19 06:35:09,016 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-19 06:35:09,016 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-19 06:35:09,016 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-19 06:35:09,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-19 06:35:09,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:35:09,017 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-19 06:35:09,017 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-19 06:35:09,017 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-19 06:35:09,017 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-19 06:35:09,017 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-19 06:35:09,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-19 06:35:09,018 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-19 06:35:09,018 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-19 06:35:09,018 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_e3126f6a-c185-4289-be99-02adcdbd79db/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_e3126f6a-c185-4289-be99-02adcdbd79db/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 ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 11bff2dc480380b1206bedd51506b0437b9af4529e78b5beefb811437146f17f [2022-11-19 06:35:09,301 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-19 06:35:09,338 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-19 06:35:09,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-19 06:35:09,342 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-19 06:35:09,343 INFO L275 PluginConnector]: CDTParser initialized [2022-11-19 06:35:09,344 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/../../sv-benchmarks/c/reducercommutativity/sum05-2.i [2022-11-19 06:35:09,407 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/data/6ed089122/b2b67e2a23394ced9e529e57bfad3b81/FLAGb54d16b4e [2022-11-19 06:35:09,963 INFO L306 CDTParser]: Found 1 translation units. [2022-11-19 06:35:09,964 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/sv-benchmarks/c/reducercommutativity/sum05-2.i [2022-11-19 06:35:09,972 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/data/6ed089122/b2b67e2a23394ced9e529e57bfad3b81/FLAGb54d16b4e [2022-11-19 06:35:10,322 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/data/6ed089122/b2b67e2a23394ced9e529e57bfad3b81 [2022-11-19 06:35:10,324 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-19 06:35:10,326 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-19 06:35:10,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-19 06:35:10,329 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-19 06:35:10,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-19 06:35:10,334 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:35:10" (1/1) ... [2022-11-19 06:35:10,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c781347 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:10, skipping insertion in model container [2022-11-19 06:35:10,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:35:10" (1/1) ... [2022-11-19 06:35:10,345 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-19 06:35:10,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-19 06:35:10,605 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_e3126f6a-c185-4289-be99-02adcdbd79db/sv-benchmarks/c/reducercommutativity/sum05-2.i[1271,1284] [2022-11-19 06:35:10,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:35:10,620 INFO L203 MainTranslator]: Completed pre-run [2022-11-19 06:35:10,638 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_e3126f6a-c185-4289-be99-02adcdbd79db/sv-benchmarks/c/reducercommutativity/sum05-2.i[1271,1284] [2022-11-19 06:35:10,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-19 06:35:10,651 INFO L208 MainTranslator]: Completed translation [2022-11-19 06:35:10,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:10 WrapperNode [2022-11-19 06:35:10,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-19 06:35:10,653 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-19 06:35:10,653 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-19 06:35:10,653 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-19 06:35:10,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:10" (1/1) ... [2022-11-19 06:35:10,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:10" (1/1) ... [2022-11-19 06:35:10,686 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 67 [2022-11-19 06:35:10,686 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-19 06:35:10,687 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-19 06:35:10,687 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-19 06:35:10,687 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-19 06:35:10,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:10" (1/1) ... [2022-11-19 06:35:10,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:10" (1/1) ... [2022-11-19 06:35:10,699 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:10" (1/1) ... [2022-11-19 06:35:10,699 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:10" (1/1) ... [2022-11-19 06:35:10,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:10" (1/1) ... [2022-11-19 06:35:10,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:10" (1/1) ... [2022-11-19 06:35:10,709 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:10" (1/1) ... [2022-11-19 06:35:10,710 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:10" (1/1) ... [2022-11-19 06:35:10,712 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-19 06:35:10,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-19 06:35:10,713 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-19 06:35:10,713 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-19 06:35:10,714 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:10" (1/1) ... [2022-11-19 06:35:10,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-19 06:35:10,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:35:10,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-19 06:35:10,763 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-19 06:35:10,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-19 06:35:10,798 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2022-11-19 06:35:10,798 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2022-11-19 06:35:10,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-19 06:35:10,798 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-19 06:35:10,798 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-19 06:35:10,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-19 06:35:10,799 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-19 06:35:10,799 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-19 06:35:10,799 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-19 06:35:10,870 INFO L235 CfgBuilder]: Building ICFG [2022-11-19 06:35:10,872 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-19 06:35:11,170 INFO L276 CfgBuilder]: Performing block encoding [2022-11-19 06:35:11,252 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-19 06:35:11,253 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2022-11-19 06:35:11,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:35:11 BoogieIcfgContainer [2022-11-19 06:35:11,255 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-19 06:35:11,258 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-19 06:35:11,258 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-19 06:35:11,268 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-19 06:35:11,268 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:35:10" (1/3) ... [2022-11-19 06:35:11,269 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357afd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:35:11, skipping insertion in model container [2022-11-19 06:35:11,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:35:10" (2/3) ... [2022-11-19 06:35:11,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@357afd63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:35:11, skipping insertion in model container [2022-11-19 06:35:11,271 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:35:11" (3/3) ... [2022-11-19 06:35:11,272 INFO L112 eAbstractionObserver]: Analyzing ICFG sum05-2.i [2022-11-19 06:35:11,292 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-19 06:35:11,292 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-19 06:35:11,370 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-19 06:35:11,383 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;@7c8b12cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-19 06:35:11,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-19 06:35:11,387 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 06:35:11,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-19 06:35:11,397 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:11,399 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:11,400 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:35:11,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:11,408 INFO L85 PathProgramCache]: Analyzing trace with hash -93755173, now seen corresponding path program 1 times [2022-11-19 06:35:11,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:11,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393827851] [2022-11-19 06:35:11,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:11,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:11,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:11,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 06:35:11,741 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:11,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393827851] [2022-11-19 06:35:11,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393827851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:11,743 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-19 06:35:11,743 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-19 06:35:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494240599] [2022-11-19 06:35:11,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:11,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:35:11,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:11,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:35:11,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:35:11,779 INFO L87 Difference]: Start difference. First operand has 17 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 06:35:11,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:11,822 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-11-19 06:35:11,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:35:11,825 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 20 [2022-11-19 06:35:11,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:11,831 INFO L225 Difference]: With dead ends: 33 [2022-11-19 06:35:11,832 INFO L226 Difference]: Without dead ends: 16 [2022-11-19 06:35:11,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-19 06:35:11,838 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:11,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:35:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-11-19 06:35:11,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-11-19 06:35:11,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 06:35:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-11-19 06:35:11,873 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 20 [2022-11-19 06:35:11,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:11,874 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-11-19 06:35:11,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-19 06:35:11,874 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-11-19 06:35:11,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-19 06:35:11,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:11,876 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:11,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-19 06:35:11,877 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:35:11,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:11,877 INFO L85 PathProgramCache]: Analyzing trace with hash 3079074, now seen corresponding path program 1 times [2022-11-19 06:35:11,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:11,878 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795690950] [2022-11-19 06:35:11,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:11,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:11,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:12,101 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-11-19 06:35:12,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:12,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795690950] [2022-11-19 06:35:12,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795690950] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:35:12,102 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1323198397] [2022-11-19 06:35:12,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:12,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:12,103 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:35:12,109 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:35:12,127 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-19 06:35:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:12,217 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 06:35:12,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:35:12,258 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-19 06:35:12,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:35:12,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1323198397] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:12,263 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:35:12,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-19 06:35:12,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788818636] [2022-11-19 06:35:12,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:12,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:35:12,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:12,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:35:12,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:35:12,272 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:35:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:12,311 INFO L93 Difference]: Finished difference Result 29 states and 39 transitions. [2022-11-19 06:35:12,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:35:12,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-11-19 06:35:12,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:12,317 INFO L225 Difference]: With dead ends: 29 [2022-11-19 06:35:12,317 INFO L226 Difference]: Without dead ends: 17 [2022-11-19 06:35:12,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:35:12,318 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:12,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:35:12,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-19 06:35:12,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-11-19 06:35:12,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 06:35:12,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2022-11-19 06:35:12,324 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 21 [2022-11-19 06:35:12,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:12,324 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2022-11-19 06:35:12,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:35:12,324 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2022-11-19 06:35:12,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-19 06:35:12,325 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:12,325 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:12,336 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-19 06:35:12,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:12,526 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:35:12,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:12,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1452369158, now seen corresponding path program 1 times [2022-11-19 06:35:12,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:12,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084384657] [2022-11-19 06:35:12,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:12,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:12,695 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 06:35:12,695 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:12,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084384657] [2022-11-19 06:35:12,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084384657] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:35:12,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1609542556] [2022-11-19 06:35:12,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:12,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:12,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:35:12,701 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:35:12,727 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-19 06:35:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:12,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-19 06:35:12,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:35:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-19 06:35:12,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:35:12,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1609542556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:35:12,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:35:12,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2022-11-19 06:35:12,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69048303] [2022-11-19 06:35:12,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:35:12,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-19 06:35:12,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:12,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-19 06:35:12,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:35:12,836 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:35:12,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:12,865 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-11-19 06:35:12,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-19 06:35:12,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-11-19 06:35:12,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:12,867 INFO L225 Difference]: With dead ends: 27 [2022-11-19 06:35:12,867 INFO L226 Difference]: Without dead ends: 18 [2022-11-19 06:35:12,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-19 06:35:12,872 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:12,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:35:12,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-11-19 06:35:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-11-19 06:35:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 06:35:12,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2022-11-19 06:35:12,887 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 24 [2022-11-19 06:35:12,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:12,889 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2022-11-19 06:35:12,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:35:12,890 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2022-11-19 06:35:12,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-19 06:35:12,891 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:12,891 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:12,898 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-19 06:35:13,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:13,097 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:35:13,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:13,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1362806936, now seen corresponding path program 1 times [2022-11-19 06:35:13,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:13,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617030862] [2022-11-19 06:35:13,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:13,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:13,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:13,215 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-19 06:35:13,215 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:13,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617030862] [2022-11-19 06:35:13,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617030862] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:35:13,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844361713] [2022-11-19 06:35:13,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:13,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:13,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:35:13,217 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:35:13,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-19 06:35:13,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:13,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:35:13,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:35:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-19 06:35:13,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:35:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-11-19 06:35:13,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844361713] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:35:13,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [289675600] [2022-11-19 06:35:13,386 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-19 06:35:13,387 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:35:13,390 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:35:13,395 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:35:13,396 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:35:13,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:13,510 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 06:35:13,511 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-19 06:35:13,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:13,526 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 06:35:13,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:13,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 06:35:13,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:13,644 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:35:13,674 INFO L321 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2022-11-19 06:35:13,675 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 186 treesize of output 185 [2022-11-19 06:35:13,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 06:35:13,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:13,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-19 06:35:14,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:14,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-19 06:35:14,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:14,270 INFO L321 Elim1Store]: treesize reduction 45, result has 34.8 percent of original size [2022-11-19 06:35:14,271 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 80 [2022-11-19 06:35:14,361 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 24 treesize of output 24 [2022-11-19 06:35:14,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:35:14,570 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 12 for LOIs [2022-11-19 06:35:14,615 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:35:15,596 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '524#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (<= 4 |ULTIMATE.start_main_~i~2#1|) (or (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~1#1|))) (<= 0 (+ |ULTIMATE.start_main_~ret~1#1| 2147483648)) (<= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret5~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~1#1| 2147483647) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) |ULTIMATE.start_main_~temp~0#1|) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (<= 5 |ULTIMATE.start_main_~i~1#1|) (<= |ULTIMATE.start_main_~ret5~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-19 06:35:15,596 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:35:15,596 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:35:15,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 7 [2022-11-19 06:35:15,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872494317] [2022-11-19 06:35:15,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:35:15,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:35:15,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:15,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:35:15,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-19 06:35:15,598 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-19 06:35:15,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:15,637 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-11-19 06:35:15,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:35:15,638 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 25 [2022-11-19 06:35:15,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:15,639 INFO L225 Difference]: With dead ends: 36 [2022-11-19 06:35:15,640 INFO L226 Difference]: Without dead ends: 21 [2022-11-19 06:35:15,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-19 06:35:15,643 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:15,644 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:35:15,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-19 06:35:15,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-19 06:35:15,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 06:35:15,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-11-19 06:35:15,651 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 25 [2022-11-19 06:35:15,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:15,651 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-11-19 06:35:15,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-19 06:35:15,652 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-11-19 06:35:15,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-19 06:35:15,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:15,653 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:15,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-19 06:35:15,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:15,858 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:35:15,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash -289862895, now seen corresponding path program 2 times [2022-11-19 06:35:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:15,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042077079] [2022-11-19 06:35:15,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:15,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:15,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:15,971 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 06:35:15,971 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:15,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042077079] [2022-11-19 06:35:15,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042077079] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:35:15,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1895301668] [2022-11-19 06:35:15,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:35:15,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:15,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:35:15,973 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:35:15,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-19 06:35:16,059 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-19 06:35:16,059 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:35:16,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-19 06:35:16,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:35:16,088 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 06:35:16,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:35:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-11-19 06:35:16,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1895301668] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:35:16,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [403760727] [2022-11-19 06:35:16,126 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-19 06:35:16,127 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:35:16,127 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:35:16,128 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:35:16,128 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:35:16,154 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:16,171 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 06:35:16,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-19 06:35:16,180 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:16,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 06:35:16,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:16,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-19 06:35:16,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:16,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:16,282 INFO L321 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2022-11-19 06:35:16,282 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 184 [2022-11-19 06:35:16,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 06:35:16,392 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:16,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-19 06:35:16,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:16,539 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:35:16,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-19 06:35:16,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:16,589 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-11-19 06:35:16,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-11-19 06:35:16,625 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 24 treesize of output 24 [2022-11-19 06:35:16,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:35:16,770 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 12 for LOIs [2022-11-19 06:35:16,806 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:35:23,876 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '797#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (<= 4 |ULTIMATE.start_main_~i~2#1|) (or (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~1#1|))) (<= 0 (+ |ULTIMATE.start_main_~ret~1#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_main_~ret5~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~1#1| 2147483647) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) |ULTIMATE.start_main_~temp~0#1|) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (<= 5 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~ret5~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-19 06:35:23,877 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:35:23,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:35:23,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-11-19 06:35:23,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038869730] [2022-11-19 06:35:23,877 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:35:23,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:35:23,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:23,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:35:23,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=299, Unknown=1, NotChecked=0, Total=380 [2022-11-19 06:35:23,879 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 06:35:23,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:23,922 INFO L93 Difference]: Finished difference Result 38 states and 50 transitions. [2022-11-19 06:35:23,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:35:23,923 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 28 [2022-11-19 06:35:23,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:23,923 INFO L225 Difference]: With dead ends: 38 [2022-11-19 06:35:23,924 INFO L226 Difference]: Without dead ends: 24 [2022-11-19 06:35:23,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=80, Invalid=299, Unknown=1, NotChecked=0, Total=380 [2022-11-19 06:35:23,925 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:23,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:35:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-11-19 06:35:23,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-11-19 06:35:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.1578947368421053) internal successors, (22), 19 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 06:35:23,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2022-11-19 06:35:23,930 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 28 [2022-11-19 06:35:23,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:23,931 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2022-11-19 06:35:23,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2022-11-19 06:35:23,931 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2022-11-19 06:35:23,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-19 06:35:23,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:23,933 INFO L195 NwaCegarLoop]: trace histogram [12, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:23,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-19 06:35:24,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:24,137 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:35:24,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:24,138 INFO L85 PathProgramCache]: Analyzing trace with hash 635166223, now seen corresponding path program 3 times [2022-11-19 06:35:24,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:24,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599618542] [2022-11-19 06:35:24,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:24,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-11-19 06:35:24,268 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:24,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599618542] [2022-11-19 06:35:24,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599618542] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:35:24,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601073654] [2022-11-19 06:35:24,268 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 06:35:24,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:24,269 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:35:24,270 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:35:24,295 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-19 06:35:24,374 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 06:35:24,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:35:24,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:35:24,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:35:24,423 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 52 proven. 10 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-19 06:35:24,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:35:24,484 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-19 06:35:24,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601073654] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:35:24,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [822701652] [2022-11-19 06:35:24,487 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-19 06:35:24,487 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:35:24,487 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:35:24,488 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:35:24,488 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:35:24,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,521 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 06:35:24,522 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-19 06:35:24,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,533 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 06:35:24,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-19 06:35:24,601 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,617 INFO L321 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2022-11-19 06:35:24,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 184 [2022-11-19 06:35:24,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 06:35:24,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,732 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-19 06:35:24,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,841 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:35:24,842 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-19 06:35:24,877 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:24,890 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-11-19 06:35:24,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-11-19 06:35:24,916 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 24 treesize of output 24 [2022-11-19 06:35:24,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:35:25,043 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 12 for LOIs [2022-11-19 06:35:25,076 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:35:28,118 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1136#(and (<= 0 |#NULL.base|) (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.offset|) (<= 4 |ULTIMATE.start_main_~i~2#1|) (or (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~1#1|))) (<= 0 (+ |ULTIMATE.start_main_~ret~1#1| 2147483648)) (<= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret5~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~1#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) |ULTIMATE.start_main_~temp~0#1|) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (<= 5 |ULTIMATE.start_main_~i~1#1|) (<= |#NULL.base| 0) (<= |ULTIMATE.start_main_~ret5~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 |#StackHeapBarrier|))' at error location [2022-11-19 06:35:28,119 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:35:28,119 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:35:28,119 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 9 [2022-11-19 06:35:28,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103060208] [2022-11-19 06:35:28,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:35:28,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-19 06:35:28,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:28,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-19 06:35:28,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-11-19 06:35:28,121 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-19 06:35:28,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:28,162 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2022-11-19 06:35:28,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-19 06:35:28,162 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 37 [2022-11-19 06:35:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:28,163 INFO L225 Difference]: With dead ends: 43 [2022-11-19 06:35:28,163 INFO L226 Difference]: Without dead ends: 26 [2022-11-19 06:35:28,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2022-11-19 06:35:28,164 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:28,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:35:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-19 06:35:28,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-11-19 06:35:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 06:35:28,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-11-19 06:35:28,169 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 37 [2022-11-19 06:35:28,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:28,170 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-11-19 06:35:28,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-19 06:35:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-11-19 06:35:28,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-19 06:35:28,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:28,171 INFO L195 NwaCegarLoop]: trace histogram [15, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:28,184 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-19 06:35:28,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:28,377 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:35:28,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:28,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1550629485, now seen corresponding path program 4 times [2022-11-19 06:35:28,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:28,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891345986] [2022-11-19 06:35:28,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:28,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:28,560 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-19 06:35:28,560 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:28,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891345986] [2022-11-19 06:35:28,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891345986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:35:28,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145524918] [2022-11-19 06:35:28,561 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 06:35:28,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:28,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:35:28,562 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:35:28,587 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-19 06:35:28,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:28,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-19 06:35:28,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:35:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-19 06:35:28,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:35:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2022-11-19 06:35:28,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145524918] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:35:28,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [375682777] [2022-11-19 06:35:28,753 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-19 06:35:28,754 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:35:28,754 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:35:28,754 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:35:28,754 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:35:28,766 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:28,779 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 06:35:28,780 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-19 06:35:28,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:28,806 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 06:35:28,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-19 06:35:28,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:28,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 33 [2022-11-19 06:35:28,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:28,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:28,886 INFO L321 Elim1Store]: treesize reduction 49, result has 12.5 percent of original size [2022-11-19 06:35:28,887 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 196 treesize of output 184 [2022-11-19 06:35:28,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 06:35:29,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:29,003 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-19 06:35:29,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:29,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:35:29,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-19 06:35:29,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:29,129 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-11-19 06:35:29,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-11-19 06:35:29,153 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 24 treesize of output 24 [2022-11-19 06:35:29,165 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:35:29,306 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 12 for LOIs [2022-11-19 06:35:29,339 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:35:34,294 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1512#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (<= 4 |ULTIMATE.start_main_~i~2#1|) (or (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~1#1|))) (<= 0 (+ |ULTIMATE.start_main_~ret~1#1| 2147483648)) (exists ((v_sum_~ret~0_BEFORE_RETURN_24 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_sum_~ret~0_BEFORE_RETURN_24 4294967296) 2147483647) (mod v_sum_~ret~0_BEFORE_RETURN_24 4294967296) (+ (mod v_sum_~ret~0_BEFORE_RETURN_24 4294967296) (- 4294967296))))) (<= |#NULL.offset| 0) (<= |ULTIMATE.start_main_~ret~1#1| 2147483647) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) |ULTIMATE.start_main_~temp~0#1|) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (<= 5 |ULTIMATE.start_main_~i~1#1|) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 0 |#NULL.offset|) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-19 06:35:34,294 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:35:34,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:35:34,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 8 [2022-11-19 06:35:34,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80858701] [2022-11-19 06:35:34,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:35:34,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 06:35:34,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:34,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 06:35:34,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-11-19 06:35:34,297 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-19 06:35:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:34,326 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-11-19 06:35:34,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-19 06:35:34,326 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 41 [2022-11-19 06:35:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:34,327 INFO L225 Difference]: With dead ends: 47 [2022-11-19 06:35:34,327 INFO L226 Difference]: Without dead ends: 27 [2022-11-19 06:35:34,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 104 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=88, Invalid=332, Unknown=0, NotChecked=0, Total=420 [2022-11-19 06:35:34,328 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:34,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:35:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-19 06:35:34,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-19 06:35:34,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 06:35:34,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-11-19 06:35:34,343 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 41 [2022-11-19 06:35:34,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:34,343 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-11-19 06:35:34,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-19 06:35:34,344 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-11-19 06:35:34,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-19 06:35:34,344 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:34,344 INFO L195 NwaCegarLoop]: trace histogram [15, 5, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:34,349 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-19 06:35:34,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:34,545 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:35:34,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:34,545 INFO L85 PathProgramCache]: Analyzing trace with hash -366315002, now seen corresponding path program 5 times [2022-11-19 06:35:34,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:34,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923729538] [2022-11-19 06:35:34,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:34,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:34,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:34,651 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-19 06:35:34,652 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:34,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923729538] [2022-11-19 06:35:34,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923729538] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:35:34,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1957443839] [2022-11-19 06:35:34,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-19 06:35:34,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:34,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:35:34,654 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:35:34,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-19 06:35:34,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-11-19 06:35:34,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:35:34,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-19 06:35:34,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:35:34,778 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 76 proven. 3 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2022-11-19 06:35:34,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:35:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [2022-11-19 06:35:34,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1957443839] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:35:34,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2105496807] [2022-11-19 06:35:34,813 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-19 06:35:34,813 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:35:34,813 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:35:34,814 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:35:34,814 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:35:34,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:34,850 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 06:35:34,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-19 06:35:34,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:34,860 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-19 06:35:34,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:34,877 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 06:35:34,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:34,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:35:34,952 INFO L321 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2022-11-19 06:35:34,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 186 treesize of output 185 [2022-11-19 06:35:35,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 06:35:35,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:35,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-19 06:35:35,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:35,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2022-11-19 06:35:35,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:35,259 INFO L321 Elim1Store]: treesize reduction 45, result has 34.8 percent of original size [2022-11-19 06:35:35,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 72 treesize of output 80 [2022-11-19 06:35:35,309 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 24 treesize of output 24 [2022-11-19 06:35:35,322 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:35:35,425 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 12 for LOIs [2022-11-19 06:35:35,472 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:35:38,377 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '1903#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.offset|) (<= 4 |ULTIMATE.start_main_~i~2#1|) (or (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~1#1|))) (<= 0 (+ |ULTIMATE.start_main_~ret~1#1| 2147483648)) (<= |#NULL.offset| 0) (<= 0 (+ |ULTIMATE.start_main_~ret5~0#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~1#1| 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) |ULTIMATE.start_main_~temp~0#1|) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (<= 5 |ULTIMATE.start_main_~i~1#1|) (<= |ULTIMATE.start_main_~ret5~0#1| 2147483647) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (<= 0 |#NULL.offset|) (<= |ULTIMATE.start_main_~#x~0#1.offset| 0) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-19 06:35:38,377 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:35:38,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:35:38,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-11-19 06:35:38,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040716449] [2022-11-19 06:35:38,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:35:38,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-19 06:35:38,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:35:38,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-19 06:35:38,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-19 06:35:38,379 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-19 06:35:38,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:35:38,407 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2022-11-19 06:35:38,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-19 06:35:38,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 42 [2022-11-19 06:35:38,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:35:38,409 INFO L225 Difference]: With dead ends: 42 [2022-11-19 06:35:38,409 INFO L226 Difference]: Without dead ends: 29 [2022-11-19 06:35:38,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2022-11-19 06:35:38,410 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:35:38,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:35:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-11-19 06:35:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-11-19 06:35:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-19 06:35:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-11-19 06:35:38,415 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 42 [2022-11-19 06:35:38,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:35:38,416 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-11-19 06:35:38,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-19 06:35:38,416 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-11-19 06:35:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-19 06:35:38,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:35:38,417 INFO L195 NwaCegarLoop]: trace histogram [15, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:35:38,423 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-19 06:35:38,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:38,619 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:35:38,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:35:38,620 INFO L85 PathProgramCache]: Analyzing trace with hash 341118022, now seen corresponding path program 6 times [2022-11-19 06:35:38,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:35:38,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043981152] [2022-11-19 06:35:38,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:35:38,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:35:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:35:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 3 proven. 170 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2022-11-19 06:35:50,531 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:35:50,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043981152] [2022-11-19 06:35:50,531 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043981152] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:35:50,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1460336205] [2022-11-19 06:35:50,531 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-19 06:35:50,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:35:50,532 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:35:50,535 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:35:50,549 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-19 06:35:50,915 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-19 06:35:50,915 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-19 06:35:50,920 WARN L261 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 162 conjunts are in the unsatisfiable core [2022-11-19 06:35:50,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:35:51,008 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-19 06:35:52,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:35:53,379 INFO L321 Elim1Store]: treesize reduction 600, result has 38.2 percent of original size [2022-11-19 06:35:53,380 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 12 select indices, 12 select index equivalence classes, 1 disjoint index pairs (out of 66 index pairs), introduced 12 new quantified variables, introduced 76 case distinctions, treesize of input 197 treesize of output 445 [2022-11-19 06:36:06,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:06,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:06,948 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:06,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:06,954 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:36:06,954 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 336 treesize of output 134 [2022-11-19 06:36:07,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:07,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:07,282 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:07,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:07,291 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:36:07,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 312 treesize of output 134 [2022-11-19 06:36:07,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:07,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:07,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:07,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:07,620 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:36:07,620 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 298 treesize of output 134 [2022-11-19 06:36:07,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:07,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:07,891 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:07,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:07,897 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:36:07,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 298 treesize of output 134 [2022-11-19 06:36:08,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:36:08,234 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-19 06:36:08,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 292 treesize of output 134 [2022-11-19 06:36:11,679 INFO L321 Elim1Store]: treesize reduction 352, result has 48.3 percent of original size [2022-11-19 06:36:11,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 15 select indices, 15 select index equivalence classes, 10 disjoint index pairs (out of 105 index pairs), introduced 15 new quantified variables, introduced 105 case distinctions, treesize of input 420 treesize of output 476 [2022-11-19 06:37:45,875 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:46,044 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:46,184 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:46,392 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:46,672 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:46,815 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:46,894 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:46,968 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:47,069 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:47,348 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:47,651 WARN L718 sPolynomialRelations]: Constructing 256(two to the power of 8 dual juncts. [2022-11-19 06:37:47,703 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:47,723 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:47,860 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:47,981 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:48,015 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:48,040 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:48,213 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:48,285 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:48,312 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:48,519 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:50,389 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:50,773 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:50,784 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:50,795 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:50,906 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:51,488 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:52,462 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:52,822 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:54,498 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:54,512 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:54,523 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:54,631 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:54,777 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:55,588 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:56,509 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:56,520 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:56,531 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:56,660 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:57,303 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:57,889 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:57,905 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:57,918 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:37:58,320 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:58,521 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:59,312 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:59,371 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:37:59,982 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:00,553 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:00,725 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:38:00,729 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:00,805 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:01,189 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:01,840 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:01,970 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:38:01,975 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:02,165 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:02,243 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:05,640 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:06,073 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:07,086 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:07,121 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:38:07,221 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:07,453 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:08,250 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:09,659 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:10,705 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:11,848 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:38:11,857 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:12,074 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:12,202 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:12,907 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:38:12,911 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:14,679 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:14,924 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:15,259 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:15,443 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:15,493 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:15,925 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:38:15,983 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:16,310 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:38:16,705 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:16,709 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:16,733 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:16,795 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:38:17,238 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:17,614 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:18,583 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:19,494 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:19,532 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:19,986 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:38:19,989 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:19,993 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:38:20,219 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:20,523 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:38:21,165 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:21,710 WARN L718 sPolynomialRelations]: Constructing 128(two to the power of 7 dual juncts. [2022-11-19 06:38:21,713 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:22,561 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:24,161 WARN L718 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2022-11-19 06:38:39,468 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-19 06:38:39,468 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-19 06:38:43,407 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 2 proven. 145 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2022-11-19 06:38:43,407 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1460336205] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-19 06:38:43,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1478849569] [2022-11-19 06:38:43,410 INFO L159 IcfgInterpreter]: Started Sifa with 15 locations of interest [2022-11-19 06:38:43,410 INFO L166 IcfgInterpreter]: Building call graph [2022-11-19 06:38:43,410 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-19 06:38:43,411 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-19 06:38:43,411 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-19 06:38:43,432 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:38:43,448 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-19 06:38:43,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 26 [2022-11-19 06:38:43,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:38:43,486 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-19 06:38:43,486 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 37 [2022-11-19 06:38:43,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:38:43,505 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2022-11-19 06:38:43,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:38:43,537 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:38:43,559 INFO L321 Elim1Store]: treesize reduction 54, result has 28.0 percent of original size [2022-11-19 06:38:43,560 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 186 treesize of output 185 [2022-11-19 06:38:43,609 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-11-19 06:38:43,670 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:38:43,672 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 20 [2022-11-19 06:38:43,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:38:43,745 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-19 06:38:43,745 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 27 [2022-11-19 06:38:43,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-19 06:38:43,784 INFO L321 Elim1Store]: treesize reduction 45, result has 6.3 percent of original size [2022-11-19 06:38:43,785 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 72 [2022-11-19 06:38:43,808 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 24 treesize of output 24 [2022-11-19 06:38:43,819 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-19 06:38:43,923 INFO L197 IcfgInterpreter]: Interpreting procedure sum with input of size 12 for LOIs [2022-11-19 06:38:43,948 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-19 06:38:53,498 WARN L233 SmtUtils]: Spent 8.10s on a formula simplification. DAG size of input: 53 DAG size of output: 36 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-19 06:38:56,837 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '2360#(and (<= |ULTIMATE.start_main_~ret2~0#1| 2147483647) (<= 4 |ULTIMATE.start_main_~i~2#1|) (or (not (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (not (= |ULTIMATE.start_main_~ret5~0#1| |ULTIMATE.start_main_~ret~1#1|))) (<= 0 (+ |ULTIMATE.start_main_~ret~1#1| 2147483648)) (<= |ULTIMATE.start_main_~ret~1#1| 2147483647) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|) (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) |ULTIMATE.start_main_~temp~0#1|) (<= 0 (+ |ULTIMATE.start_main_~ret2~0#1| 2147483648)) (<= 5 |ULTIMATE.start_main_~i~1#1|) (= |#NULL.offset| 0) (<= 0 |ULTIMATE.start_main_~#x~0#1.base|) (exists ((v_sum_~ret~0_BEFORE_RETURN_36 Int)) (= |ULTIMATE.start_main_~ret5~0#1| (ite (<= (mod v_sum_~ret~0_BEFORE_RETURN_36 4294967296) 2147483647) (mod v_sum_~ret~0_BEFORE_RETURN_36 4294967296) (+ (mod v_sum_~ret~0_BEFORE_RETURN_36 4294967296) (- 4294967296))))) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-19 06:38:56,837 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-19 06:38:56,837 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-19 06:38:56,837 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 26, 21] total 65 [2022-11-19 06:38:56,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621935836] [2022-11-19 06:38:56,838 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-19 06:38:56,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-11-19 06:38:56,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:38:56,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-11-19 06:38:56,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=5719, Unknown=1, NotChecked=0, Total=6006 [2022-11-19 06:38:56,843 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 65 states, 55 states have (on average 1.2) internal successors, (66), 58 states have internal predecessors, (66), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-19 06:39:09,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:39:09,248 INFO L93 Difference]: Finished difference Result 71 states and 85 transitions. [2022-11-19 06:39:09,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-19 06:39:09,249 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 55 states have (on average 1.2) internal successors, (66), 58 states have internal predecessors, (66), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 44 [2022-11-19 06:39:09,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:39:09,252 INFO L225 Difference]: With dead ends: 71 [2022-11-19 06:39:09,252 INFO L226 Difference]: Without dead ends: 55 [2022-11-19 06:39:09,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 75 SyntacticMatches, 20 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2005 ImplicationChecksByTransitivity, 36.2s TimeCoverageRelationStatistics Valid=355, Invalid=6450, Unknown=1, NotChecked=0, Total=6806 [2022-11-19 06:39:09,255 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 43 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-19 06:39:09,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 198 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1348 Invalid, 0 Unknown, 90 Unchecked, 2.7s Time] [2022-11-19 06:39:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-19 06:39:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 40. [2022-11-19 06:39:09,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 32 states have (on average 1.125) internal successors, (36), 33 states have internal predecessors, (36), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2022-11-19 06:39:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-11-19 06:39:09,271 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 44 [2022-11-19 06:39:09,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:39:09,271 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-11-19 06:39:09,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 55 states have (on average 1.2) internal successors, (66), 58 states have internal predecessors, (66), 7 states have call successors, (7), 1 states have call predecessors, (7), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-19 06:39:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-11-19 06:39:09,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-19 06:39:09,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-19 06:39:09,273 INFO L195 NwaCegarLoop]: trace histogram [16, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-19 06:39:09,279 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-19 06:39:09,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-19 06:39:09,475 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-19 06:39:09,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-19 06:39:09,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1425309922, now seen corresponding path program 7 times [2022-11-19 06:39:09,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-19 06:39:09,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995984167] [2022-11-19 06:39:09,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-19 06:39:09,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-19 06:39:09,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:39:09,632 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 16 proven. 91 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2022-11-19 06:39:09,633 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-19 06:39:09,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995984167] [2022-11-19 06:39:09,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995984167] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-19 06:39:09,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719947867] [2022-11-19 06:39:09,633 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-11-19 06:39:09,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:39:09,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 [2022-11-19 06:39:09,635 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-19 06:39:09,655 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-19 06:39:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-19 06:39:09,754 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-19 06:39:09,757 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-19 06:39:09,773 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2022-11-19 06:39:09,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-19 06:39:09,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719947867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-19 06:39:09,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-19 06:39:09,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 9 [2022-11-19 06:39:09,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236631861] [2022-11-19 06:39:09,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-19 06:39:09,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-19 06:39:09,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-19 06:39:09,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-19 06:39:09,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-11-19 06:39:09,777 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:39:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-19 06:39:09,817 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-11-19 06:39:09,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-19 06:39:09,818 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 45 [2022-11-19 06:39:09,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-19 06:39:09,818 INFO L225 Difference]: With dead ends: 48 [2022-11-19 06:39:09,819 INFO L226 Difference]: Without dead ends: 0 [2022-11-19 06:39:09,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2022-11-19 06:39:09,823 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 3 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-19 06:39:09,824 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 22 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-19 06:39:09,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-19 06:39:09,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-19 06:39:09,825 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 06:39:09,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-19 06:39:09,826 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 45 [2022-11-19 06:39:09,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-19 06:39:09,826 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-19 06:39:09,826 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-19 06:39:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-19 06:39:09,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-19 06:39:09,829 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-19 06:39:09,840 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-19 06:39:10,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-19 06:39:10,038 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-19 06:39:11,128 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-19 06:39:11,128 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2022-11-19 06:39:11,128 INFO L899 garLoopResultBuilder]: For program point L38(line 38) no Hoare annotation was computed. [2022-11-19 06:39:11,128 INFO L895 garLoopResultBuilder]: At program point L34-3(lines 34 36) the Hoare annotation is: (= |ULTIMATE.start_main_~#x~0#1.offset| 0) [2022-11-19 06:39:11,128 INFO L895 garLoopResultBuilder]: At program point L34-4(lines 34 36) the Hoare annotation is: (= |ULTIMATE.start_main_~#x~0#1.offset| 0) [2022-11-19 06:39:11,128 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-19 06:39:11,129 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 50) no Hoare annotation was computed. [2022-11-19 06:39:11,129 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2022-11-19 06:39:11,129 INFO L895 garLoopResultBuilder]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse4 (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|)) (.cse12 (+ .cse0 12 |ULTIMATE.start_main_~#x~0#1.offset|))) (let ((.cse1 (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (.cse7 (+ 8 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse8 (+ 4 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse9 (+ 12 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse6 (let ((.cse14 (+ .cse0 8 |ULTIMATE.start_main_~#x~0#1.offset|))) (store (let ((.cse13 (+ .cse0 4 |ULTIMATE.start_main_~#x~0#1.offset|))) (store (store .cse4 (+ .cse0 |ULTIMATE.start_main_~#x~0#1.offset|) (select .cse4 .cse13)) .cse13 (select .cse4 .cse14))) .cse14 (select .cse4 .cse12))))) (and (= .cse0 16) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (let ((.cse2 (+ (select .cse4 0) (select .cse4 (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) (select .cse4 12) (select .cse4 4) (select .cse4 8)))) (let ((.cse3 (* 4294967296 (div .cse2 4294967296)))) (or (and .cse1 (= .cse2 (+ |ULTIMATE.start_main_~ret~1#1| .cse3))) (= (+ |ULTIMATE.start_main_~ret~1#1| .cse3 4294967296) .cse2)))) (let ((.cse5 (mod (+ (select .cse6 |ULTIMATE.start_main_~#x~0#1.offset|) (select .cse6 .cse7) (select .cse6 .cse8) (select .cse6 .cse9) |ULTIMATE.start_main_~temp~0#1|) 4294967296))) (or (not (<= .cse5 2147483647)) (= |ULTIMATE.start_main_~ret~1#1| .cse5))) (let ((.cse10 (mod (let ((.cse11 (store .cse6 .cse12 (select .cse4 (+ .cse0 16 |ULTIMATE.start_main_~#x~0#1.offset|))))) (+ (select .cse11 |ULTIMATE.start_main_~#x~0#1.offset|) (select .cse11 .cse7) (select .cse11 .cse8) (select .cse11 .cse9) |ULTIMATE.start_main_~temp~0#1|)) 4294967296))) (or (<= .cse10 2147483647) (and (= (+ |ULTIMATE.start_main_~ret~1#1| 4294967296) .cse10) .cse1))))))) [2022-11-19 06:39:11,129 INFO L902 garLoopResultBuilder]: At program point L49-2(lines 49 51) the Hoare annotation is: true [2022-11-19 06:39:11,129 INFO L899 garLoopResultBuilder]: For program point L47-1(line 47) no Hoare annotation was computed. [2022-11-19 06:39:11,130 INFO L895 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: (let ((.cse6 (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|))) (let ((.cse1 (select .cse6 (+ 4 |ULTIMATE.start_main_~#x~0#1.offset|))) (.cse2 (select .cse6 12)) (.cse3 (select .cse6 8)) (.cse4 (select .cse6 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse5 (select .cse6 16))) (let ((.cse0 (+ .cse1 .cse2 .cse3 .cse4 .cse5))) (let ((.cse7 (* (div .cse0 4294967296) 4294967296))) (and (or (<= .cse0 (+ 4294967295 (* (div (+ (- 2147483648) .cse1 .cse2 .cse3 .cse4 .cse5) 4294967296) 4294967296))) (= (+ .cse1 (select .cse6 (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|)) .cse2 .cse3 .cse4) (+ |ULTIMATE.start_main_~ret~1#1| .cse7))) (= |ULTIMATE.start_main_~#x~0#1.offset| 0) (or (<= .cse0 (+ 2147483647 .cse7)) (= .cse0 (+ |ULTIMATE.start_main_~ret~1#1| .cse7 4294967296)))))))) [2022-11-19 06:39:11,130 INFO L899 garLoopResultBuilder]: For program point L41-1(line 41) no Hoare annotation was computed. [2022-11-19 06:39:11,130 INFO L895 garLoopResultBuilder]: At program point L43-3(lines 43 45) the Hoare annotation is: (let ((.cse16 (+ 12 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse14 (+ 8 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse20 (select |#memory_int| |ULTIMATE.start_main_~#x~0#1.base|)) (.cse15 (+ 4 |ULTIMATE.start_main_~#x~0#1.offset|))) (let ((.cse5 (= |ULTIMATE.start_main_~ret2~0#1| |ULTIMATE.start_main_~ret~1#1|)) (.cse0 (select .cse20 .cse15)) (.cse7 (select .cse20 (+ 16 |ULTIMATE.start_main_~#x~0#1.offset|))) (.cse1 (select .cse20 |ULTIMATE.start_main_~#x~0#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~#x~0#1.offset| 0)) (.cse6 (select .cse20 .cse14)) (.cse8 (select .cse20 .cse16))) (or (and (= .cse0 .cse1) (= |ULTIMATE.start_main_~i~2#1| 1) .cse2 (let ((.cse3 (+ .cse6 .cse0 .cse7 .cse8 |ULTIMATE.start_main_~temp~0#1|))) (let ((.cse4 (* (div .cse3 4294967296) 4294967296))) (or (and (<= .cse3 (+ 2147483647 .cse4)) .cse5 (= .cse3 (+ |ULTIMATE.start_main_~ret~1#1| .cse4))) (and .cse5 (<= .cse3 (+ 4294967295 (* 4294967296 (div (+ (- 2147483648) .cse6 .cse0 .cse7 .cse8 |ULTIMATE.start_main_~temp~0#1|) 4294967296)))) (= (+ |ULTIMATE.start_main_~ret~1#1| 4294967296 .cse4) .cse3)))))) (and (= .cse6 .cse0) .cse2 (let ((.cse9 (+ .cse0 .cse7 .cse8 .cse1 |ULTIMATE.start_main_~temp~0#1|))) (let ((.cse10 (* (div .cse9 4294967296) 4294967296))) (or (and (<= .cse9 (+ 2147483647 .cse10)) .cse5 (= (+ |ULTIMATE.start_main_~ret~1#1| .cse10) .cse9)) (and .cse5 (<= .cse9 (+ (* (div (+ (- 2147483648) .cse0 .cse7 .cse8 .cse1 |ULTIMATE.start_main_~temp~0#1|) 4294967296) 4294967296) 4294967295)) (= (+ |ULTIMATE.start_main_~ret~1#1| .cse10 4294967296) .cse9))))) (= 2 |ULTIMATE.start_main_~i~2#1|)) (let ((.cse11 (* |ULTIMATE.start_main_~i~2#1| 4))) (let ((.cse19 (+ .cse11 12 |ULTIMATE.start_main_~#x~0#1.offset|))) (let ((.cse13 (let ((.cse22 (+ .cse11 8 |ULTIMATE.start_main_~#x~0#1.offset|))) (store (let ((.cse21 (+ .cse11 4 |ULTIMATE.start_main_~#x~0#1.offset|))) (store (store .cse20 (+ .cse11 |ULTIMATE.start_main_~#x~0#1.offset|) (select .cse20 .cse21)) .cse21 (select .cse20 .cse22))) .cse22 (select .cse20 .cse19))))) (and (= .cse7 .cse8) (= .cse11 16) .cse2 (let ((.cse12 (mod (+ (select .cse13 |ULTIMATE.start_main_~#x~0#1.offset|) (select .cse13 .cse14) (select .cse13 .cse15) (select .cse13 .cse16) |ULTIMATE.start_main_~temp~0#1|) 4294967296))) (or (not (<= .cse12 2147483647)) (and (= |ULTIMATE.start_main_~ret~1#1| .cse12) .cse5))) (let ((.cse17 (mod (let ((.cse18 (store .cse13 .cse19 (select .cse20 (+ .cse11 16 |ULTIMATE.start_main_~#x~0#1.offset|))))) (+ (select .cse18 |ULTIMATE.start_main_~#x~0#1.offset|) (select .cse18 .cse14) (select .cse18 .cse15) (select .cse18 .cse16) |ULTIMATE.start_main_~temp~0#1|)) 4294967296))) (or (<= .cse17 2147483647) (and (= (+ |ULTIMATE.start_main_~ret~1#1| 4294967296) .cse17) .cse5))))))) (and (let ((.cse23 (+ .cse6 .cse0 .cse7 .cse8 .cse1))) (let ((.cse24 (* (div .cse23 4294967296) 4294967296))) (or (and (= .cse23 (+ |ULTIMATE.start_main_~ret~1#1| 4294967296 .cse24)) .cse5 (<= .cse23 (+ 4294967295 (* (div (+ (- 2147483648) .cse6 .cse0 .cse7 .cse8 .cse1) 4294967296) 4294967296)))) (and .cse5 (= .cse23 (+ |ULTIMATE.start_main_~ret~1#1| .cse24)) (<= .cse23 (+ 2147483647 .cse24)))))) (= |ULTIMATE.start_main_~i~2#1| 0) .cse2 (= .cse1 |ULTIMATE.start_main_~temp~0#1|)) (and (let ((.cse25 (+ .cse6 .cse0 .cse7 .cse1 |ULTIMATE.start_main_~temp~0#1|))) (let ((.cse26 (* 4294967296 (div .cse25 4294967296)))) (or (and (<= .cse25 (+ 2147483647 .cse26)) .cse5 (= (+ .cse26 |ULTIMATE.start_main_~ret~1#1|) .cse25)) (and (<= .cse25 (+ (* (div (+ (- 2147483648) .cse6 .cse0 .cse7 .cse1 |ULTIMATE.start_main_~temp~0#1|) 4294967296) 4294967296) 4294967295)) .cse5 (= (+ .cse26 |ULTIMATE.start_main_~ret~1#1| 4294967296) .cse25))))) (= 3 |ULTIMATE.start_main_~i~2#1|) .cse2 (= .cse6 .cse8))))) [2022-11-19 06:39:11,131 INFO L899 garLoopResultBuilder]: For program point sumEXIT(lines 15 24) no Hoare annotation was computed. [2022-11-19 06:39:11,131 INFO L902 garLoopResultBuilder]: At program point sumENTRY(lines 15 24) the Hoare annotation is: true [2022-11-19 06:39:11,131 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 22) the Hoare annotation is: (let ((.cse5 (select |#memory_int| sum_~x.base))) (let ((.cse3 (select .cse5 (+ sum_~x.offset 4))) (.cse4 (select .cse5 sum_~x.offset)) (.cse0 (<= |sum_#in~x.offset| sum_~x.offset)) (.cse6 (select .cse5 (+ sum_~x.offset (- 4) (* sum_~i~0 4)))) (.cse1 (<= sum_~x.offset |sum_#in~x.offset|)) (.cse2 (= |sum_#in~x.base| sum_~x.base))) (or (and .cse0 .cse1 .cse2 (= sum_~i~0 2) (= sum_~ret~0 (+ .cse3 .cse4))) (and .cse0 (= sum_~i~0 4) .cse1 .cse2 (= sum_~ret~0 (+ (select .cse5 (+ sum_~x.offset 8)) .cse3 (select .cse5 (+ sum_~x.offset 12)) .cse4))) (and .cse0 .cse1 (= (+ .cse6 .cse3 .cse4) sum_~ret~0) (= sum_~i~0 3) .cse2) (and .cse0 (= sum_~ret~0 0) (= sum_~i~0 0) .cse1 .cse2) (and (<= 5 sum_~i~0) (exists ((sum_~x.offset Int)) (and (<= |sum_#in~x.offset| sum_~x.offset) (<= sum_~x.offset |sum_#in~x.offset|) (= sum_~ret~0 (let ((.cse7 (select |#memory_int| |sum_#in~x.base|))) (+ (select .cse7 (+ sum_~x.offset 8)) (select .cse7 (+ sum_~x.offset 16)) (select .cse7 sum_~x.offset) (select .cse7 (+ sum_~x.offset 4)) (select .cse7 (+ sum_~x.offset 12)))))))) (and .cse0 (= .cse6 sum_~ret~0) .cse1 (= sum_~i~0 1) .cse2)))) [2022-11-19 06:39:11,134 INFO L444 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2022-11-19 06:39:11,135 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-19 06:39:11,144 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,145 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,145 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,145 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,145 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,146 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,146 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,153 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,153 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,153 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,154 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 06:39:11 BoogieIcfgContainer [2022-11-19 06:39:11,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-19 06:39:11,210 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-19 06:39:11,210 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-19 06:39:11,211 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-19 06:39:11,211 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:35:11" (3/4) ... [2022-11-19 06:39:11,214 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-19 06:39:11,224 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure sum [2022-11-19 06:39:11,227 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2022-11-19 06:39:11,228 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-19 06:39:11,228 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-19 06:39:11,228 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-19 06:39:11,266 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((x <= x && x <= x) && x == x) && i == 2) && ret == unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x]) || ((((x <= x && i == 4) && x <= x) && x == x) && ret == unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x])) || ((((x <= x && x <= x) && unknown-#memory_int-unknown[x][x + -4 + i * 4] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] == ret) && i == 3) && x == x)) || ((((x <= x && ret == 0) && i == 0) && x <= x) && x == x)) || (5 <= i && (\exists sum_~x.offset : int :: (x <= sum_~x.offset && sum_~x.offset <= x) && ret == unknown-#memory_int-unknown[x][sum_~x.offset + 8] + unknown-#memory_int-unknown[x][sum_~x.offset + 16] + unknown-#memory_int-unknown[x][sum_~x.offset] + unknown-#memory_int-unknown[x][sum_~x.offset + 4] + unknown-#memory_int-unknown[x][sum_~x.offset + 12]))) || ((((x <= x && unknown-#memory_int-unknown[x][x + -4 + i * 4] == ret) && x <= x) && i == 1) && x == x) [2022-11-19 06:39:11,288 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/bin/utaipan-I9t0OCRTmS/witness.graphml [2022-11-19 06:39:11,288 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-19 06:39:11,289 INFO L158 Benchmark]: Toolchain (without parser) took 240963.09ms. Allocated memory was 142.6MB in the beginning and 708.8MB in the end (delta: 566.2MB). Free memory was 112.6MB in the beginning and 532.7MB in the end (delta: -420.2MB). Peak memory consumption was 146.0MB. Max. memory is 16.1GB. [2022-11-19 06:39:11,289 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 100.7MB. Free memory was 58.0MB in the beginning and 58.0MB in the end (delta: 53.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-19 06:39:11,289 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.67ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 119.8MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-19 06:39:11,290 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.15ms. Allocated memory is still 142.6MB. Free memory was 119.8MB in the beginning and 118.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:39:11,290 INFO L158 Benchmark]: Boogie Preprocessor took 25.34ms. Allocated memory is still 142.6MB. Free memory was 118.0MB in the beginning and 116.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:39:11,290 INFO L158 Benchmark]: RCFGBuilder took 542.83ms. Allocated memory is still 142.6MB. Free memory was 116.8MB in the beginning and 103.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-19 06:39:11,291 INFO L158 Benchmark]: TraceAbstraction took 239952.29ms. Allocated memory was 142.6MB in the beginning and 708.8MB in the end (delta: 566.2MB). Free memory was 102.6MB in the beginning and 534.8MB in the end (delta: -432.2MB). Peak memory consumption was 134.4MB. Max. memory is 16.1GB. [2022-11-19 06:39:11,291 INFO L158 Benchmark]: Witness Printer took 78.02ms. Allocated memory is still 708.8MB. Free memory was 534.8MB in the beginning and 532.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-19 06:39:11,292 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.29ms. Allocated memory is still 100.7MB. Free memory was 58.0MB in the beginning and 58.0MB in the end (delta: 53.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.67ms. Allocated memory is still 142.6MB. Free memory was 112.6MB in the beginning and 119.8MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.15ms. Allocated memory is still 142.6MB. Free memory was 119.8MB in the beginning and 118.0MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.34ms. Allocated memory is still 142.6MB. Free memory was 118.0MB in the beginning and 116.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 542.83ms. Allocated memory is still 142.6MB. Free memory was 116.8MB in the beginning and 103.4MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 239952.29ms. Allocated memory was 142.6MB in the beginning and 708.8MB in the end (delta: 566.2MB). Free memory was 102.6MB in the beginning and 534.8MB in the end (delta: -432.2MB). Peak memory consumption was 134.4MB. Max. memory is 16.1GB. * Witness Printer took 78.02ms. Allocated memory is still 708.8MB. Free memory was 534.8MB in the beginning and 532.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 50]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 239.8s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 50 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 46 mSDsluCounter, 488 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 90 IncrementalHoareTripleChecker+Unchecked, 373 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1549 IncrementalHoareTripleChecker+Invalid, 1690 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 115 mSDtfsCounter, 1549 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 815 GetRequests, 595 SyntacticMatches, 32 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 2617 ImplicationChecksByTransitivity, 55.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=9, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 15 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 52 PreInvPairs, 84 NumberOfFragments, 3978 HoareAnnotationTreeSize, 52 FomulaSimplifications, 192 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 22 FormulaSimplificationTreeSizeReductionInter, 1.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 185.7s InterpolantComputationTime, 634 NumberOfCodeBlocks, 609 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 826 ConstructedInterpolants, 8 QuantifiedInterpolants, 14802 SizeOfPredicates, 17 NumberOfNonLiveVariables, 1750 ConjunctsInSsa, 195 ConjunctsInUnsatCore, 25 InterpolantComputations, 4 PerfectInterpolantSequences, 1911/2607 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 49]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 20]: Loop Invariant [2022-11-19 06:39:11,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,315 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,318 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,319 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,320 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,324 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,324 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,325 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,325 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,325 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] [2022-11-19 06:39:11,325 WARN L421 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[sum_~x.offset,QUANTIFIED] Derived loop invariant: ((((((((x <= x && x <= x) && x == x) && i == 2) && ret == unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x]) || ((((x <= x && i == 4) && x <= x) && x == x) && ret == unknown-#memory_int-unknown[x][x + 8] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x + 12] + unknown-#memory_int-unknown[x][x])) || ((((x <= x && x <= x) && unknown-#memory_int-unknown[x][x + -4 + i * 4] + unknown-#memory_int-unknown[x][x + 4] + unknown-#memory_int-unknown[x][x] == ret) && i == 3) && x == x)) || ((((x <= x && ret == 0) && i == 0) && x <= x) && x == x)) || (5 <= i && (\exists sum_~x.offset : int :: (x <= sum_~x.offset && sum_~x.offset <= x) && ret == unknown-#memory_int-unknown[x][sum_~x.offset + 8] + unknown-#memory_int-unknown[x][sum_~x.offset + 16] + unknown-#memory_int-unknown[x][sum_~x.offset] + unknown-#memory_int-unknown[x][sum_~x.offset + 4] + unknown-#memory_int-unknown[x][sum_~x.offset + 12]))) || ((((x <= x && unknown-#memory_int-unknown[x][x + -4 + i * 4] == ret) && x <= x) && i == 1) && x == x) - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: ((((((unknown-#memory_int-unknown[x][4 + x] == unknown-#memory_int-unknown[x][x] && i == 1) && x == 0) && (((unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp <= 2147483647 + (unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp) / 4294967296 * 4294967296 && ret2 == ret) && unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp == ret + (unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp) / 4294967296 * 4294967296) || ((ret2 == ret && unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp <= 4294967295 + 4294967296 * ((-2147483648 + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp) / 4294967296)) && ret + 4294967296 + (unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + temp))) || (((unknown-#memory_int-unknown[x][8 + x] == unknown-#memory_int-unknown[x][4 + x] && x == 0) && (((unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp <= 2147483647 + (unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296 * 4294967296 && ret2 == ret) && ret + (unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296 * 4294967296 == unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp) || ((ret2 == ret && unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp <= (-2147483648 + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296 * 4294967296 + 4294967295) && ret + (unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296 * 4294967296 + 4294967296 == unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] + temp))) && 2 == i)) || ((((unknown-#memory_int-unknown[x][16 + x] == unknown-#memory_int-unknown[x][12 + x] && i * 4 == 16) && x == 0) && (!((unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][8 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][4 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][12 + x] + temp) % 4294967296 <= 2147483647) || (ret == (unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][8 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][4 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][12 + x] + temp) % 4294967296 && ret2 == ret))) && ((unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][8 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][4 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][12 + x] + temp) % 4294967296 <= 2147483647 || (ret + 4294967296 == (unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][8 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][4 + x] + unknown-#memory_int-unknown[x][i * 4 + x := unknown-#memory_int-unknown[x][i * 4 + 4 + x]][i * 4 + 4 + x := unknown-#memory_int-unknown[x][i * 4 + 8 + x]][i * 4 + 8 + x := unknown-#memory_int-unknown[x][i * 4 + 12 + x]][i * 4 + 12 + x := unknown-#memory_int-unknown[x][i * 4 + 16 + x]][12 + x] + temp) % 4294967296 && ret2 == ret)))) || ((((((unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] == ret + 4294967296 + (unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x]) / 4294967296 * 4294967296 && ret2 == ret) && unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] <= 4294967295 + (-2147483648 + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x]) / 4294967296 * 4294967296) || ((ret2 == ret && unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] == ret + (unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x]) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x] <= 2147483647 + (unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][12 + x] + unknown-#memory_int-unknown[x][x]) / 4294967296 * 4294967296)) && i == 0) && x == 0) && unknown-#memory_int-unknown[x][x] == temp)) || ((((((unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp <= 2147483647 + 4294967296 * ((unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296) && ret2 == ret) && 4294967296 * ((unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296) + ret == unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp) || ((unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp <= (-2147483648 + unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296 * 4294967296 + 4294967295 && ret2 == ret) && 4294967296 * ((unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp) / 4294967296) + ret + 4294967296 == unknown-#memory_int-unknown[x][8 + x] + unknown-#memory_int-unknown[x][4 + x] + unknown-#memory_int-unknown[x][16 + x] + unknown-#memory_int-unknown[x][x] + temp)) && 3 == i) && x == 0) && unknown-#memory_int-unknown[x][8 + x] == unknown-#memory_int-unknown[x][12 + x]) - InvariantResult [Line: 34]: Loop Invariant Derived loop invariant: x == 0 RESULT: Ultimate proved your program to be correct! [2022-11-19 06:39:11,407 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e3126f6a-c185-4289-be99-02adcdbd79db/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 Writing output log to file Ultimate.log Result: TRUE