./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_sub_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_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_sub_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R --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 Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e4e4ddc8e215ef1d6c828f8558b94004913e5a166e06ab0989f3c3e5f35bc2fd --- 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-25 17:58:41,594 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:58:41,596 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:58:41,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:58:41,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:58:41,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:58:41,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:58:41,618 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:58:41,620 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:58:41,621 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:58:41,622 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:58:41,623 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:58:41,623 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:58:41,625 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:58:41,626 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:58:41,627 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:58:41,628 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:58:41,629 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:58:41,630 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:58:41,632 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:58:41,633 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:58:41,636 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:58:41,638 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:58:41,640 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:58:41,644 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:58:41,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:58:41,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:58:41,652 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:58:41,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:58:41,653 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:58:41,653 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:58:41,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:58:41,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:58:41,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:58:41,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:58:41,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:58:41,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:58:41,662 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:58:41,662 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:58:41,663 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:58:41,665 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:58:41,666 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-25 17:58:41,700 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:58:41,712 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:58:41,712 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:58:41,713 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:58:41,713 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:58:41,714 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:58:41,714 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:58:41,715 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:58:41,715 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:58:41,715 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:58:41,716 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 17:58:41,716 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:58:41,716 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:58:41,717 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:58:41,717 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:58:41,717 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:58:41,717 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 17:58:41,717 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:58:41,718 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:58:41,718 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:58:41,718 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:58:41,718 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:58:41,718 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:58:41,719 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:58:41,719 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:58:41,719 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:58:41,719 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:58:41,719 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:58:41,720 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:58:41,720 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:58:41,720 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:58:41,720 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:58:41,721 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:58:41,721 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R/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_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R 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 -> Automizer 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 -> e4e4ddc8e215ef1d6c828f8558b94004913e5a166e06ab0989f3c3e5f35bc2fd [2022-11-25 17:58:42,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:58:42,026 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:58:42,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:58:42,029 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:58:42,030 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:58:42,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_sub_15_good.i [2022-11-25 17:58:45,149 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:58:45,621 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:58:45,622 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fb388c-281d-4862-beee-c726aa1b7e04/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_min_sub_15_good.i [2022-11-25 17:58:45,648 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R/data/ff4a9aa44/56c4101dfc0a4952823d01ef7b213e29/FLAGa5ef5c472 [2022-11-25 17:58:45,671 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R/data/ff4a9aa44/56c4101dfc0a4952823d01ef7b213e29 [2022-11-25 17:58:45,678 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:58:45,680 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:58:45,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:58:45,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:58:45,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:58:45,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:58:45" (1/1) ... [2022-11-25 17:58:45,689 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d15b67e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:45, skipping insertion in model container [2022-11-25 17:58:45,689 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:58:45" (1/1) ... [2022-11-25 17:58:45,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:58:45,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:58:46,180 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 17:58:46,643 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 17:58:46,649 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:58:46,652 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:58:46,654 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:58:46,655 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:58:46,694 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 17:58:46,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:58:46,706 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:58:46,727 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 17:58:46,772 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 17:58:46,774 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:58:46,776 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 17:58:46,778 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:58:46,779 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 17:58:46,788 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 17:58:46,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:58:46,958 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:58:46,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:46 WrapperNode [2022-11-25 17:58:46,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:58:46,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:58:46,960 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:58:46,960 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:58:46,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:46" (1/1) ... [2022-11-25 17:58:46,990 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:46" (1/1) ... [2022-11-25 17:58:47,014 INFO L138 Inliner]: procedures = 503, calls = 81, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 145 [2022-11-25 17:58:47,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:58:47,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:58:47,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:58:47,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:58:47,025 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:46" (1/1) ... [2022-11-25 17:58:47,025 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:46" (1/1) ... [2022-11-25 17:58:47,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:46" (1/1) ... [2022-11-25 17:58:47,028 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:46" (1/1) ... [2022-11-25 17:58:47,035 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:46" (1/1) ... [2022-11-25 17:58:47,037 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:46" (1/1) ... [2022-11-25 17:58:47,039 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:46" (1/1) ... [2022-11-25 17:58:47,040 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:46" (1/1) ... [2022-11-25 17:58:47,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:58:47,044 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:58:47,044 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:58:47,044 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:58:47,045 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:46" (1/1) ... [2022-11-25 17:58:47,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:58:47,062 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:58:47,085 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:58:47,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:58:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-25 17:58:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-25 17:58:47,134 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-25 17:58:47,134 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-25 17:58:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:58:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:58:47,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:58:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-25 17:58:47,135 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:58:47,381 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:58:47,383 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:58:47,675 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:58:47,683 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:58:47,683 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 17:58:47,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:47 BoogieIcfgContainer [2022-11-25 17:58:47,685 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:58:47,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:58:47,688 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:58:47,691 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:58:47,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:58:45" (1/3) ... [2022-11-25 17:58:47,692 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61274be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:58:47, skipping insertion in model container [2022-11-25 17:58:47,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:58:46" (2/3) ... [2022-11-25 17:58:47,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61274be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:58:47, skipping insertion in model container [2022-11-25 17:58:47,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:47" (3/3) ... [2022-11-25 17:58:47,694 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_min_sub_15_good.i [2022-11-25 17:58:47,713 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:58:47,713 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-25 17:58:47,776 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:58:47,784 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=PETRI_NET, 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;@ecf8200, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:58:47,784 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 17:58:47,789 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 50 states have (on average 1.54) internal successors, (77), 72 states have internal predecessors, (77), 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-25 17:58:47,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 17:58:47,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:58:47,802 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:47,803 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-25 17:58:47,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:47,810 INFO L85 PathProgramCache]: Analyzing trace with hash -389693070, now seen corresponding path program 1 times [2022-11-25 17:58:47,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:47,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274842723] [2022-11-25 17:58:47,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:47,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:48,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:58:48,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:48,135 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-25 17:58:48,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:48,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274842723] [2022-11-25 17:58:48,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274842723] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:48,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:48,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:58:48,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969233455] [2022-11-25 17:58:48,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:48,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:48,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:48,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:48,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:48,191 INFO L87 Difference]: Start difference. First operand has 77 states, 50 states have (on average 1.54) internal successors, (77), 72 states have internal predecessors, (77), 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 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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-25 17:58:48,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:58:48,275 INFO L93 Difference]: Finished difference Result 198 states and 280 transitions. [2022-11-25 17:58:48,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:48,278 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), 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 14 [2022-11-25 17:58:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:58:48,288 INFO L225 Difference]: With dead ends: 198 [2022-11-25 17:58:48,288 INFO L226 Difference]: Without dead ends: 112 [2022-11-25 17:58:48,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-25 17:58:48,295 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 56 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:58:48,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 220 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:58:48,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-25 17:58:48,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 70. [2022-11-25 17:58:48,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 47 states have (on average 1.553191489361702) internal successors, (73), 66 states have internal predecessors, (73), 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-25 17:58:48,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 99 transitions. [2022-11-25 17:58:48,363 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 99 transitions. Word has length 14 [2022-11-25 17:58:48,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:58:48,363 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 99 transitions. [2022-11-25 17:58:48,364 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), 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-25 17:58:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 99 transitions. [2022-11-25 17:58:48,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 17:58:48,366 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:58:48,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:48,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:58:48,367 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:58:48,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:48,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1778434891, now seen corresponding path program 1 times [2022-11-25 17:58:48,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:48,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586587423] [2022-11-25 17:58:48,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:48,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:48,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:48,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:58:48,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:48,437 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-25 17:58:48,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:48,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586587423] [2022-11-25 17:58:48,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586587423] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:48,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:48,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:58:48,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358044156] [2022-11-25 17:58:48,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:48,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:48,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:48,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:48,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:48,441 INFO L87 Difference]: Start difference. First operand 70 states and 99 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-25 17:58:48,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:58:48,468 INFO L93 Difference]: Finished difference Result 120 states and 168 transitions. [2022-11-25 17:58:48,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:48,470 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-25 17:58:48,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:58:48,472 INFO L225 Difference]: With dead ends: 120 [2022-11-25 17:58:48,472 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 17:58:48,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-25 17:58:48,474 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 1 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:58:48,475 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 158 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:58:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 17:58:48,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-25 17:58:48,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.475) internal successors, (59), 55 states have internal predecessors, (59), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 17:58:48,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 81 transitions. [2022-11-25 17:58:48,485 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 81 transitions. Word has length 15 [2022-11-25 17:58:48,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:58:48,486 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 81 transitions. [2022-11-25 17:58:48,486 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-25 17:58:48,486 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 81 transitions. [2022-11-25 17:58:48,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 17:58:48,487 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:58:48,487 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:48,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:58:48,488 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-25 17:58:48,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:48,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1566270844, now seen corresponding path program 1 times [2022-11-25 17:58:48,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:48,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026952210] [2022-11-25 17:58:48,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:48,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:48,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:48,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:58:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:48,584 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-25 17:58:48,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:48,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026952210] [2022-11-25 17:58:48,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026952210] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:48,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:48,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:58:48,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477502032] [2022-11-25 17:58:48,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:48,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:48,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:48,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:48,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:48,596 INFO L87 Difference]: Start difference. First operand 59 states and 81 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-25 17:58:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:58:48,634 INFO L93 Difference]: Finished difference Result 107 states and 146 transitions. [2022-11-25 17:58:48,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:48,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-11-25 17:58:48,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:58:48,636 INFO L225 Difference]: With dead ends: 107 [2022-11-25 17:58:48,636 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 17:58:48,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-25 17:58:48,638 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:58:48,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 150 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:58:48,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 17:58:48,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-25 17:58:48,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 40 states have (on average 1.45) internal successors, (58), 54 states have internal predecessors, (58), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 17:58:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. [2022-11-25 17:58:48,659 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 19 [2022-11-25 17:58:48,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:58:48,660 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 80 transitions. [2022-11-25 17:58:48,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-25 17:58:48,661 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2022-11-25 17:58:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 17:58:48,663 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:58:48,663 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:48,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:58:48,664 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-25 17:58:48,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:48,667 INFO L85 PathProgramCache]: Analyzing trace with hash -126826538, now seen corresponding path program 1 times [2022-11-25 17:58:48,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:48,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434442186] [2022-11-25 17:58:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:48,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:48,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:58:48,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 17:58:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:48,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:58:48,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:48,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434442186] [2022-11-25 17:58:48,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434442186] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:48,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:48,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:58:48,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097760076] [2022-11-25 17:58:48,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:48,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:48,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:48,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:48,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:48,754 INFO L87 Difference]: Start difference. First operand 59 states and 80 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-25 17:58:48,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:58:48,770 INFO L93 Difference]: Finished difference Result 107 states and 145 transitions. [2022-11-25 17:58:48,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:48,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 23 [2022-11-25 17:58:48,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:58:48,772 INFO L225 Difference]: With dead ends: 107 [2022-11-25 17:58:48,772 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 17:58:48,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-25 17:58:48,774 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 0 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:58:48,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:58:48,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 17:58:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-25 17:58:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 40 states have (on average 1.425) internal successors, (57), 53 states have internal predecessors, (57), 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-25 17:58:48,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 77 transitions. [2022-11-25 17:58:48,783 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 77 transitions. Word has length 23 [2022-11-25 17:58:48,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:58:48,783 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 77 transitions. [2022-11-25 17:58:48,784 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-25 17:58:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2022-11-25 17:58:48,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 17:58:48,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:58:48,785 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:48,785 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:58:48,785 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-25 17:58:48,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:48,786 INFO L85 PathProgramCache]: Analyzing trace with hash 745548059, now seen corresponding path program 1 times [2022-11-25 17:58:48,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:48,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155950837] [2022-11-25 17:58:48,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:48,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:48,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:58:48,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:48,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:58:48,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:48,855 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:58:48,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:48,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155950837] [2022-11-25 17:58:48,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155950837] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:48,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:48,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:58:48,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870256850] [2022-11-25 17:58:48,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:48,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:48,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:48,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:48,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:48,859 INFO L87 Difference]: Start difference. First operand 58 states and 77 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-25 17:58:48,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:58:48,883 INFO L93 Difference]: Finished difference Result 125 states and 166 transitions. [2022-11-25 17:58:48,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:48,890 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 25 [2022-11-25 17:58:48,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:58:48,892 INFO L225 Difference]: With dead ends: 125 [2022-11-25 17:58:48,892 INFO L226 Difference]: Without dead ends: 88 [2022-11-25 17:58:48,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-25 17:58:48,894 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 30 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:58:48,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 149 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:58:48,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-11-25 17:58:48,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 61. [2022-11-25 17:58:48,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 56 states have internal predecessors, (61), 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-25 17:58:48,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-11-25 17:58:48,905 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 25 [2022-11-25 17:58:48,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:58:48,905 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-11-25 17:58:48,905 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-25 17:58:48,906 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-11-25 17:58:48,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 17:58:48,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:58:48,907 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:48,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:58:48,907 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:58:48,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:48,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1692472396, now seen corresponding path program 1 times [2022-11-25 17:58:48,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:48,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704264891] [2022-11-25 17:58:48,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:48,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:48,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:58:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:48,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:58:48,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:48,982 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:58:48,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:48,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704264891] [2022-11-25 17:58:48,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704264891] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:48,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:48,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:58:48,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651430456] [2022-11-25 17:58:48,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:48,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:48,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:48,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:48,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:48,986 INFO L87 Difference]: Start difference. First operand 61 states and 81 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:58:49,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:58:49,008 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2022-11-25 17:58:49,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:49,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-11-25 17:58:49,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:58:49,017 INFO L225 Difference]: With dead ends: 96 [2022-11-25 17:58:49,017 INFO L226 Difference]: Without dead ends: 51 [2022-11-25 17:58:49,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-25 17:58:49,019 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:58:49,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 126 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:58:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-11-25 17:58:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-11-25 17:58:49,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 46 states have internal predecessors, (49), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 17:58:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 65 transitions. [2022-11-25 17:58:49,034 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 65 transitions. Word has length 26 [2022-11-25 17:58:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:58:49,034 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 65 transitions. [2022-11-25 17:58:49,035 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:58:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 65 transitions. [2022-11-25 17:58:49,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 17:58:49,036 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:58:49,036 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:49,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 17:58:49,037 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-25 17:58:49,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:49,037 INFO L85 PathProgramCache]: Analyzing trace with hash -332330315, now seen corresponding path program 1 times [2022-11-25 17:58:49,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:49,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173201816] [2022-11-25 17:58:49,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:49,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:49,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:58:49,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:58:49,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:58:49,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:49,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173201816] [2022-11-25 17:58:49,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173201816] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:49,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:49,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:58:49,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699811719] [2022-11-25 17:58:49,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:49,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:49,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:49,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:49,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:49,130 INFO L87 Difference]: Start difference. First operand 51 states and 65 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-25 17:58:49,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:58:49,156 INFO L93 Difference]: Finished difference Result 83 states and 105 transitions. [2022-11-25 17:58:49,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:49,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 31 [2022-11-25 17:58:49,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:58:49,158 INFO L225 Difference]: With dead ends: 83 [2022-11-25 17:58:49,158 INFO L226 Difference]: Without dead ends: 49 [2022-11-25 17:58:49,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-25 17:58:49,160 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 2 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:58:49,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 113 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:58:49,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-11-25 17:58:49,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-11-25 17:58:49,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 43 states have internal predecessors, (46), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 17:58:49,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2022-11-25 17:58:49,167 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 31 [2022-11-25 17:58:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:58:49,168 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2022-11-25 17:58:49,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-25 17:58:49,168 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2022-11-25 17:58:49,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 17:58:49,169 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:58:49,170 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-11-25 17:58:49,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:58:49,170 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-25 17:58:49,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:49,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1965523148, now seen corresponding path program 1 times [2022-11-25 17:58:49,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:49,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362307084] [2022-11-25 17:58:49,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:49,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:58:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:58:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:58:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,238 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-25 17:58:49,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:49,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362307084] [2022-11-25 17:58:49,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362307084] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:49,239 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:49,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:58:49,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041883058] [2022-11-25 17:58:49,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:49,239 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:49,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:49,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:49,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:49,241 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-25 17:58:49,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:58:49,253 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-11-25 17:58:49,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:49,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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 36 [2022-11-25 17:58:49,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:58:49,254 INFO L225 Difference]: With dead ends: 49 [2022-11-25 17:58:49,255 INFO L226 Difference]: Without dead ends: 48 [2022-11-25 17:58:49,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-25 17:58:49,256 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 20 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:58:49,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 87 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:58:49,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-25 17:58:49,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-25 17:58:49,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 36 states have (on average 1.25) internal successors, (45), 42 states have internal predecessors, (45), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 17:58:49,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2022-11-25 17:58:49,263 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 36 [2022-11-25 17:58:49,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:58:49,263 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2022-11-25 17:58:49,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.0) internal successors, (24), 3 states have internal predecessors, (24), 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-25 17:58:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2022-11-25 17:58:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 17:58:49,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:58:49,265 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-25 17:58:49,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:58:49,265 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:58:49,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:49,266 INFO L85 PathProgramCache]: Analyzing trace with hash -801675300, now seen corresponding path program 1 times [2022-11-25 17:58:49,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:49,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199026531] [2022-11-25 17:58:49,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:49,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:49,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:58:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:58:49,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:58:49,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,327 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-25 17:58:49,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:49,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199026531] [2022-11-25 17:58:49,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199026531] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:49,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:49,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:58:49,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157811787] [2022-11-25 17:58:49,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:49,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:49,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:49,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:49,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:49,330 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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-25 17:58:49,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:58:49,347 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2022-11-25 17:58:49,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:49,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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 37 [2022-11-25 17:58:49,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:58:49,349 INFO L225 Difference]: With dead ends: 67 [2022-11-25 17:58:49,349 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 17:58:49,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-25 17:58:49,350 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 15 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:58:49,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 114 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:58:49,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 17:58:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 52. [2022-11-25 17:58:49,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.25) internal successors, (50), 46 states have internal predecessors, (50), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 17:58:49,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 64 transitions. [2022-11-25 17:58:49,358 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 64 transitions. Word has length 37 [2022-11-25 17:58:49,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:58:49,359 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 64 transitions. [2022-11-25 17:58:49,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 12.5) internal successors, (25), 3 states have internal predecessors, (25), 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-25 17:58:49,359 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-11-25 17:58:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 17:58:49,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:58:49,360 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-25 17:58:49,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:58:49,361 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:58:49,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:49,361 INFO L85 PathProgramCache]: Analyzing trace with hash -799828258, now seen corresponding path program 1 times [2022-11-25 17:58:49,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:49,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533175473] [2022-11-25 17:58:49,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:49,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:58:49,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:58:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:58:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,409 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-25 17:58:49,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:49,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533175473] [2022-11-25 17:58:49,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533175473] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:49,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:49,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:58:49,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203896308] [2022-11-25 17:58:49,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:49,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:49,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:49,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:49,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:49,412 INFO L87 Difference]: Start difference. First operand 52 states and 64 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-25 17:58:49,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:58:49,422 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-11-25 17:58:49,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:49,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 37 [2022-11-25 17:58:49,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:58:49,423 INFO L225 Difference]: With dead ends: 78 [2022-11-25 17:58:49,424 INFO L226 Difference]: Without dead ends: 52 [2022-11-25 17:58:49,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-25 17:58:49,425 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 1 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:58:49,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 109 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:58:49,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-25 17:58:49,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-25 17:58:49,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 40 states have (on average 1.225) internal successors, (49), 45 states have internal predecessors, (49), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 17:58:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-11-25 17:58:49,431 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 37 [2022-11-25 17:58:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:58:49,432 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-11-25 17:58:49,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-25 17:58:49,432 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-11-25 17:58:49,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 17:58:49,433 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:58:49,433 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1] [2022-11-25 17:58:49,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:58:49,434 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:58:49,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:49,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1822720215, now seen corresponding path program 1 times [2022-11-25 17:58:49,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:49,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798312902] [2022-11-25 17:58:49,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:49,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:58:49,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:58:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:58:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 17:58:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,512 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 17:58:49,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:49,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798312902] [2022-11-25 17:58:49,513 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798312902] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:49,513 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:49,513 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:58:49,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976951118] [2022-11-25 17:58:49,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:49,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:49,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:49,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:49,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:49,517 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-25 17:58:49,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:58:49,531 INFO L93 Difference]: Finished difference Result 73 states and 88 transitions. [2022-11-25 17:58:49,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:49,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 41 [2022-11-25 17:58:49,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:58:49,536 INFO L225 Difference]: With dead ends: 73 [2022-11-25 17:58:49,536 INFO L226 Difference]: Without dead ends: 46 [2022-11-25 17:58:49,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-25 17:58:49,539 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:58:49,539 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:58:49,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-25 17:58:49,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-11-25 17:58:49,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 36 states have (on average 1.1666666666666667) internal successors, (42), 40 states have internal predecessors, (42), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 17:58:49,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-11-25 17:58:49,547 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 41 [2022-11-25 17:58:49,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:58:49,548 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-11-25 17:58:49,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-25 17:58:49,548 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-11-25 17:58:49,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 17:58:49,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:58:49,549 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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-25 17:58:49,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:58:49,549 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-25 17:58:49,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:49,550 INFO L85 PathProgramCache]: Analyzing trace with hash 763162534, now seen corresponding path program 1 times [2022-11-25 17:58:49,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:49,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073846690] [2022-11-25 17:58:49,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:49,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:58:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:58:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:58:49,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,622 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-25 17:58:49,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:49,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073846690] [2022-11-25 17:58:49,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073846690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:49,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:49,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:58:49,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638705060] [2022-11-25 17:58:49,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:49,625 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:49,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:49,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:49,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:49,626 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-25 17:58:49,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:58:49,638 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2022-11-25 17:58:49,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:49,638 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 42 [2022-11-25 17:58:49,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:58:49,639 INFO L225 Difference]: With dead ends: 61 [2022-11-25 17:58:49,639 INFO L226 Difference]: Without dead ends: 44 [2022-11-25 17:58:49,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-25 17:58:49,645 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 3 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:58:49,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 90 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:58:49,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-11-25 17:58:49,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-11-25 17:58:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 37 states have internal predecessors, (39), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 17:58:49,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-11-25 17:58:49,662 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 42 [2022-11-25 17:58:49,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:58:49,663 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-11-25 17:58:49,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-25 17:58:49,663 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-11-25 17:58:49,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 17:58:49,666 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:58:49,666 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1] [2022-11-25 17:58:49,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:58:49,667 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:58:49,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:49,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1582332810, now seen corresponding path program 1 times [2022-11-25 17:58:49,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:49,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568538291] [2022-11-25 17:58:49,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:49,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:58:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:58:49,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:58:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:58:49,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,776 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-25 17:58:49,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:49,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568538291] [2022-11-25 17:58:49,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568538291] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:49,777 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:49,777 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:58:49,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047909183] [2022-11-25 17:58:49,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:49,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:49,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:49,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:49,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:49,779 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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-25 17:58:49,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:58:49,792 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-11-25 17:58:49,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:49,793 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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 47 [2022-11-25 17:58:49,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:58:49,793 INFO L225 Difference]: With dead ends: 44 [2022-11-25 17:58:49,794 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 17:58:49,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-25 17:58:49,796 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 5 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:58:49,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 84 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:58:49,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 17:58:49,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-25 17:58:49,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 36 states have internal predecessors, (38), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 17:58:49,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-11-25 17:58:49,801 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 47 [2022-11-25 17:58:49,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:58:49,801 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-11-25 17:58:49,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 16.5) internal successors, (33), 3 states have internal predecessors, (33), 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-25 17:58:49,802 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-11-25 17:58:49,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 17:58:49,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:58:49,803 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:49,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:58:49,803 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:58:49,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:49,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1807677031, now seen corresponding path program 1 times [2022-11-25 17:58:49,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:49,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397558217] [2022-11-25 17:58:49,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:49,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:58:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:58:49,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:58:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:58:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,860 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-25 17:58:49,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:49,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397558217] [2022-11-25 17:58:49,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397558217] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:49,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:49,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:58:49,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959932522] [2022-11-25 17:58:49,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:49,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:49,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:49,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:49,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:49,863 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:58:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:58:49,874 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-11-25 17:58:49,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:49,875 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-11-25 17:58:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:58:49,875 INFO L225 Difference]: With dead ends: 48 [2022-11-25 17:58:49,876 INFO L226 Difference]: Without dead ends: 43 [2022-11-25 17:58:49,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-25 17:58:49,876 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:58:49,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:58:49,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-11-25 17:58:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-11-25 17:58:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 35 states have (on average 1.0571428571428572) internal successors, (37), 36 states have internal predecessors, (37), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 17:58:49,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2022-11-25 17:58:49,887 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 48 [2022-11-25 17:58:49,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:58:49,888 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2022-11-25 17:58:49,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 17.0) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:58:49,888 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-11-25 17:58:49,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 17:58:49,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:58:49,890 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:49,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:58:49,891 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 17:58:49,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:58:49,891 INFO L85 PathProgramCache]: Analyzing trace with hash 258733193, now seen corresponding path program 1 times [2022-11-25 17:58:49,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:58:49,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429048675] [2022-11-25 17:58:49,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:58:49,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:58:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:58:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 17:58:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 17:58:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 17:58:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:58:49,953 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-25 17:58:49,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:58:49,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429048675] [2022-11-25 17:58:49,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429048675] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:58:49,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:58:49,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:58:49,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214674797] [2022-11-25 17:58:49,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:58:49,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:58:49,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:58:49,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:58:49,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:58:49,957 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-25 17:58:49,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:58:49,962 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-11-25 17:58:49,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:58:49,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 49 [2022-11-25 17:58:49,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:58:49,963 INFO L225 Difference]: With dead ends: 47 [2022-11-25 17:58:49,963 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 17:58:49,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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-25 17:58:49,966 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:58:49,967 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:58:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 17:58:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 17:58:49,968 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-25 17:58:49,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 17:58:49,968 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-11-25 17:58:49,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:58:49,968 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 17:58:49,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-25 17:58:49,969 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 17:58:49,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 17:58:49,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-25 17:58:49,973 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-25 17:58:49,974 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-25 17:58:49,974 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-25 17:58:49,975 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-25 17:58:49,975 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-25 17:58:49,975 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-25 17:58:49,975 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-25 17:58:49,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:58:49,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 17:58:50,073 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-25 17:58:50,074 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 17:58:50,074 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-25 17:58:50,074 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 17:58:50,074 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 17:58:50,074 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-25 17:58:50,074 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 17:58:50,074 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1597) no Hoare annotation was computed. [2022-11-25 17:58:50,075 INFO L899 garLoopResultBuilder]: For program point L1662(lines 1662 1668) no Hoare annotation was computed. [2022-11-25 17:58:50,075 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-11-25 17:58:50,075 INFO L902 garLoopResultBuilder]: At program point L1654(line 1654) the Hoare annotation is: true [2022-11-25 17:58:50,075 INFO L899 garLoopResultBuilder]: For program point L1588(line 1588) no Hoare annotation was computed. [2022-11-25 17:58:50,075 INFO L895 garLoopResultBuilder]: At program point L1646(line 1646) the Hoare annotation is: false [2022-11-25 17:58:50,075 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2022-11-25 17:58:50,075 INFO L899 garLoopResultBuilder]: For program point L1605(line 1605) no Hoare annotation was computed. [2022-11-25 17:58:50,075 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-25 17:58:50,076 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 17:58:50,076 INFO L899 garLoopResultBuilder]: For program point L1597(line 1597) no Hoare annotation was computed. [2022-11-25 17:58:50,076 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 17:58:50,076 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2022-11-25 17:58:50,076 INFO L899 garLoopResultBuilder]: For program point L1597-1(line 1597) no Hoare annotation was computed. [2022-11-25 17:58:50,076 INFO L895 garLoopResultBuilder]: At program point L1589(line 1589) the Hoare annotation is: false [2022-11-25 17:58:50,076 INFO L895 garLoopResultBuilder]: At program point L1614(lines 1614 1622) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (and |ULTIMATE.start_goodG2B1_#t~switch96#1| (<= .cse0 0) (<= 0 .cse0))) [2022-11-25 17:58:50,076 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1578) no Hoare annotation was computed. [2022-11-25 17:58:50,077 INFO L902 garLoopResultBuilder]: At program point L1672(line 1672) the Hoare annotation is: true [2022-11-25 17:58:50,077 INFO L899 garLoopResultBuilder]: For program point L1672-1(line 1672) no Hoare annotation was computed. [2022-11-25 17:58:50,077 INFO L895 garLoopResultBuilder]: At program point L1606(line 1606) the Hoare annotation is: false [2022-11-25 17:58:50,077 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-25 17:58:50,077 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2022-11-25 17:58:50,077 INFO L895 garLoopResultBuilder]: At program point L1598(line 1598) the Hoare annotation is: false [2022-11-25 17:58:50,077 INFO L895 garLoopResultBuilder]: At program point L1623(lines 1623 1634) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch97#1| (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2022-11-25 17:58:50,078 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-11-25 17:58:50,078 INFO L895 garLoopResultBuilder]: At program point L1640(lines 1640 1648) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2))) (and (<= 0 .cse0) (<= .cse0 0) (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|)))) [2022-11-25 17:58:50,078 INFO L895 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch93#1| (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) [2022-11-25 17:58:50,078 INFO L895 garLoopResultBuilder]: At program point L1632(line 1632) the Hoare annotation is: false [2022-11-25 17:58:50,078 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-25 17:58:50,078 INFO L899 garLoopResultBuilder]: For program point L1657(line 1657) no Hoare annotation was computed. [2022-11-25 17:58:50,078 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2022-11-25 17:58:50,078 INFO L902 garLoopResultBuilder]: At program point L1649(lines 1649 1660) the Hoare annotation is: true [2022-11-25 17:58:50,079 INFO L899 garLoopResultBuilder]: For program point L1616(line 1616) no Hoare annotation was computed. [2022-11-25 17:58:50,079 INFO L895 garLoopResultBuilder]: At program point L1583(lines 1583 1591) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch94#1| (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) [2022-11-25 17:58:50,079 INFO L902 garLoopResultBuilder]: At program point L1674(line 1674) the Hoare annotation is: true [2022-11-25 17:58:50,079 INFO L899 garLoopResultBuilder]: For program point L1674-1(line 1674) no Hoare annotation was computed. [2022-11-25 17:58:50,079 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1575) no Hoare annotation was computed. [2022-11-25 17:58:50,079 INFO L902 garLoopResultBuilder]: At program point L1658(line 1658) the Hoare annotation is: true [2022-11-25 17:58:50,079 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-11-25 17:58:50,079 INFO L895 garLoopResultBuilder]: At program point L1592(lines 1592 1608) the Hoare annotation is: |ULTIMATE.start_goodB2G2_#t~switch95#1| [2022-11-25 17:58:50,080 INFO L895 garLoopResultBuilder]: At program point L1617(line 1617) the Hoare annotation is: false [2022-11-25 17:58:50,080 INFO L902 garLoopResultBuilder]: At program point L1675(lines 1669 1676) the Hoare annotation is: true [2022-11-25 17:58:50,080 INFO L899 garLoopResultBuilder]: For program point L1642(line 1642) no Hoare annotation was computed. [2022-11-25 17:58:50,080 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 17:58:50,080 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1627) no Hoare annotation was computed. [2022-11-25 17:58:50,080 INFO L899 garLoopResultBuilder]: For program point L1651(line 1651) no Hoare annotation was computed. [2022-11-25 17:58:50,080 INFO L899 garLoopResultBuilder]: For program point L1585(line 1585) no Hoare annotation was computed. [2022-11-25 17:58:50,080 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch92#1| (<= (+ |ULTIMATE.start_goodB2G1_~data~0#1| 2147483648) 0)) [2022-11-25 17:58:50,081 INFO L899 garLoopResultBuilder]: For program point L1610(lines 1610 1635) no Hoare annotation was computed. [2022-11-25 17:58:50,081 INFO L895 garLoopResultBuilder]: At program point L1602(line 1602) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch95#1| (<= (+ |ULTIMATE.start_goodB2G2_~data~1#1| 2147483648) 0)) [2022-11-25 17:58:50,081 INFO L899 garLoopResultBuilder]: For program point L1569(line 1569) no Hoare annotation was computed. [2022-11-25 17:58:50,081 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 17:58:50,081 INFO L899 garLoopResultBuilder]: For program point L1569-1(line 1569) no Hoare annotation was computed. [2022-11-25 17:58:50,081 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1627) no Hoare annotation was computed. [2022-11-25 17:58:50,081 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2022-11-25 17:58:50,081 INFO L899 garLoopResultBuilder]: For program point L1594(line 1594) no Hoare annotation was computed. [2022-11-25 17:58:50,082 INFO L899 garLoopResultBuilder]: For program point L1627-1(line 1627) no Hoare annotation was computed. [2022-11-25 17:58:50,082 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1577) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch93#1| [2022-11-25 17:58:50,082 INFO L899 garLoopResultBuilder]: For program point L1619(line 1619) no Hoare annotation was computed. [2022-11-25 17:58:50,082 INFO L899 garLoopResultBuilder]: For program point L1636(lines 1636 1661) no Hoare annotation was computed. [2022-11-25 17:58:50,082 INFO L895 garLoopResultBuilder]: At program point L1570(line 1570) the Hoare annotation is: false [2022-11-25 17:58:50,082 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1597) no Hoare annotation was computed. [2022-11-25 17:58:50,082 INFO L895 garLoopResultBuilder]: At program point L1628(line 1628) the Hoare annotation is: (and |ULTIMATE.start_goodG2B1_#t~switch97#1| (<= 0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) [2022-11-25 17:58:50,082 INFO L899 garLoopResultBuilder]: For program point L1595(lines 1595 1603) no Hoare annotation was computed. [2022-11-25 17:58:50,083 INFO L899 garLoopResultBuilder]: For program point L1653(line 1653) no Hoare annotation was computed. [2022-11-25 17:58:50,083 INFO L899 garLoopResultBuilder]: For program point L1653-1(line 1653) no Hoare annotation was computed. [2022-11-25 17:58:50,083 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-25 17:58:50,083 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-25 17:58:50,083 INFO L899 garLoopResultBuilder]: For program point L1579(lines 1579 1609) no Hoare annotation was computed. [2022-11-25 17:58:50,083 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1653) no Hoare annotation was computed. [2022-11-25 17:58:50,086 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:58:50,089 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:58:50,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:58:50 BoogieIcfgContainer [2022-11-25 17:58:50,105 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:58:50,105 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:58:50,105 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:58:50,105 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:58:50,106 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:58:47" (3/4) ... [2022-11-25 17:58:50,109 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 17:58:50,115 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-25 17:58:50,115 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-25 17:58:50,121 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-25 17:58:50,121 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-25 17:58:50,122 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 17:58:50,122 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:58:50,122 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 17:58:50,191 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:58:50,191 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:58:50,192 INFO L158 Benchmark]: Toolchain (without parser) took 4511.50ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 120.0MB in the beginning and 117.7MB in the end (delta: 2.2MB). Peak memory consumption was 65.3MB. Max. memory is 16.1GB. [2022-11-25 17:58:50,192 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 167.8MB. Free memory was 139.0MB in the beginning and 138.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:58:50,193 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1275.59ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 125.6MB in the end (delta: -5.6MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. [2022-11-25 17:58:50,193 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.22ms. Allocated memory is still 167.8MB. Free memory was 125.6MB in the beginning and 122.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:58:50,193 INFO L158 Benchmark]: Boogie Preprocessor took 28.00ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 120.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:58:50,194 INFO L158 Benchmark]: RCFGBuilder took 641.43ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 104.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 17:58:50,194 INFO L158 Benchmark]: TraceAbstraction took 2417.42ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 103.8MB in the beginning and 121.9MB in the end (delta: -18.1MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2022-11-25 17:58:50,195 INFO L158 Benchmark]: Witness Printer took 85.91ms. Allocated memory is still 228.6MB. Free memory was 121.9MB in the beginning and 117.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 17:58:50,197 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.17ms. Allocated memory is still 167.8MB. Free memory was 139.0MB in the beginning and 138.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1275.59ms. Allocated memory is still 167.8MB. Free memory was 120.0MB in the beginning and 125.6MB in the end (delta: -5.6MB). Peak memory consumption was 64.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.22ms. Allocated memory is still 167.8MB. Free memory was 125.6MB in the beginning and 122.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.00ms. Allocated memory is still 167.8MB. Free memory was 122.6MB in the beginning and 120.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 641.43ms. Allocated memory is still 167.8MB. Free memory was 120.5MB in the beginning and 104.6MB in the end (delta: 15.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2417.42ms. Allocated memory was 167.8MB in the beginning and 228.6MB in the end (delta: 60.8MB). Free memory was 103.8MB in the beginning and 121.9MB in the end (delta: -18.1MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. * Witness Printer took 85.91ms. Allocated memory is still 228.6MB. Free memory was 121.9MB in the beginning and 117.7MB in the end (delta: 4.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: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1597]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1627]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1653]: 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, 77 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 168 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 136 mSDsluCounter, 1817 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 853 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 964 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=0, InterpolantAutomatonStates: 45, 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, 15 MinimizatonAttempts, 83 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 104 PreInvPairs, 124 NumberOfFragments, 89 HoareAnnotationTreeSize, 104 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 490 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 561 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 124/124 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: 1614]: Loop Invariant Derived loop invariant: (aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = -2; break; }-aux && 2 + data <= 0) && 0 <= 2 + data - InvariantResult [Line: 1640]: Loop Invariant Derived loop invariant: (0 <= data + 2 && data + 2 <= 0) && 0 <= 2 + data - InvariantResult [Line: 1561]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1583]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: data = (-0x7fffffff - 1); break; default: printLine("Benign, fixed string"); break; }-aux && data + 2147483648 <= 0 - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: data = (-0x7fffffff - 1); break; default: printLine("Benign, fixed string"); break; }-aux && data + 2147483648 <= 0 - InvariantResult [Line: 1669]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1623]: Loop Invariant Derived loop invariant: aux-switch(7) { case 7: { int result = data - 1; printIntLine(result); } break; default: printLine("Benign, fixed string"); break; }-aux && 0 <= 2 + data - InvariantResult [Line: 1592]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1649]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 17:58:50,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_49fb388c-281d-4862-beee-c726aa1b7e04/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE