./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc01d14-b310-4ef3-a73a-30bb74f39a93/bin/utaipan-ByfvJB40ur/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc01d14-b310-4ef3-a73a-30bb74f39a93/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_3cc01d14-b310-4ef3-a73a-30bb74f39a93/bin/utaipan-ByfvJB40ur/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc01d14-b310-4ef3-a73a-30bb74f39a93/bin/utaipan-ByfvJB40ur/config/TaipanReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc01d14-b310-4ef3-a73a-30bb74f39a93/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_3cc01d14-b310-4ef3-a73a-30bb74f39a93/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 e411e25efa395b2066014373809f3d89b500cfc19105740762839f91a25dfcfd --- 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:18:56,991 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-26 00:18:56,993 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-26 00:18:57,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-26 00:18:57,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-26 00:18:57,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-26 00:18:57,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-26 00:18:57,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-26 00:18:57,023 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-26 00:18:57,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-26 00:18:57,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-26 00:18:57,027 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-26 00:18:57,027 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-26 00:18:57,028 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-26 00:18:57,030 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-26 00:18:57,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-26 00:18:57,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-26 00:18:57,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-26 00:18:57,035 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-26 00:18:57,038 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-26 00:18:57,040 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-26 00:18:57,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-26 00:18:57,047 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-26 00:18:57,048 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-26 00:18:57,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-26 00:18:57,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-26 00:18:57,053 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-26 00:18:57,054 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-26 00:18:57,055 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-26 00:18:57,056 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-26 00:18:57,056 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-26 00:18:57,057 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-26 00:18:57,069 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-26 00:18:57,070 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-26 00:18:57,071 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-26 00:18:57,071 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-26 00:18:57,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-26 00:18:57,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-26 00:18:57,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-26 00:18:57,074 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-26 00:18:57,075 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-26 00:18:57,078 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc01d14-b310-4ef3-a73a-30bb74f39a93/bin/utaipan-ByfvJB40ur/config/svcomp-Overflow-64bit-Taipan_Default.epf [2022-11-26 00:18:57,124 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-26 00:18:57,124 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-26 00:18:57,124 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-26 00:18:57,124 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-26 00:18:57,125 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-26 00:18:57,125 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-26 00:18:57,126 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-26 00:18:57,126 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-26 00:18:57,126 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-26 00:18:57,132 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-26 00:18:57,133 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-26 00:18:57,134 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-26 00:18:57,134 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-26 00:18:57,134 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-26 00:18:57,134 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-26 00:18:57,135 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-26 00:18:57,135 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-26 00:18:57,135 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-26 00:18:57,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-26 00:18:57,136 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-26 00:18:57,136 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-26 00:18:57,137 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-26 00:18:57,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-26 00:18:57,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-26 00:18:57,138 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-26 00:18:57,138 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-26 00:18:57,138 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-26 00:18:57,139 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-26 00:18:57,139 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-26 00:18:57,139 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-26 00:18:57,139 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-26 00:18:57,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:18:57,140 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-26 00:18:57,140 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-26 00:18:57,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-26 00:18:57,141 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-26 00:18:57,141 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-26 00:18:57,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-26 00:18:57,141 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-26 00:18:57,142 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-26 00:18:57,142 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_3cc01d14-b310-4ef3-a73a-30bb74f39a93/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_3cc01d14-b310-4ef3-a73a-30bb74f39a93/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 -> e411e25efa395b2066014373809f3d89b500cfc19105740762839f91a25dfcfd [2022-11-26 00:18:57,414 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-26 00:18:57,436 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-26 00:18:57,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-26 00:18:57,440 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-26 00:18:57,440 INFO L275 PluginConnector]: CDTParser initialized [2022-11-26 00:18:57,441 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc01d14-b310-4ef3-a73a-30bb74f39a93/bin/utaipan-ByfvJB40ur/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_15_good.i [2022-11-26 00:19:00,604 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-26 00:19:01,013 INFO L351 CDTParser]: Found 1 translation units. [2022-11-26 00:19:01,014 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc01d14-b310-4ef3-a73a-30bb74f39a93/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_rand_postinc_15_good.i [2022-11-26 00:19:01,040 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc01d14-b310-4ef3-a73a-30bb74f39a93/bin/utaipan-ByfvJB40ur/data/2542d9aeb/b8b3de8265874e0cbdebb22ec226c9bc/FLAGb9b5c0776 [2022-11-26 00:19:01,054 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc01d14-b310-4ef3-a73a-30bb74f39a93/bin/utaipan-ByfvJB40ur/data/2542d9aeb/b8b3de8265874e0cbdebb22ec226c9bc [2022-11-26 00:19:01,057 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-26 00:19:01,058 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-26 00:19:01,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-26 00:19:01,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-26 00:19:01,069 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-26 00:19:01,069 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:19:01" (1/1) ... [2022-11-26 00:19:01,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f0c0d0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:01, skipping insertion in model container [2022-11-26 00:19:01,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 12:19:01" (1/1) ... [2022-11-26 00:19:01,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-26 00:19:01,138 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-26 00:19:01,494 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-26 00:19:02,009 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-26 00:19:02,014 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-26 00:19:02,017 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-26 00:19:02,031 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-26 00:19:02,032 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-26 00:19:02,127 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-26 00:19:02,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:19:02,144 INFO L203 MainTranslator]: Completed pre-run [2022-11-26 00:19:02,182 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-26 00:19:02,257 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-26 00:19:02,262 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-26 00:19:02,264 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-26 00:19:02,270 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-26 00:19:02,271 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-26 00:19:02,305 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-26 00:19:02,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-26 00:19:02,474 INFO L208 MainTranslator]: Completed translation [2022-11-26 00:19:02,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02 WrapperNode [2022-11-26 00:19:02,475 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-26 00:19:02,476 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-26 00:19:02,476 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-26 00:19:02,476 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-26 00:19:02,483 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:19:02" (1/1) ... [2022-11-26 00:19:02,509 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:19:02" (1/1) ... [2022-11-26 00:19:02,547 INFO L138 Inliner]: procedures = 503, calls = 81, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 193 [2022-11-26 00:19:02,548 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-26 00:19:02,549 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-26 00:19:02,549 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-26 00:19:02,549 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-26 00:19:02,559 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,572 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,575 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,578 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,580 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,584 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-26 00:19:02,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-26 00:19:02,597 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-26 00:19:02,597 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-26 00:19:02,598 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (1/1) ... [2022-11-26 00:19:02,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-26 00:19:02,624 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc01d14-b310-4ef3-a73a-30bb74f39a93/bin/utaipan-ByfvJB40ur/z3 [2022-11-26 00:19:02,642 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc01d14-b310-4ef3-a73a-30bb74f39a93/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-26 00:19:02,668 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc01d14-b310-4ef3-a73a-30bb74f39a93/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-26 00:19:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-26 00:19:02,692 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-26 00:19:02,692 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-26 00:19:02,693 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-26 00:19:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-26 00:19:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-26 00:19:02,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-26 00:19:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-26 00:19:02,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-26 00:19:02,923 INFO L235 CfgBuilder]: Building ICFG [2022-11-26 00:19:02,925 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-26 00:19:03,266 INFO L276 CfgBuilder]: Performing block encoding [2022-11-26 00:19:03,356 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-26 00:19:03,357 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-26 00:19:03,359 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:19:03 BoogieIcfgContainer [2022-11-26 00:19:03,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-26 00:19:03,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-26 00:19:03,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-26 00:19:03,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-26 00:19:03,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 12:19:01" (1/3) ... [2022-11-26 00:19:03,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45430062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:19:03, skipping insertion in model container [2022-11-26 00:19:03,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 12:19:02" (2/3) ... [2022-11-26 00:19:03,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45430062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 12:19:03, skipping insertion in model container [2022-11-26 00:19:03,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:19:03" (3/3) ... [2022-11-26 00:19:03,371 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_rand_postinc_15_good.i [2022-11-26 00:19:03,403 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-26 00:19:03,404 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-26 00:19:03,471 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-26 00:19:03,480 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;@be36b1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-26 00:19:03,481 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-26 00:19:03,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 60 states have internal predecessors, (63), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-26 00:19:03,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-26 00:19:03,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:03,499 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:03,500 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:19:03,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:03,510 INFO L85 PathProgramCache]: Analyzing trace with hash -2051026873, now seen corresponding path program 1 times [2022-11-26 00:19:03,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:03,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36220079] [2022-11-26 00:19:03,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:03,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:04,101 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:19:04,102 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:04,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36220079] [2022-11-26 00:19:04,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36220079] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:04,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:04,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:19:04,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980789337] [2022-11-26 00:19:04,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:04,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:19:04,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:04,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:19:04,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:19:04,177 INFO L87 Difference]: Start difference. First operand has 65 states, 38 states have (on average 1.6578947368421053) internal successors, (63), 60 states have internal predecessors, (63), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (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:19:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:04,338 INFO L93 Difference]: Finished difference Result 65 states and 95 transitions. [2022-11-26 00:19:04,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:19:04,341 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (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 11 [2022-11-26 00:19:04,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:04,351 INFO L225 Difference]: With dead ends: 65 [2022-11-26 00:19:04,352 INFO L226 Difference]: Without dead ends: 57 [2022-11-26 00:19:04,355 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:19:04,361 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 55 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:04,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 172 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-26 00:19:04,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-26 00:19:04,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-26 00:19:04,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 35 states have (on average 1.6) internal successors, (56), 53 states have internal predecessors, (56), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:19:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 82 transitions. [2022-11-26 00:19:04,426 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 82 transitions. Word has length 11 [2022-11-26 00:19:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:04,429 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 82 transitions. [2022-11-26 00:19:04,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (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:19:04,430 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 82 transitions. [2022-11-26 00:19:04,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-26 00:19:04,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:04,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:04,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-26 00:19:04,434 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:19:04,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:04,435 INFO L85 PathProgramCache]: Analyzing trace with hash 842676457, now seen corresponding path program 1 times [2022-11-26 00:19:04,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:04,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560953473] [2022-11-26 00:19:04,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:04,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:04,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:04,619 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:19:04,619 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:04,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560953473] [2022-11-26 00:19:04,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560953473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:04,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:04,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:19:04,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648492491] [2022-11-26 00:19:04,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:04,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:19:04,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:04,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:19:04,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:19:04,624 INFO L87 Difference]: Start difference. First operand 57 states and 82 transitions. Second operand has 3 states, 2 states have (on average 5.0) 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:19:04,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:04,667 INFO L93 Difference]: Finished difference Result 57 states and 82 transitions. [2022-11-26 00:19:04,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:19:04,669 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) 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:19:04,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:04,675 INFO L225 Difference]: With dead ends: 57 [2022-11-26 00:19:04,675 INFO L226 Difference]: Without dead ends: 56 [2022-11-26 00:19:04,679 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:19:04,680 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 0 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:04,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:19:04,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-26 00:19:04,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-26 00:19:04,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.5714285714285714) internal successors, (55), 52 states have internal predecessors, (55), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:19:04,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 81 transitions. [2022-11-26 00:19:04,691 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 81 transitions. Word has length 12 [2022-11-26 00:19:04,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:04,691 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 81 transitions. [2022-11-26 00:19:04,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) 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:19:04,691 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 81 transitions. [2022-11-26 00:19:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-26 00:19:04,692 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:04,692 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:04,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-26 00:19:04,693 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:19:04,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:04,698 INFO L85 PathProgramCache]: Analyzing trace with hash 398523139, now seen corresponding path program 1 times [2022-11-26 00:19:04,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:04,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842260247] [2022-11-26 00:19:04,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:04,817 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:19:04,817 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:04,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842260247] [2022-11-26 00:19:04,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842260247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:04,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:04,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:19:04,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518020774] [2022-11-26 00:19:04,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:04,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:19:04,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:04,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:19:04,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:19:04,821 INFO L87 Difference]: Start difference. First operand 56 states and 81 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:19:04,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:04,895 INFO L93 Difference]: Finished difference Result 97 states and 137 transitions. [2022-11-26 00:19:04,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:19:04,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2022-11-26 00:19:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:04,900 INFO L225 Difference]: With dead ends: 97 [2022-11-26 00:19:04,900 INFO L226 Difference]: Without dead ends: 56 [2022-11-26 00:19:04,901 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:19:04,905 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 5 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:04,906 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:19:04,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-26 00:19:04,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-26 00:19:04,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 35 states have (on average 1.542857142857143) internal successors, (54), 51 states have internal predecessors, (54), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-26 00:19:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2022-11-26 00:19:04,929 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 15 [2022-11-26 00:19:04,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:04,929 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2022-11-26 00:19:04,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:19:04,929 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2022-11-26 00:19:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-26 00:19:04,930 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:04,931 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:04,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-26 00:19:04,931 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:19:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:04,932 INFO L85 PathProgramCache]: Analyzing trace with hash 712796123, now seen corresponding path program 1 times [2022-11-26 00:19:04,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:04,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383270082] [2022-11-26 00:19:04,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:04,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:05,028 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:19:05,028 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:05,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383270082] [2022-11-26 00:19:05,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383270082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:05,029 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:05,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:19:05,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073638512] [2022-11-26 00:19:05,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:05,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:19:05,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:05,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:19:05,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:19:05,031 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:19:05,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:05,085 INFO L93 Difference]: Finished difference Result 97 states and 136 transitions. [2022-11-26 00:19:05,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:19:05,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 17 [2022-11-26 00:19:05,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:05,087 INFO L225 Difference]: With dead ends: 97 [2022-11-26 00:19:05,087 INFO L226 Difference]: Without dead ends: 55 [2022-11-26 00:19:05,089 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:19:05,090 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:05,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:19:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-26 00:19:05,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-26 00:19:05,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 50 states have internal predecessors, (53), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-26 00:19:05,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 77 transitions. [2022-11-26 00:19:05,108 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 77 transitions. Word has length 17 [2022-11-26 00:19:05,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:05,109 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 77 transitions. [2022-11-26 00:19:05,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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:19:05,110 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 77 transitions. [2022-11-26 00:19:05,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-26 00:19:05,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:05,112 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:05,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-26 00:19:05,112 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:19:05,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:05,114 INFO L85 PathProgramCache]: Analyzing trace with hash 1125845846, now seen corresponding path program 1 times [2022-11-26 00:19:05,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:05,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985510956] [2022-11-26 00:19:05,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:05,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:19:05,327 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:05,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985510956] [2022-11-26 00:19:05,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985510956] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:05,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:05,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:19:05,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819774902] [2022-11-26 00:19:05,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:05,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:19:05,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:05,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:19:05,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:19:05,335 INFO L87 Difference]: Start difference. First operand 55 states and 77 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:19:05,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:05,390 INFO L93 Difference]: Finished difference Result 55 states and 77 transitions. [2022-11-26 00:19:05,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:19:05,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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 19 [2022-11-26 00:19:05,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:05,392 INFO L225 Difference]: With dead ends: 55 [2022-11-26 00:19:05,392 INFO L226 Difference]: Without dead ends: 54 [2022-11-26 00:19:05,393 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:19:05,394 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 34 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:05,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 151 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:19:05,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-26 00:19:05,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-26 00:19:05,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.4857142857142858) internal successors, (52), 49 states have internal predecessors, (52), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-26 00:19:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2022-11-26 00:19:05,403 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 19 [2022-11-26 00:19:05,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:05,403 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2022-11-26 00:19:05,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 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:19:05,404 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2022-11-26 00:19:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-26 00:19:05,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:05,405 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:19:05,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-26 00:19:05,405 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:19:05,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:05,406 INFO L85 PathProgramCache]: Analyzing trace with hash 541482979, now seen corresponding path program 1 times [2022-11-26 00:19:05,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:05,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683884898] [2022-11-26 00:19:05,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:05,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:19:05,587 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:05,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683884898] [2022-11-26 00:19:05,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683884898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:05,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:05,588 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-26 00:19:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226996648] [2022-11-26 00:19:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:05,589 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:19:05,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:05,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:19:05,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:19:05,590 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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:19:05,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:05,634 INFO L93 Difference]: Finished difference Result 54 states and 76 transitions. [2022-11-26 00:19:05,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:19:05,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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:19:05,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:05,638 INFO L225 Difference]: With dead ends: 54 [2022-11-26 00:19:05,639 INFO L226 Difference]: Without dead ends: 53 [2022-11-26 00:19:05,639 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:19:05,641 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 0 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 127 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:19:05,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:19:05,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-26 00:19:05,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-26 00:19:05,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 35 states have (on average 1.457142857142857) internal successors, (51), 48 states have internal predecessors, (51), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-26 00:19:05,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 75 transitions. [2022-11-26 00:19:05,659 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 75 transitions. Word has length 20 [2022-11-26 00:19:05,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:05,659 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 75 transitions. [2022-11-26 00:19:05,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 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:19:05,660 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 75 transitions. [2022-11-26 00:19:05,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-26 00:19:05,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:05,666 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] [2022-11-26 00:19:05,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-26 00:19:05,668 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:19:05,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash -431070686, now seen corresponding path program 1 times [2022-11-26 00:19:05,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:05,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140065408] [2022-11-26 00:19:05,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:05,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:05,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:05,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-26 00:19:05,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:05,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140065408] [2022-11-26 00:19:05,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140065408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:05,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:05,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:19:05,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418271794] [2022-11-26 00:19:05,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:05,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:19:05,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:05,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:19:05,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:19:05,762 INFO L87 Difference]: Start difference. First operand 53 states and 75 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:19:05,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:05,803 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2022-11-26 00:19:05,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:19:05,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:19:05,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:05,805 INFO L225 Difference]: With dead ends: 79 [2022-11-26 00:19:05,806 INFO L226 Difference]: Without dead ends: 51 [2022-11-26 00:19:05,807 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:19:05,807 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:05,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 113 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:19:05,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-26 00:19:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-26 00:19:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.411764705882353) internal successors, (48), 45 states have internal predecessors, (48), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:19:05,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 70 transitions. [2022-11-26 00:19:05,822 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 70 transitions. Word has length 23 [2022-11-26 00:19:05,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:05,823 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 70 transitions. [2022-11-26 00:19:05,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 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:19:05,824 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 70 transitions. [2022-11-26 00:19:05,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-26 00:19:05,824 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:05,825 INFO L195 NwaCegarLoop]: trace histogram [3, 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:19:05,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-26 00:19:05,826 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:19:05,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:05,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1542246642, now seen corresponding path program 1 times [2022-11-26 00:19:05,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:05,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479776119] [2022-11-26 00:19:05,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:05,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:05,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:05,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:19:05,954 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:05,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479776119] [2022-11-26 00:19:05,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [479776119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:05,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:05,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:19:05,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378823697] [2022-11-26 00:19:05,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:05,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:19:05,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:05,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:19:05,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:19:05,959 INFO L87 Difference]: Start difference. First operand 51 states and 70 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 00:19:06,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:06,027 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2022-11-26 00:19:06,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:19:06,029 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 26 [2022-11-26 00:19:06,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:06,031 INFO L225 Difference]: With dead ends: 69 [2022-11-26 00:19:06,031 INFO L226 Difference]: Without dead ends: 67 [2022-11-26 00:19:06,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:19:06,033 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 16 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 177 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:19:06,033 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 177 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:19:06,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-26 00:19:06,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 55. [2022-11-26 00:19:06,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 38 states have (on average 1.394736842105263) internal successors, (53), 48 states have internal predecessors, (53), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-26 00:19:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 75 transitions. [2022-11-26 00:19:06,061 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 75 transitions. Word has length 26 [2022-11-26 00:19:06,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:06,063 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 75 transitions. [2022-11-26 00:19:06,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 00:19:06,063 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 75 transitions. [2022-11-26 00:19:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-26 00:19:06,065 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:06,065 INFO L195 NwaCegarLoop]: trace histogram [4, 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:19:06,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-26 00:19:06,065 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:19:06,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:06,066 INFO L85 PathProgramCache]: Analyzing trace with hash -342909150, now seen corresponding path program 1 times [2022-11-26 00:19:06,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:06,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246347892] [2022-11-26 00:19:06,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:06,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:06,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-26 00:19:06,134 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:06,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246347892] [2022-11-26 00:19:06,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246347892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:06,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:06,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:19:06,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110405816] [2022-11-26 00:19:06,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:06,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:19:06,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:06,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:19:06,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:19:06,136 INFO L87 Difference]: Start difference. First operand 55 states and 75 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-26 00:19:06,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:06,166 INFO L93 Difference]: Finished difference Result 72 states and 95 transitions. [2022-11-26 00:19:06,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:19:06,167 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 29 [2022-11-26 00:19:06,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:06,167 INFO L225 Difference]: With dead ends: 72 [2022-11-26 00:19:06,168 INFO L226 Difference]: Without dead ends: 48 [2022-11-26 00:19:06,168 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:19:06,169 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:06,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:19:06,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-26 00:19:06,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-26 00:19:06,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 42 states have internal predecessors, (45), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-26 00:19:06,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 65 transitions. [2022-11-26 00:19:06,176 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 65 transitions. Word has length 29 [2022-11-26 00:19:06,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:06,176 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 65 transitions. [2022-11-26 00:19:06,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-26 00:19:06,177 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 65 transitions. [2022-11-26 00:19:06,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-26 00:19:06,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:06,178 INFO L195 NwaCegarLoop]: trace histogram [3, 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:19:06,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-26 00:19:06,178 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:19:06,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:06,178 INFO L85 PathProgramCache]: Analyzing trace with hash -826802954, now seen corresponding path program 1 times [2022-11-26 00:19:06,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:06,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906870337] [2022-11-26 00:19:06,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:06,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:19:06,229 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:06,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906870337] [2022-11-26 00:19:06,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906870337] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:06,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:06,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:19:06,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141648347] [2022-11-26 00:19:06,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:06,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:19:06,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:06,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:19:06,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:19:06,231 INFO L87 Difference]: Start difference. First operand 48 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 00:19:06,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:06,262 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-11-26 00:19:06,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:19:06,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 31 [2022-11-26 00:19:06,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:06,263 INFO L225 Difference]: With dead ends: 60 [2022-11-26 00:19:06,263 INFO L226 Difference]: Without dead ends: 46 [2022-11-26 00:19:06,264 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:19:06,264 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 3 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:06,265 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 96 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:19:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-26 00:19:06,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-26 00:19:06,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 39 states have internal predecessors, (42), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-26 00:19:06,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 60 transitions. [2022-11-26 00:19:06,271 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 60 transitions. Word has length 31 [2022-11-26 00:19:06,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:06,271 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 60 transitions. [2022-11-26 00:19:06,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-26 00:19:06,272 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 60 transitions. [2022-11-26 00:19:06,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-26 00:19:06,273 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:06,273 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1] [2022-11-26 00:19:06,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-26 00:19:06,273 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:19:06,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:06,274 INFO L85 PathProgramCache]: Analyzing trace with hash -75239172, now seen corresponding path program 1 times [2022-11-26 00:19:06,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:06,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313759371] [2022-11-26 00:19:06,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:06,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:06,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:19:06,383 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:06,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313759371] [2022-11-26 00:19:06,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313759371] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:06,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:06,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:19:06,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125383062] [2022-11-26 00:19:06,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:06,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-26 00:19:06,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:06,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-26 00:19:06,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-26 00:19:06,385 INFO L87 Difference]: Start difference. First operand 46 states and 60 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-26 00:19:06,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:06,432 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2022-11-26 00:19:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-26 00:19:06,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-11-26 00:19:06,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:06,434 INFO L225 Difference]: With dead ends: 52 [2022-11-26 00:19:06,434 INFO L226 Difference]: Without dead ends: 46 [2022-11-26 00:19:06,434 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:19:06,435 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 3 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:06,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 145 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:19:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-26 00:19:06,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-26 00:19:06,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 39 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-26 00:19:06,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2022-11-26 00:19:06,443 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 35 [2022-11-26 00:19:06,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:06,443 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2022-11-26 00:19:06,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-26 00:19:06,444 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2022-11-26 00:19:06,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-26 00:19:06,445 INFO L187 NwaCegarLoop]: Found error trace [2022-11-26 00:19:06,445 INFO L195 NwaCegarLoop]: trace histogram [3, 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, 1, 1, 1, 1] [2022-11-26 00:19:06,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-26 00:19:06,445 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-26 00:19:06,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-26 00:19:06,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1964337668, now seen corresponding path program 1 times [2022-11-26 00:19:06,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-26 00:19:06,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613648781] [2022-11-26 00:19:06,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-26 00:19:06,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-26 00:19:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-26 00:19:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-26 00:19:06,511 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-26 00:19:06,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613648781] [2022-11-26 00:19:06,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613648781] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-26 00:19:06,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-26 00:19:06,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-26 00:19:06,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781991005] [2022-11-26 00:19:06,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-26 00:19:06,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-26 00:19:06,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-26 00:19:06,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-26 00:19:06,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-26 00:19:06,515 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-26 00:19:06,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-26 00:19:06,543 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2022-11-26 00:19:06,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-26 00:19:06,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 36 [2022-11-26 00:19:06,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-26 00:19:06,545 INFO L225 Difference]: With dead ends: 48 [2022-11-26 00:19:06,545 INFO L226 Difference]: Without dead ends: 0 [2022-11-26 00:19:06,546 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:19:06,546 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-26 00:19:06,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 80 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-26 00:19:06,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-26 00:19:06,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-26 00:19:06,548 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:19:06,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-26 00:19:06,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2022-11-26 00:19:06,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-26 00:19:06,549 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-26 00:19:06,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-26 00:19:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-26 00:19:06,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-26 00:19:06,552 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-26 00:19:06,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-26 00:19:06,553 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-26 00:19:06,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-26 00:19:06,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-26 00:19:06,554 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-26 00:19:06,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-26 00:19:06,555 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-26 00:19:06,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-26 00:19:06,557 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-26 00:19:06,702 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-26 00:19:06,702 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-26 00:19:06,703 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-26 00:19:06,703 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-26 00:19:06,703 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1598) no Hoare annotation was computed. [2022-11-26 00:19:06,703 INFO L895 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) [2022-11-26 00:19:06,703 INFO L899 garLoopResultBuilder]: For program point L1629(line 1629) no Hoare annotation was computed. [2022-11-26 00:19:06,704 INFO L899 garLoopResultBuilder]: For program point L1596(lines 1596 1605) no Hoare annotation was computed. [2022-11-26 00:19:06,704 INFO L899 garLoopResultBuilder]: For program point L1629-1(line 1629) no Hoare annotation was computed. [2022-11-26 00:19:06,704 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-11-26 00:19:06,704 INFO L899 garLoopResultBuilder]: For program point L1654(line 1654) no Hoare annotation was computed. [2022-11-26 00:19:06,704 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-26 00:19:06,704 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-26 00:19:06,704 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-26 00:19:06,705 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2022-11-26 00:19:06,705 INFO L899 garLoopResultBuilder]: For program point L1589(line 1589) no Hoare annotation was computed. [2022-11-26 00:19:06,705 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-26 00:19:06,705 INFO L895 garLoopResultBuilder]: At program point L1631(line 1631) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch115#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-26 00:19:06,705 INFO L899 garLoopResultBuilder]: For program point L1598(line 1598) no Hoare annotation was computed. [2022-11-26 00:19:06,705 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2022-11-26 00:19:06,706 INFO L899 garLoopResultBuilder]: For program point L1656(line 1656) no Hoare annotation was computed. [2022-11-26 00:19:06,706 INFO L899 garLoopResultBuilder]: For program point L1656-1(line 1656) no Hoare annotation was computed. [2022-11-26 00:19:06,706 INFO L895 garLoopResultBuilder]: At program point L1590(line 1590) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-26 00:19:06,706 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-11-26 00:19:06,706 INFO L899 garLoopResultBuilder]: For program point L1648(line 1648) no Hoare annotation was computed. [2022-11-26 00:19:06,706 INFO L899 garLoopResultBuilder]: For program point L1607(line 1607) no Hoare annotation was computed. [2022-11-26 00:19:06,707 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-26 00:19:06,708 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) [2022-11-26 00:19:06,708 INFO L895 garLoopResultBuilder]: At program point L1649(line 1649) the Hoare annotation is: false [2022-11-26 00:19:06,708 INFO L895 garLoopResultBuilder]: At program point L1616(lines 1616 1624) the Hoare annotation is: (and (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-26 00:19:06,708 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) the Hoare annotation is: false [2022-11-26 00:19:06,708 INFO L895 garLoopResultBuilder]: At program point L1575(line 1575) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch101#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-26 00:19:06,709 INFO L895 garLoopResultBuilder]: At program point L1600(line 1600) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch112#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-26 00:19:06,710 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1576) no Hoare annotation was computed. [2022-11-26 00:19:06,710 INFO L895 garLoopResultBuilder]: At program point L1658(line 1658) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) [2022-11-26 00:19:06,710 INFO L895 garLoopResultBuilder]: At program point L1625(lines 1625 1637) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch115#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-26 00:19:06,711 INFO L895 garLoopResultBuilder]: At program point L1584(lines 1584 1592) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-26 00:19:06,711 INFO L899 garLoopResultBuilder]: For program point L1634(line 1634) no Hoare annotation was computed. [2022-11-26 00:19:06,711 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-26 00:19:06,711 INFO L895 garLoopResultBuilder]: At program point L1593(lines 1593 1610) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch112#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-26 00:19:06,711 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2022-11-26 00:19:06,712 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) [2022-11-26 00:19:06,712 INFO L902 garLoopResultBuilder]: At program point L1676(line 1676) the Hoare annotation is: true [2022-11-26 00:19:06,712 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2022-11-26 00:19:06,712 INFO L895 garLoopResultBuilder]: At program point L1643(lines 1643 1651) the Hoare annotation is: (and (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (= |ULTIMATE.start_goodG2B2_~data~3#1| 2) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-26 00:19:06,712 INFO L895 garLoopResultBuilder]: At program point L1635(line 1635) the Hoare annotation is: false [2022-11-26 00:19:06,712 INFO L899 garLoopResultBuilder]: For program point L1569(line 1569) no Hoare annotation was computed. [2022-11-26 00:19:06,712 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-26 00:19:06,713 INFO L899 garLoopResultBuilder]: For program point L1569-1(line 1569) no Hoare annotation was computed. [2022-11-26 00:19:06,713 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-26 00:19:06,713 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2022-11-26 00:19:06,713 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1578) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch101#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-26 00:19:06,713 INFO L895 garLoopResultBuilder]: At program point L1652(lines 1652 1664) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) [2022-11-26 00:19:06,713 INFO L895 garLoopResultBuilder]: At program point L1619(line 1619) the Hoare annotation is: false [2022-11-26 00:19:06,714 INFO L899 garLoopResultBuilder]: For program point L1586(line 1586) no Hoare annotation was computed. [2022-11-26 00:19:06,714 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1598) no Hoare annotation was computed. [2022-11-26 00:19:06,714 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-11-26 00:19:06,714 INFO L899 garLoopResultBuilder]: For program point L1595(line 1595) no Hoare annotation was computed. [2022-11-26 00:19:06,714 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-26 00:19:06,714 INFO L895 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) [2022-11-26 00:19:06,714 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-26 00:19:06,715 INFO L895 garLoopResultBuilder]: At program point L1678-1(line 1678) the Hoare annotation is: (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) [2022-11-26 00:19:06,715 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-26 00:19:06,715 INFO L895 garLoopResultBuilder]: At program point L1604(line 1604) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch112#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648)) (<= 0 (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648))) [2022-11-26 00:19:06,715 INFO L895 garLoopResultBuilder]: At program point L1571(line 1571) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch101#1| (<= 0 (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648))) [2022-11-26 00:19:06,719 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-26 00:19:06,721 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-26 00:19:06,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 12:19:06 BoogieIcfgContainer [2022-11-26 00:19:06,749 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-26 00:19:06,749 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-26 00:19:06,749 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-26 00:19:06,750 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-26 00:19:06,750 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 12:19:03" (3/4) ... [2022-11-26 00:19:06,753 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-26 00:19:06,762 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-26 00:19:06,762 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-26 00:19:06,773 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 29 nodes and edges [2022-11-26 00:19:06,774 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-26 00:19:06,774 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-26 00:19:06,775 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:19:06,775 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-26 00:19:06,847 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc01d14-b310-4ef3-a73a-30bb74f39a93/bin/utaipan-ByfvJB40ur/witness.graphml [2022-11-26 00:19:06,848 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-26 00:19:06,848 INFO L158 Benchmark]: Toolchain (without parser) took 5790.18ms. Allocated memory was 159.4MB in the beginning and 257.9MB in the end (delta: 98.6MB). Free memory was 110.9MB in the beginning and 169.6MB in the end (delta: -58.6MB). Peak memory consumption was 40.4MB. Max. memory is 16.1GB. [2022-11-26 00:19:06,848 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 159.4MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-26 00:19:06,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1415.59ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 110.9MB in the beginning and 168.7MB in the end (delta: -57.7MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. [2022-11-26 00:19:06,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.31ms. Allocated memory is still 213.9MB. Free memory was 168.7MB in the beginning and 164.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:19:06,849 INFO L158 Benchmark]: Boogie Preprocessor took 35.54ms. Allocated memory is still 213.9MB. Free memory was 164.5MB in the beginning and 162.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-26 00:19:06,849 INFO L158 Benchmark]: RCFGBuilder took 766.63ms. Allocated memory is still 213.9MB. Free memory was 162.4MB in the beginning and 134.1MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-11-26 00:19:06,849 INFO L158 Benchmark]: TraceAbstraction took 3386.64ms. Allocated memory was 213.9MB in the beginning and 257.9MB in the end (delta: 44.0MB). Free memory was 133.0MB in the beginning and 174.8MB in the end (delta: -41.8MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. [2022-11-26 00:19:06,850 INFO L158 Benchmark]: Witness Printer took 98.23ms. Allocated memory is still 257.9MB. Free memory was 174.8MB in the beginning and 169.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-26 00:19:06,852 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 159.4MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1415.59ms. Allocated memory was 159.4MB in the beginning and 213.9MB in the end (delta: 54.5MB). Free memory was 110.9MB in the beginning and 168.7MB in the end (delta: -57.7MB). Peak memory consumption was 67.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.31ms. Allocated memory is still 213.9MB. Free memory was 168.7MB in the beginning and 164.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.54ms. Allocated memory is still 213.9MB. Free memory was 164.5MB in the beginning and 162.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 766.63ms. Allocated memory is still 213.9MB. Free memory was 162.4MB in the beginning and 134.1MB in the end (delta: 28.3MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 3386.64ms. Allocated memory was 213.9MB in the beginning and 257.9MB in the end (delta: 44.0MB). Free memory was 133.0MB in the beginning and 174.8MB in the end (delta: -41.8MB). Peak memory consumption was 2.2MB. Max. memory is 16.1GB. * Witness Printer took 98.23ms. Allocated memory is still 257.9MB. Free memory was 174.8MB in the beginning and 169.6MB in the end (delta: 5.2MB). 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: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: 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, 65 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.3s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 152 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 121 mSDsluCounter, 1570 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 844 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 726 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 39 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=0, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 65 PreInvPairs, 75 NumberOfFragments, 174 HoareAnnotationTreeSize, 65 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 32 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 274 NumberOfCodeBlocks, 274 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 262 ConstructedInterpolants, 0 QuantifiedInterpolants, 320 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 44/44 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1616]: Loop Invariant Derived loop invariant: (2 == data && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1652]: Loop Invariant Derived loop invariant: 0 <= data + 2147483648 - InvariantResult [Line: 1678]: Loop Invariant Derived loop invariant: 0 <= data + 2147483648 - InvariantResult [Line: 1561]: Loop Invariant Derived loop invariant: aux-switch(8) { case 7: printLine("Benign, fixed string"); break; default: if (data < 0x7fffffff) { data++; int result = data; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; }-aux && 0 <= data + 2147483648 - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: 0 <= data + 2147483648 - InvariantResult [Line: 1593]: Loop Invariant Derived loop invariant: (aux-switch(7) { case 7: if (data < 0x7fffffff) { data++; int result = data; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648) && 0 <= data + 2147483648 - InvariantResult [Line: 1643]: Loop Invariant Derived loop invariant: (0 <= data + 2147483648 && data == 2) && 0 <= data + 2147483648 - InvariantResult [Line: 1584]: Loop Invariant Derived loop invariant: 0 <= data + 2147483648 && 0 <= data + 2147483648 - InvariantResult [Line: 1625]: Loop Invariant Derived loop invariant: (aux-switch(7) { case 7: { data++; int result = data; printIntLine(result); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= data + 2147483648) && 0 <= data + 2147483648 RESULT: Ultimate proved your program to be correct! [2022-11-26 00:19:06,895 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3cc01d14-b310-4ef3-a73a-30bb74f39a93/bin/utaipan-ByfvJB40ur/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE