./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_17_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a 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_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_17_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 7f1dace95b2f32708c50131c14ada2165d80524dd27b525c0899be99f34a7496 --- 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-38b53e6 [2022-11-26 00:26:42,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:26:42,704 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:26:42,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:26:42,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:26:42,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:26:42,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:26:42,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:26:42,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:26:42,752 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:26:42,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:26:42,757 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:26:42,758 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:26:42,760 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:26:42,764 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:26:42,765 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:26:42,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:26:42,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:26:42,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:26:42,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:26:42,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:26:42,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:26:42,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:26:42,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:26:42,788 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:26:42,789 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:26:42,789 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:26:42,791 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:26:42,792 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:26:42,793 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:26:42,794 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:26:42,795 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:26:42,797 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:26:42,799 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:26:42,801 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:26:42,801 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:26:42,802 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:26:42,802 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:26:42,803 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:26:42,805 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:26:42,805 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:26:42,806 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-26 00:26:42,872 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:26:42,872 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:26:42,873 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:26:42,873 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:26:42,875 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:26:42,875 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:26:42,875 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:26:42,876 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:26:42,876 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:26:42,876 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:26:42,877 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:26:42,878 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:26:42,878 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:26:42,879 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:26:42,879 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:26:42,879 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:26:42,879 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:26:42,880 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:26:42,881 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:26:42,881 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:26:42,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:26:42,882 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:26:42,882 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:26:42,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:26:42,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:26:42,883 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 00:26:42,884 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:26:42,884 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:26:42,884 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:26:42,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:26:42,885 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:26:42,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:26:42,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:26:42,886 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:26:42,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:26:42,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:26:42,887 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:26:42,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:26:42,888 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:26:42,888 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:26:42,888 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_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/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_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7f1dace95b2f32708c50131c14ada2165d80524dd27b525c0899be99f34a7496 [2022-11-26 00:26:43,215 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:26:43,246 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:26:43,251 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:26:43,252 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:26:43,253 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:26:43,254 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_17_good.i [2022-11-26 00:26:46,479 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:26:46,916 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:26:46,917 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_predec_17_good.i [2022-11-26 00:26:46,943 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/data/532a35a4f/4028e14e39ac44d99b18508459bc1e53/FLAG988119c6f [2022-11-26 00:26:46,959 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/data/532a35a4f/4028e14e39ac44d99b18508459bc1e53 [2022-11-26 00:26:46,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:26:46,964 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:26:46,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:26:46,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:26:46,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:26:46,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:26:46" (1/1) ... [2022-11-26 00:26:46,973 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c22260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:46, skipping insertion in model container [2022-11-26 00:26:46,973 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:26:46" (1/1) ... [2022-11-26 00:26:46,982 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:26:47,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:26:47,534 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-26 00:26:48,095 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-26 00:26:48,102 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-26 00:26:48,104 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-26 00:26:48,107 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-26 00:26:48,108 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-26 00:26:48,147 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-26 00:26:48,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:26:48,161 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:26:48,185 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-26 00:26:48,232 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-26 00:26:48,234 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-26 00:26:48,235 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-26 00:26:48,237 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-26 00:26:48,238 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-26 00:26:48,244 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-26 00:26:48,245 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:26:48,386 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:26:48,386 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:48 WrapperNode [2022-11-26 00:26:48,386 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:26:48,388 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:26:48,389 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:26:48,389 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:26:48,399 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:48" (1/1) ... [2022-11-26 00:26:48,437 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:48" (1/1) ... [2022-11-26 00:26:48,493 INFO L138 Inliner]: procedures = 501, calls = 59, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 96 [2022-11-26 00:26:48,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:26:48,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:26:48,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:26:48,495 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:26:48,505 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:48" (1/1) ... [2022-11-26 00:26:48,505 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:48" (1/1) ... [2022-11-26 00:26:48,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:48" (1/1) ... [2022-11-26 00:26:48,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:48" (1/1) ... [2022-11-26 00:26:48,541 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:48" (1/1) ... [2022-11-26 00:26:48,546 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:48" (1/1) ... [2022-11-26 00:26:48,549 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:48" (1/1) ... [2022-11-26 00:26:48,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:48" (1/1) ... [2022-11-26 00:26:48,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:26:48,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:26:48,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:26:48,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:26:48,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:48" (1/1) ... [2022-11-26 00:26:48,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:26:48,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:26:48,607 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:26:48,616 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:26:48,645 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-26 00:26:48,646 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-26 00:26:48,646 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-26 00:26:48,646 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-26 00:26:48,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:26:48,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:26:48,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:26:48,647 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-26 00:26:48,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:26:48,840 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:26:48,843 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:26:49,161 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:26:49,207 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:26:49,207 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-26 00:26:49,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:26:49 BoogieIcfgContainer [2022-11-26 00:26:49,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:26:49,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:26:49,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:26:49,217 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:26:49,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:26:46" (1/3) ... [2022-11-26 00:26:49,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2d884e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:26:49, skipping insertion in model container [2022-11-26 00:26:49,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:26:48" (2/3) ... [2022-11-26 00:26:49,219 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b2d884e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:26:49, skipping insertion in model container [2022-11-26 00:26:49,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:26:49" (3/3) ... [2022-11-26 00:26:49,220 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_predec_17_good.i [2022-11-26 00:26:49,240 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:26:49,241 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2022-11-26 00:26:49,290 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:26:49,298 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;@2f26a4bc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:26:49,299 INFO L358 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2022-11-26 00:26:49,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 37 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-26 00:26:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-26 00:26:49,311 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:49,311 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:49,312 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-26 00:26:49,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:49,318 INFO L85 PathProgramCache]: Analyzing trace with hash -895491279, now seen corresponding path program 1 times [2022-11-26 00:26:49,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:49,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144340009] [2022-11-26 00:26:49,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:49,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:49,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:49,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:49,770 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:49,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144340009] [2022-11-26 00:26:49,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144340009] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:26:49,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:26:49,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:26:49,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266000228] [2022-11-26 00:26:49,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:26:49,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:26:49,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:49,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:26:49,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:26:49,852 INFO L87 Difference]: Start difference. First operand has 44 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 37 states have internal predecessors, (41), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:26:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:50,003 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2022-11-26 00:26:50,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:26:50,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 7 [2022-11-26 00:26:50,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:50,016 INFO L225 Difference]: With dead ends: 85 [2022-11-26 00:26:50,017 INFO L226 Difference]: Without dead ends: 44 [2022-11-26 00:26:50,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:26:50,029 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 3 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:50,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 114 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:26:50,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-26 00:26:50,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-26 00:26:50,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 26 states have (on average 1.6153846153846154) internal successors, (42), 38 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-26 00:26:50,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-11-26 00:26:50,088 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 7 [2022-11-26 00:26:50,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:50,090 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-11-26 00:26:50,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:26:50,091 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-11-26 00:26:50,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-26 00:26:50,093 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:50,093 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:50,094 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:26:50,094 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-26 00:26:50,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:50,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1538756758, now seen corresponding path program 1 times [2022-11-26 00:26:50,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:50,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048289792] [2022-11-26 00:26:50,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:50,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:50,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:50,225 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:50,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048289792] [2022-11-26 00:26:50,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048289792] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:26:50,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62569391] [2022-11-26 00:26:50,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:50,227 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:50,227 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:26:50,235 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:26:50,261 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-26 00:26:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:50,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:26:50,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:50,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:50,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:26:50,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62569391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:26:50,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:26:50,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-26 00:26:50,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190542543] [2022-11-26 00:26:50,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:26:50,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:26:50,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:50,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:26:50,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:26:50,453 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:26:50,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:50,530 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-11-26 00:26:50,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:26:50,531 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-11-26 00:26:50,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:50,532 INFO L225 Difference]: With dead ends: 78 [2022-11-26 00:26:50,534 INFO L226 Difference]: Without dead ends: 40 [2022-11-26 00:26:50,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:26:50,536 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 32 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:50,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 79 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:26:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-11-26 00:26:50,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-11-26 00:26:50,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 24 states have (on average 1.5416666666666667) internal successors, (37), 34 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-26 00:26:50,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2022-11-26 00:26:50,558 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 10 [2022-11-26 00:26:50,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:50,559 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2022-11-26 00:26:50,559 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:26:50,560 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2022-11-26 00:26:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:26:50,561 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:50,561 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:50,571 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-26 00:26:50,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:50,769 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-26 00:26:50,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:50,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1276061748, now seen corresponding path program 1 times [2022-11-26 00:26:50,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:50,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99755282] [2022-11-26 00:26:50,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:50,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:50,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:50,873 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-26 00:26:50,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:50,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99755282] [2022-11-26 00:26:50,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99755282] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:26:50,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:26:50,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:26:50,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113394397] [2022-11-26 00:26:50,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:26:50,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:26:50,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:50,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:26:50,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:26:50,879 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:26:50,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:50,926 INFO L93 Difference]: Finished difference Result 68 states and 76 transitions. [2022-11-26 00:26:50,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:26:50,927 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-26 00:26:50,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:50,928 INFO L225 Difference]: With dead ends: 68 [2022-11-26 00:26:50,930 INFO L226 Difference]: Without dead ends: 35 [2022-11-26 00:26:50,930 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-26 00:26:50,933 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:50,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 33 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:26:50,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-11-26 00:26:50,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-11-26 00:26:50,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:26:50,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2022-11-26 00:26:50,946 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 12 [2022-11-26 00:26:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:50,947 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2022-11-26 00:26:50,947 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:26:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2022-11-26 00:26:50,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:26:50,948 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:50,949 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:50,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:26:50,949 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-26 00:26:50,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:50,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1275966023, now seen corresponding path program 1 times [2022-11-26 00:26:50,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:50,952 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662505347] [2022-11-26 00:26:50,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:50,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-26 00:26:51,037 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:51,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662505347] [2022-11-26 00:26:51,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662505347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:26:51,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:26:51,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:26:51,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498175986] [2022-11-26 00:26:51,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:26:51,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:26:51,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:51,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:26:51,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:26:51,046 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:26:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:51,107 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2022-11-26 00:26:51,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:26:51,108 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-11-26 00:26:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:51,109 INFO L225 Difference]: With dead ends: 61 [2022-11-26 00:26:51,109 INFO L226 Difference]: Without dead ends: 43 [2022-11-26 00:26:51,110 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-26 00:26:51,111 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 6 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:51,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 55 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:26:51,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-26 00:26:51,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 36. [2022-11-26 00:26:51,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 23 states have (on average 1.434782608695652) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:26:51,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2022-11-26 00:26:51,121 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 12 [2022-11-26 00:26:51,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:51,122 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2022-11-26 00:26:51,122 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, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-26 00:26:51,122 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2022-11-26 00:26:51,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-26 00:26:51,123 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:51,123 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:51,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:26:51,124 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-26 00:26:51,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:51,125 INFO L85 PathProgramCache]: Analyzing trace with hash 754095898, now seen corresponding path program 1 times [2022-11-26 00:26:51,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:51,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527752575] [2022-11-26 00:26:51,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:51,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:51,225 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:26:51,226 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:51,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527752575] [2022-11-26 00:26:51,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527752575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:26:51,227 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:26:51,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:26:51,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89515132] [2022-11-26 00:26:51,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:26:51,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:26:51,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:51,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:26:51,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:26:51,230 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:26:51,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:51,285 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-11-26 00:26:51,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:26:51,286 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-11-26 00:26:51,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:51,287 INFO L225 Difference]: With dead ends: 43 [2022-11-26 00:26:51,287 INFO L226 Difference]: Without dead ends: 41 [2022-11-26 00:26:51,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:26:51,289 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 3 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:51,289 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 77 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:26:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-11-26 00:26:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2022-11-26 00:26:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 34 states have internal predecessors, (37), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-26 00:26:51,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2022-11-26 00:26:51,298 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 16 [2022-11-26 00:26:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:51,299 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2022-11-26 00:26:51,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-26 00:26:51,299 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-11-26 00:26:51,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:26:51,300 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:51,300 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:51,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:26:51,301 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-26 00:26:51,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:51,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1251505096, now seen corresponding path program 1 times [2022-11-26 00:26:51,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:51,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339806914] [2022-11-26 00:26:51,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:51,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:51,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:51,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:26:51,463 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:51,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339806914] [2022-11-26 00:26:51,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339806914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:26:51,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:26:51,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:26:51,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129962182] [2022-11-26 00:26:51,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:26:51,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:26:51,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:51,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:26:51,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:26:51,468 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 00:26:51,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:51,554 INFO L93 Difference]: Finished difference Result 59 states and 64 transitions. [2022-11-26 00:26:51,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:26:51,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2022-11-26 00:26:51,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:51,557 INFO L225 Difference]: With dead ends: 59 [2022-11-26 00:26:51,557 INFO L226 Difference]: Without dead ends: 44 [2022-11-26 00:26:51,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:26:51,567 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 3 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:51,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 83 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:26:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-26 00:26:51,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-26 00:26:51,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 37 states have internal predecessors, (40), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-26 00:26:51,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-11-26 00:26:51,578 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 20 [2022-11-26 00:26:51,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:51,579 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-11-26 00:26:51,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 00:26:51,579 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-11-26 00:26:51,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-26 00:26:51,580 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:51,580 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:51,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:26:51,581 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-26 00:26:51,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:51,582 INFO L85 PathProgramCache]: Analyzing trace with hash -594117095, now seen corresponding path program 1 times [2022-11-26 00:26:51,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:51,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89233684] [2022-11-26 00:26:51,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:51,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:51,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:51,654 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-26 00:26:51,654 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:51,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89233684] [2022-11-26 00:26:51,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89233684] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:26:51,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810391087] [2022-11-26 00:26:51,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:51,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:51,656 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:26:51,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:26:51,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-26 00:26:51,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:51,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:26:51,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:51,830 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-11-26 00:26:51,831 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:26:51,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810391087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:26:51,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:26:51,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-26 00:26:51,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654045448] [2022-11-26 00:26:51,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:26:51,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:26:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:51,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:26:51,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:26:51,834 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:26:51,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:51,889 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-11-26 00:26:51,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:26:51,890 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2022-11-26 00:26:51,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:51,893 INFO L225 Difference]: With dead ends: 68 [2022-11-26 00:26:51,893 INFO L226 Difference]: Without dead ends: 37 [2022-11-26 00:26:51,894 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:26:51,895 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:51,899 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 60 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:26:51,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-11-26 00:26:51,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-11-26 00:26:51,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 31 states have internal predecessors, (33), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:26:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-11-26 00:26:51,912 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 24 [2022-11-26 00:26:51,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:51,912 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-11-26 00:26:51,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:26:51,913 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-11-26 00:26:51,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 00:26:51,913 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:51,913 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:51,932 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-26 00:26:52,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-11-26 00:26:52,124 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-26 00:26:52,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:52,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1022887391, now seen corresponding path program 1 times [2022-11-26 00:26:52,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:52,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989274060] [2022-11-26 00:26:52,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:52,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:52,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:26:52,227 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:52,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989274060] [2022-11-26 00:26:52,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989274060] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:26:52,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1492553006] [2022-11-26 00:26:52,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:52,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:52,229 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:26:52,230 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:26:52,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-26 00:26:52,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:52,333 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-26 00:26:52,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:52,366 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:26:52,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-26 00:26:52,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1492553006] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:26:52,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-26 00:26:52,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2022-11-26 00:26:52,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123316135] [2022-11-26 00:26:52,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:26:52,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-26 00:26:52,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:52,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-26 00:26:52,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-26 00:26:52,370 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 00:26:52,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:52,416 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2022-11-26 00:26:52,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-26 00:26:52,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-26 00:26:52,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:52,419 INFO L225 Difference]: With dead ends: 51 [2022-11-26 00:26:52,419 INFO L226 Difference]: Without dead ends: 33 [2022-11-26 00:26:52,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-26 00:26:52,421 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 24 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:52,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 61 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:26:52,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-26 00:26:52,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-26 00:26:52,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 27 states have internal predecessors, (28), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:26:52,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-11-26 00:26:52,436 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 23 [2022-11-26 00:26:52,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:52,436 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-11-26 00:26:52,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 00:26:52,441 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-11-26 00:26:52,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-26 00:26:52,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:52,443 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:52,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-26 00:26:52,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:52,649 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-26 00:26:52,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:52,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1644743407, now seen corresponding path program 1 times [2022-11-26 00:26:52,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:52,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385538739] [2022-11-26 00:26:52,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:52,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:52,710 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:26:52,711 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:52,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385538739] [2022-11-26 00:26:52,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385538739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:26:52,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:26:52,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:26:52,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601707541] [2022-11-26 00:26:52,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:26:52,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:26:52,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:52,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:26:52,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:26:52,715 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 00:26:52,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:52,760 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2022-11-26 00:26:52,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:26:52,761 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2022-11-26 00:26:52,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:52,764 INFO L225 Difference]: With dead ends: 37 [2022-11-26 00:26:52,764 INFO L226 Difference]: Without dead ends: 36 [2022-11-26 00:26:52,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:26:52,767 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 2 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:52,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:26:52,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-11-26 00:26:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-11-26 00:26:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 29 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:26:52,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-11-26 00:26:52,776 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 24 [2022-11-26 00:26:52,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:52,777 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-11-26 00:26:52,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.5) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 00:26:52,778 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-11-26 00:26:52,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-26 00:26:52,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:52,779 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:52,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:26:52,779 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-26 00:26:52,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:52,780 INFO L85 PathProgramCache]: Analyzing trace with hash -552561814, now seen corresponding path program 1 times [2022-11-26 00:26:52,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:52,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928100396] [2022-11-26 00:26:52,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:52,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:52,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:26:52,826 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:52,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928100396] [2022-11-26 00:26:52,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928100396] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:26:52,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:26:52,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:26:52,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985325346] [2022-11-26 00:26:52,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:26:52,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:26:52,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:52,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:26:52,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:26:52,834 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 00:26:52,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:52,863 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2022-11-26 00:26:52,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:26:52,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-26 00:26:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:52,865 INFO L225 Difference]: With dead ends: 35 [2022-11-26 00:26:52,865 INFO L226 Difference]: Without dead ends: 34 [2022-11-26 00:26:52,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:26:52,866 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:52,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 35 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:26:52,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-26 00:26:52,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-11-26 00:26:52,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:26:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2022-11-26 00:26:52,884 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 25 [2022-11-26 00:26:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:52,884 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2022-11-26 00:26:52,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-26 00:26:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2022-11-26 00:26:52,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-26 00:26:52,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:52,890 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:52,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 00:26:52,890 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-26 00:26:52,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:52,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1601909401, now seen corresponding path program 1 times [2022-11-26 00:26:52,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:52,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314495071] [2022-11-26 00:26:52,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:52,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:52,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:26:52,967 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:52,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314495071] [2022-11-26 00:26:52,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314495071] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:26:52,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:26:52,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:26:52,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482168657] [2022-11-26 00:26:52,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:26:52,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:26:52,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:26:52,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:26:52,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:26:52,970 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-26 00:26:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:26:53,029 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-11-26 00:26:53,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:26:53,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2022-11-26 00:26:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:26:53,030 INFO L225 Difference]: With dead ends: 41 [2022-11-26 00:26:53,030 INFO L226 Difference]: Without dead ends: 39 [2022-11-26 00:26:53,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-26 00:26:53,031 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:26:53,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:26:53,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-11-26 00:26:53,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-11-26 00:26:53,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 30 states have (on average 1.1) internal successors, (33), 32 states have internal predecessors, (33), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-11-26 00:26:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-11-26 00:26:53,038 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 30 [2022-11-26 00:26:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:26:53,039 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-11-26 00:26:53,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-26 00:26:53,039 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-11-26 00:26:53,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-26 00:26:53,040 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:26:53,040 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:26:53,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 00:26:53,040 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 9 more)] === [2022-11-26 00:26:53,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:26:53,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1101212581, now seen corresponding path program 1 times [2022-11-26 00:26:53,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:26:53,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51773490] [2022-11-26 00:26:53,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:53,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:26:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-26 00:26:53,164 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:26:53,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51773490] [2022-11-26 00:26:53,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51773490] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-26 00:26:53,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873240709] [2022-11-26 00:26:53,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:26:53,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-26 00:26:53,165 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:26:53,166 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-26 00:26:53,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-26 00:26:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:26:53,274 INFO L263 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-26 00:26:53,277 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-26 00:26:53,337 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:26:53,337 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-26 00:26:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-26 00:26:53,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873240709] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-26 00:26:53,429 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [667526536] [2022-11-26 00:26:53,451 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2022-11-26 00:26:53,451 INFO L166 IcfgInterpreter]: Building call graph [2022-11-26 00:26:53,455 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-26 00:26:53,462 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-26 00:26:53,463 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-26 00:26:55,010 INFO L197 IcfgInterpreter]: Interpreting procedure printIntLine with input of size 61 for LOIs [2022-11-26 00:26:55,016 INFO L197 IcfgInterpreter]: Interpreting procedure printLine with input of size 98 for LOIs [2022-11-26 00:26:55,053 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-26 00:27:00,750 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [667526536] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:27:00,750 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-26 00:27:00,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [5, 3, 3] total 25 [2022-11-26 00:27:00,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559237484] [2022-11-26 00:27:00,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:27:00,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-11-26 00:27:00,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:27:00,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-11-26 00:27:00,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2022-11-26 00:27:00,754 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 18 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:27:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:27:01,128 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-11-26 00:27:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-26 00:27:01,129 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2022-11-26 00:27:01,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:27:01,129 INFO L225 Difference]: With dead ends: 39 [2022-11-26 00:27:01,129 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:27:01,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 75 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=112, Invalid=488, Unknown=0, NotChecked=0, Total=600 [2022-11-26 00:27:01,130 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 1 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-26 00:27:01,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 6 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-26 00:27:01,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:27:01,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:27:01,132 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-26 00:27:01,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:27:01,132 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2022-11-26 00:27:01,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:27:01,132 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:27:01,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 15 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-26 00:27:01,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:27:01,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:27:01,135 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 12 remaining) [2022-11-26 00:27:01,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 12 remaining) [2022-11-26 00:27:01,136 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 12 remaining) [2022-11-26 00:27:01,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 12 remaining) [2022-11-26 00:27:01,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 12 remaining) [2022-11-26 00:27:01,137 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 12 remaining) [2022-11-26 00:27:01,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 12 remaining) [2022-11-26 00:27:01,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 12 remaining) [2022-11-26 00:27:01,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 12 remaining) [2022-11-26 00:27:01,138 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 12 remaining) [2022-11-26 00:27:01,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 12 remaining) [2022-11-26 00:27:01,139 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 12 remaining) [2022-11-26 00:27:01,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-26 00:27:01,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-11-26 00:27:01,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 00:27:03,807 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-26 00:27:03,807 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-26 00:27:03,808 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-26 00:27:03,808 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-26 00:27:03,808 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1561) no Hoare annotation was computed. [2022-11-26 00:27:03,809 INFO L895 garLoopResultBuilder]: At program point L1567(line 1567) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= |ULTIMATE.start_goodB2G_~k~0#1| 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#valid| 4) 1) (= (select |#length| 3) 18) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= (+ |ULTIMATE.start_goodB2G_~data~0#1| 2147483648) 0) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= 54 (select |#length| 2)) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 16 (select |#length| 4)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= |ULTIMATE.start_goodB2G_~i~1#1| 1) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-26 00:27:03,809 INFO L899 garLoopResultBuilder]: For program point L1567-1(lines 1557 1569) no Hoare annotation was computed. [2022-11-26 00:27:03,809 INFO L895 garLoopResultBuilder]: At program point L1563(line 1563) the Hoare annotation is: false [2022-11-26 00:27:03,809 INFO L899 garLoopResultBuilder]: For program point L1559(lines 1559 1568) no Hoare annotation was computed. [2022-11-26 00:27:03,809 INFO L899 garLoopResultBuilder]: For program point L1580-2(line 1580) no Hoare annotation was computed. [2022-11-26 00:27:03,810 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1580) no Hoare annotation was computed. [2022-11-26 00:27:03,810 INFO L899 garLoopResultBuilder]: For program point L1580-3(line 1580) no Hoare annotation was computed. [2022-11-26 00:27:03,810 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-11-26 00:27:03,811 INFO L895 garLoopResultBuilder]: At program point L1580-4(lines 1580 1587) the Hoare annotation is: (let ((.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse4 (= (select (select |#memory_int| 1) 0) 0)) (.cse5 (= (select |#valid| 3) 1)) (.cse6 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse7 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse9 (= (select |#valid| 4) 1)) (.cse10 (= (select |#length| 3) 18)) (.cse11 (= (select |#valid| 1) 1)) (.cse12 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse8 (+ |ULTIMATE.start_goodB2G_~data~0#1| 2147483648)) (.cse13 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse14 (= (select |#valid| 0) 0)) (.cse15 (= 54 (select |#length| 2))) (.cse16 (= (select |#length| 1) 1)) (.cse17 (= (select |#valid| 2) 1)) (.cse18 (= 16 (select |#length| 4))) (.cse19 (< 0 |#StackHeapBarrier|))) (or (let ((.cse0 (+ |ULTIMATE.start_goodG2B_~data~1#1| 3)) (.cse3 (+ |ULTIMATE.start_goodG2B_~result~1#1| 3))) (and (<= 0 ~GLOBAL_CONST_FALSE~0) (<= ~globalTrue~0 1) (<= 1 |ULTIMATE.start_goodB2G_~i~1#1|) (<= ~globalArgc~0 0) (<= 0 |#NULL.base|) (<= |ULTIMATE.start_goodG2B_~h~0#1| 1) (<= 0 .cse0) (<= 5 ~globalFive~0) .cse1 .cse2 (<= 0 .cse3) (<= 5 ~GLOBAL_CONST_FIVE~0) (<= ~GLOBAL_CONST_TRUE~0 1) (<= ~globalArgv~0.offset 0) (<= 1 |ULTIMATE.start_goodG2B_~j~0#1|) (<= 1 |ULTIMATE.start_goodG2B_~h~0#1|) (<= 1 |ULTIMATE.start_goodB2G_~k~0#1|) .cse4 (<= ~globalFalse~0 0) (<= ~GLOBAL_CONST_FIVE~0 5) .cse5 .cse6 (<= |#NULL.offset| 0) .cse7 (<= 0 .cse8) (<= 1 ~GLOBAL_CONST_TRUE~0) .cse9 .cse10 .cse11 (<= 0 ~globalFalse~0) (<= 0 ~globalArgc~0) (<= 0 ~globalArgv~0.base) .cse12 (<= |#NULL.base| 0) (<= .cse8 0) .cse13 .cse14 (<= ~globalArgv~0.base 0) (<= ~GLOBAL_CONST_FALSE~0 0) .cse15 .cse16 (<= 0 ~globalArgv~0.offset) .cse17 .cse18 (<= |ULTIMATE.start_goodG2B_~j~0#1| 1) (<= .cse0 0) (<= 1 ~globalTrue~0) (<= |ULTIMATE.start_goodB2G_~k~0#1| 1) (<= 0 |#NULL.offset|) (<= ~globalFive~0 5) .cse19 (<= |ULTIMATE.start_goodB2G_~i~1#1| 1) (<= .cse3 0))) (and (= ~GLOBAL_CONST_FALSE~0 0) (= |ULTIMATE.start_goodG2B_~h~0#1| 1) (= |ULTIMATE.start_goodG2B_~j~0#1| 0) .cse1 .cse2 (= (+ |ULTIMATE.start_goodG2B_~data~1#1| 2) 0) .cse4 (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) .cse5 (= ~GLOBAL_CONST_TRUE~0 1) .cse6 .cse7 (= |ULTIMATE.start_goodB2G_~k~0#1| 1) .cse9 .cse10 .cse11 .cse12 (= .cse8 0) (= ~globalArgv~0.base 0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= |ULTIMATE.start_goodB2G_~i~1#1| 1) (= ~globalArgc~0 0) (= 5 ~globalFive~0) .cse19 (= |#NULL.base| 0) (= ~globalTrue~0 1)))) [2022-11-26 00:27:03,811 INFO L899 garLoopResultBuilder]: For program point L1576-3(line 1576) no Hoare annotation was computed. [2022-11-26 00:27:03,811 INFO L899 garLoopResultBuilder]: For program point L1576-4(line 1576) no Hoare annotation was computed. [2022-11-26 00:27:03,812 INFO L895 garLoopResultBuilder]: At program point L1576-5(lines 1576 1579) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodB2G_~data~0#1| 2147483648))) (and (<= |#NULL.offset| 0) (<= 0 .cse0) (<= 0 ~globalArgv~0.base) (<= .cse0 0) (<= ~globalArgv~0.base 0) (<= 0 |#NULL.offset|) (let ((.cse1 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse2 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse3 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse4 (= (select (select |#memory_int| 1) 0) 0)) (.cse5 (= ~globalArgv~0.offset 0)) (.cse6 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse7 (= (select |#valid| 3) 1)) (.cse8 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse10 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse11 (= |ULTIMATE.start_goodB2G_~k~0#1| 1)) (.cse12 (= (select |#valid| 4) 1)) (.cse13 (= (select |#length| 3) 18)) (.cse14 (= (select |#valid| 1) 1)) (.cse15 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse16 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse17 (= (select |#valid| 0) 0)) (.cse18 (= 54 (select |#length| 2))) (.cse19 (= (select |#length| 1) 1)) (.cse20 (= (select |#valid| 2) 1)) (.cse21 (= 16 (select |#length| 4))) (.cse22 (= ~globalFalse~0 0)) (.cse23 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse24 (= ~globalArgc~0 0)) (.cse25 (= 5 ~globalFive~0)) (.cse26 (< 0 |#StackHeapBarrier|)) (.cse27 (= |#NULL.base| 0)) (.cse28 (= ~globalTrue~0 1))) (or (and .cse1 .cse2 .cse3 .cse4 .cse5 (= |ULTIMATE.start_goodG2B_~data~1#1| 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 (= |ULTIMATE.start_goodG2B_~h~0#1| 0) .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28) (and .cse1 (= |ULTIMATE.start_goodG2B_~h~0#1| 1) .cse2 .cse3 (= (+ |ULTIMATE.start_goodG2B_~data~1#1| 2) 0) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28))))) [2022-11-26 00:27:03,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1553) no Hoare annotation was computed. [2022-11-26 00:27:03,812 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 00:27:03,813 INFO L895 garLoopResultBuilder]: At program point L1597(line 1597) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (select |#valid| 4) 1) (= (select |#length| 3) 18) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= (select |#valid| 0) 0) (= 54 (select |#length| 2)) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 16 (select |#length| 4)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-26 00:27:03,813 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1557) no Hoare annotation was computed. [2022-11-26 00:27:03,813 INFO L899 garLoopResultBuilder]: For program point L1597-1(line 1597) no Hoare annotation was computed. [2022-11-26 00:27:03,814 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) the Hoare annotation is: (and (= ~GLOBAL_CONST_FALSE~0 0) (= |ULTIMATE.start_goodG2B_~h~0#1| 1) (= |ULTIMATE.start_goodG2B_~j~0#1| 0) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|) (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|) (= (select (select |#memory_int| 1) 0) 0) (= ~globalArgv~0.offset 0) (= 5 ~GLOBAL_CONST_FIVE~0) (= (select |#valid| 3) 1) (= ~GLOBAL_CONST_TRUE~0 1) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|) (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|) (= (+ |ULTIMATE.start_goodG2B_~data~1#1| 3) 0) (= |ULTIMATE.start_goodB2G_~k~0#1| 1) (= (select |#valid| 4) 1) (= (select |#length| 3) 18) (= (select |#valid| 1) 1) (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|) (= (+ |ULTIMATE.start_goodB2G_~data~0#1| 2147483648) 0) (= ~globalArgv~0.base 0) (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|) (= |ULTIMATE.start_goodG2B_~result~1#1| |ULTIMATE.start_goodG2B_~data~1#1|) (= (select |#valid| 0) 0) (= 54 (select |#length| 2)) (= (select |#length| 1) 1) (= (select |#valid| 2) 1) (= 16 (select |#length| 4)) (= |#NULL.offset| 0) (= ~globalFalse~0 0) (= |ULTIMATE.start_goodB2G_~i~1#1| 1) (= ~globalArgc~0 0) (= 5 ~globalFive~0) (< 0 |#StackHeapBarrier|) (= |#NULL.base| 0) (= ~globalTrue~0 1)) [2022-11-26 00:27:03,814 INFO L899 garLoopResultBuilder]: For program point L1585-1(lines 1580 1587) no Hoare annotation was computed. [2022-11-26 00:27:03,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-11-26 00:27:03,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1553) no Hoare annotation was computed. [2022-11-26 00:27:03,814 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 00:27:03,815 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1557) no Hoare annotation was computed. [2022-11-26 00:27:03,815 INFO L899 garLoopResultBuilder]: For program point L1561(line 1561) no Hoare annotation was computed. [2022-11-26 00:27:03,815 INFO L899 garLoopResultBuilder]: For program point L1561-1(line 1561) no Hoare annotation was computed. [2022-11-26 00:27:03,815 INFO L899 garLoopResultBuilder]: For program point L1557-2(line 1557) no Hoare annotation was computed. [2022-11-26 00:27:03,815 INFO L899 garLoopResultBuilder]: For program point L1557-3(line 1557) no Hoare annotation was computed. [2022-11-26 00:27:03,816 INFO L895 garLoopResultBuilder]: At program point L1557-4(lines 1557 1569) the Hoare annotation is: (let ((.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse3 (= (select (select |#memory_int| 1) 0) 0)) (.cse4 (= ~globalArgv~0.offset 0)) (.cse5 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse6 (= (select |#valid| 3) 1)) (.cse7 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse8 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse10 (= (select |#valid| 4) 1)) (.cse11 (= (select |#length| 3) 18)) (.cse12 (= (select |#valid| 1) 1)) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse14 (= (+ |ULTIMATE.start_goodB2G_~data~0#1| 2147483648) 0)) (.cse15 (= ~globalArgv~0.base 0)) (.cse16 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse17 (= (select |#valid| 0) 0)) (.cse18 (= 54 (select |#length| 2))) (.cse19 (= (select |#length| 1) 1)) (.cse20 (= (select |#valid| 2) 1)) (.cse21 (= 16 (select |#length| 4))) (.cse22 (= |#NULL.offset| 0)) (.cse23 (= ~globalFalse~0 0)) (.cse24 (= |ULTIMATE.start_goodB2G_~i~1#1| 1)) (.cse25 (= ~globalArgc~0 0)) (.cse26 (= 5 ~globalFive~0)) (.cse27 (< 0 |#StackHeapBarrier|)) (.cse28 (= |#NULL.base| 0)) (.cse29 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_goodB2G_~k~0#1| 1) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29) (and .cse0 (= |ULTIMATE.start_goodB2G_~k~0#1| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29))) [2022-11-26 00:27:03,816 INFO L899 garLoopResultBuilder]: For program point L1553-3(line 1553) no Hoare annotation was computed. [2022-11-26 00:27:03,816 INFO L899 garLoopResultBuilder]: For program point L1553-4(line 1553) no Hoare annotation was computed. [2022-11-26 00:27:03,817 INFO L895 garLoopResultBuilder]: At program point L1553-5(lines 1553 1556) the Hoare annotation is: (let ((.cse0 (= ~GLOBAL_CONST_FALSE~0 0)) (.cse1 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_main_~argv#1.offset|)) (.cse2 (= |ULTIMATE.start_main_~argc#1| |ULTIMATE.start_main_#in~argc#1|)) (.cse3 (= (select (select |#memory_int| 1) 0) 0)) (.cse4 (= ~globalArgv~0.offset 0)) (.cse5 (= 5 ~GLOBAL_CONST_FIVE~0)) (.cse6 (= (select |#valid| 3) 1)) (.cse7 (= ~GLOBAL_CONST_TRUE~0 1)) (.cse8 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_#in~argv#1.base|)) (.cse9 (= |ULTIMATE.start_main_#in~argv#1.base| |ULTIMATE.start_main_~argv#1.base|)) (.cse10 (= (select |#valid| 4) 1)) (.cse11 (= (select |#length| 3) 18)) (.cse12 (= (select |#valid| 1) 1)) (.cse13 (= |ULTIMATE.start_main_#in~argv#1.offset| |ULTIMATE.start_#in~argv#1.offset|)) (.cse14 (= ~globalArgv~0.base 0)) (.cse15 (= |ULTIMATE.start_main_#in~argc#1| |ULTIMATE.start_#in~argc#1|)) (.cse16 (= (select |#valid| 0) 0)) (.cse17 (= 54 (select |#length| 2))) (.cse18 (= (select |#length| 1) 1)) (.cse19 (= (select |#valid| 2) 1)) (.cse20 (= 16 (select |#length| 4))) (.cse21 (= |#NULL.offset| 0)) (.cse22 (= ~globalFalse~0 0)) (.cse23 (= ~globalArgc~0 0)) (.cse24 (= 5 ~globalFive~0)) (.cse25 (< 0 |#StackHeapBarrier|)) (.cse26 (= |#NULL.base| 0)) (.cse27 (= ~globalTrue~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |ULTIMATE.start_goodB2G_~data~0#1| 0) (= |ULTIMATE.start_goodB2G_~i~1#1| 0) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (= (+ |ULTIMATE.start_goodB2G_~data~0#1| 2147483648) 0) .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 (= |ULTIMATE.start_goodB2G_~i~1#1| 1) .cse23 .cse24 .cse25 .cse26 .cse27))) [2022-11-26 00:27:03,817 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1583) no Hoare annotation was computed. [2022-11-26 00:27:03,817 INFO L902 garLoopResultBuilder]: At program point L1599(line 1599) the Hoare annotation is: true [2022-11-26 00:27:03,817 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1561) no Hoare annotation was computed. [2022-11-26 00:27:03,817 INFO L902 garLoopResultBuilder]: At program point L1599-1(line 1599) the Hoare annotation is: true [2022-11-26 00:27:03,818 INFO L899 garLoopResultBuilder]: For program point L1583(line 1583) no Hoare annotation was computed. [2022-11-26 00:27:03,818 INFO L899 garLoopResultBuilder]: For program point L1583-1(line 1583) no Hoare annotation was computed. [2022-11-26 00:27:03,818 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1580) no Hoare annotation was computed. [2022-11-26 00:27:03,818 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1576) no Hoare annotation was computed. [2022-11-26 00:27:03,822 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:27:03,824 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:27:03,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:27:03 BoogieIcfgContainer [2022-11-26 00:27:03,866 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:27:03,866 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:27:03,867 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:27:03,867 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:27:03,867 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:26:49" (3/4) ... [2022-11-26 00:27:03,871 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:27:03,877 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-26 00:27:03,878 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-26 00:27:03,883 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 25 nodes and edges [2022-11-26 00:27:03,883 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2022-11-26 00:27:03,884 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-26 00:27:03,884 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:27:03,911 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && data == 0) && i == 0) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && data + 2147483648 == 0) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) [2022-11-26 00:27:03,912 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && data + 2147483648 == 0) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || ((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && k == 0) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && data + 2147483648 == 0) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) [2022-11-26 00:27:03,913 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((#NULL <= 0 && 0 <= data + 2147483648) && 0 <= globalArgv) && data + 2147483648 <= 0) && globalArgv <= 0) && 0 <= #NULL) && ((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) [2022-11-26 00:27:03,913 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && h <= 1) && 0 <= data + 3) && 5 <= globalFive) && argv == argv) && argc == \old(argc)) && 0 <= result + 3) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= j) && 1 <= h) && 1 <= k) && unknown-#memory_int-unknown[1][0] == 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && \valid[3] == 1) && argv == #in~argv) && #NULL <= 0) && argv == argv) && 0 <= data + 2147483648) && 1 <= GLOBAL_CONST_TRUE) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && argv == #in~argv) && #NULL <= 0) && data + 2147483648 <= 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && 0 <= globalArgv) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && j <= 1) && data + 3 <= 0) && 1 <= globalTrue) && k <= 1) && 0 <= #NULL) && globalFive <= 5) && 0 < unknown-#StackHeapBarrier-unknown) && i <= 1) && result + 3 <= 0) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && data + 2147483648 == 0) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) [2022-11-26 00:27:03,925 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:27:03,925 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:27:03,926 INFO L158 Benchmark]: Toolchain (without parser) took 16961.85ms. Allocated memory was 167.8MB in the beginning and 205.5MB in the end (delta: 37.7MB). Free memory was 131.0MB in the beginning and 124.7MB in the end (delta: 6.3MB). Peak memory consumption was 46.3MB. Max. memory is 16.1GB. [2022-11-26 00:27:03,926 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 167.8MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:27:03,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1421.15ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 67.5MB in the end (delta: 63.5MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2022-11-26 00:27:03,927 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.07ms. Allocated memory is still 167.8MB. Free memory was 67.5MB in the beginning and 64.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:27:03,927 INFO L158 Benchmark]: Boogie Preprocessor took 72.33ms. Allocated memory is still 167.8MB. Free memory was 64.5MB in the beginning and 63.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:27:03,928 INFO L158 Benchmark]: RCFGBuilder took 642.92ms. Allocated memory was 167.8MB in the beginning and 205.5MB in the end (delta: 37.7MB). Free memory was 63.4MB in the beginning and 168.5MB in the end (delta: -105.1MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2022-11-26 00:27:03,928 INFO L158 Benchmark]: TraceAbstraction took 14652.61ms. Allocated memory is still 205.5MB. Free memory was 167.4MB in the beginning and 127.9MB in the end (delta: 39.5MB). Peak memory consumption was 116.2MB. Max. memory is 16.1GB. [2022-11-26 00:27:03,928 INFO L158 Benchmark]: Witness Printer took 58.68ms. Allocated memory is still 205.5MB. Free memory was 127.9MB in the beginning and 124.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:27:03,930 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.30ms. Allocated memory is still 167.8MB. Free memory is still 136.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1421.15ms. Allocated memory is still 167.8MB. Free memory was 131.0MB in the beginning and 67.5MB in the end (delta: 63.5MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.07ms. Allocated memory is still 167.8MB. Free memory was 67.5MB in the beginning and 64.5MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.33ms. Allocated memory is still 167.8MB. Free memory was 64.5MB in the beginning and 63.4MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 642.92ms. Allocated memory was 167.8MB in the beginning and 205.5MB in the end (delta: 37.7MB). Free memory was 63.4MB in the beginning and 168.5MB in the end (delta: -105.1MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14652.61ms. Allocated memory is still 205.5MB. Free memory was 167.4MB in the beginning and 127.9MB in the end (delta: 39.5MB). Peak memory consumption was 116.2MB. Max. memory is 16.1GB. * Witness Printer took 58.68ms. Allocated memory is still 205.5MB. Free memory was 127.9MB in the beginning and 124.7MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * 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: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1553]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1561]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1557]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1576]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1583]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1580]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 12 error locations. Started 1 CEGAR loops. OverallTime: 14.5s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.5s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 134 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 125 mSDsluCounter, 710 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 404 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 521 IncrementalHoareTripleChecker+Invalid, 535 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 306 mSDtfsCounter, 521 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 200 GetRequests, 139 SyntacticMatches, 4 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, InterpolantAutomatonStates: 61, 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, 12 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 30 PreInvPairs, 42 NumberOfFragments, 1404 HoareAnnotationTreeSize, 30 FomulaSimplifications, 63 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 1516 FormulaSimplificationTreeSizeReductionInter, 2.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 342 ConstructedInterpolants, 0 QuantifiedInterpolants, 610 SizeOfPredicates, 3 NumberOfNonLiveVariables, 487 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 17 InterpolantComputations, 11 PerfectInterpolantSequences, 77/85 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: OVERALL_TIME: 1.6s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 31, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 49, TOOLS_POST_TIME: 0.7s, TOOLS_POST_CALL_APPLICATIONS: 13, TOOLS_POST_CALL_TIME: 0.2s, TOOLS_POST_RETURN_APPLICATIONS: 10, TOOLS_POST_RETURN_TIME: 0.1s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 69, TOOLS_QUANTIFIERELIM_TIME: 0.9s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.1s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 108, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 18, DOMAIN_JOIN_TIME: 0.5s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 5, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 31, DOMAIN_ISBOTTOM_TIME: 0.1s, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME: 0.2s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.2s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 5, CALL_SUMMARIZER_APPLICATIONS: 10, CALL_SUMMARIZER_CACHE_MISSES: 2, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 1380, DAG_COMPRESSION_RETAINED_NODES: 111, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold - InvariantResult [Line: 1576]: Loop Invariant Derived loop invariant: (((((#NULL <= 0 && 0 <= data + 2147483648) && 0 <= globalArgv) && data + 2147483648 <= 0) && globalArgv <= 0) && 0 <= #NULL) && ((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && data == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && h == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1)) - InvariantResult [Line: 1580]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= GLOBAL_CONST_FALSE && globalTrue <= 1) && 1 <= i) && globalArgc <= 0) && 0 <= #NULL) && h <= 1) && 0 <= data + 3) && 5 <= globalFive) && argv == argv) && argc == \old(argc)) && 0 <= result + 3) && 5 <= GLOBAL_CONST_FIVE) && GLOBAL_CONST_TRUE <= 1) && globalArgv <= 0) && 1 <= j) && 1 <= h) && 1 <= k) && unknown-#memory_int-unknown[1][0] == 0) && globalFalse <= 0) && GLOBAL_CONST_FIVE <= 5) && \valid[3] == 1) && argv == #in~argv) && #NULL <= 0) && argv == argv) && 0 <= data + 2147483648) && 1 <= GLOBAL_CONST_TRUE) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && 0 <= globalFalse) && 0 <= globalArgc) && 0 <= globalArgv) && argv == #in~argv) && #NULL <= 0) && data + 2147483648 <= 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && globalArgv <= 0) && GLOBAL_CONST_FALSE <= 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && 0 <= globalArgv) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && j <= 1) && data + 3 <= 0) && 1 <= globalTrue) && k <= 1) && 0 <= #NULL) && globalFive <= 5) && 0 < unknown-#StackHeapBarrier-unknown) && i <= 1) && result + 3 <= 0) || (((((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && h == 1) && j == 0) && argv == argv) && argc == \old(argc)) && data + 2 == 0) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && data + 2147483648 == 0) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) - InvariantResult [Line: 1599]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1553]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && data == 0) && i == 0) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || (((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && data + 2147483648 == 0) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) - InvariantResult [Line: 1557]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && k == 1) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && data + 2147483648 == 0) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) || ((((((((((((((((((((((((((((((GLOBAL_CONST_FALSE == 0 && k == 0) && argv == argv) && argc == \old(argc)) && unknown-#memory_int-unknown[1][0] == 0) && globalArgv == 0) && 5 == GLOBAL_CONST_FIVE) && \valid[3] == 1) && GLOBAL_CONST_TRUE == 1) && argv == #in~argv) && argv == argv) && \valid[4] == 1) && unknown-#length-unknown[3] == 18) && \valid[1] == 1) && argv == #in~argv) && data + 2147483648 == 0) && globalArgv == 0) && \old(argc) == unknown-#in~argc-unknown) && \valid[0] == 0) && 54 == unknown-#length-unknown[2]) && unknown-#length-unknown[1] == 1) && \valid[2] == 1) && 16 == unknown-#length-unknown[4]) && #NULL == 0) && globalFalse == 0) && i == 1) && globalArgc == 0) && 5 == globalFive) && 0 < unknown-#StackHeapBarrier-unknown) && #NULL == 0) && globalTrue == 1) RESULT: Ultimate proved your program to be correct! [2022-11-26 00:27:03,975 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c90b3991-d311-418f-8072-981a54ab9d63/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE