./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_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_3540abfc-9bb1-4428-a6f8-1be2c446154c/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3540abfc-9bb1-4428-a6f8-1be2c446154c/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_3540abfc-9bb1-4428-a6f8-1be2c446154c/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3540abfc-9bb1-4428-a6f8-1be2c446154c/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3540abfc-9bb1-4428-a6f8-1be2c446154c/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_3540abfc-9bb1-4428-a6f8-1be2c446154c/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 51ccbaa2988d04f4dc74974694add0529ac8a83852aa1c5cd464965ea1329ad9 --- 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 15:50:54,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 15:50:54,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 15:50:54,205 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 15:50:54,206 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 15:50:54,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 15:50:54,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 15:50:54,216 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 15:50:54,219 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 15:50:54,224 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 15:50:54,225 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 15:50:54,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 15:50:54,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 15:50:54,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 15:50:54,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 15:50:54,231 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 15:50:54,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 15:50:54,233 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 15:50:54,239 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 15:50:54,246 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 15:50:54,249 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 15:50:54,252 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 15:50:54,254 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 15:50:54,255 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 15:50:54,266 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 15:50:54,266 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 15:50:54,266 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 15:50:54,268 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 15:50:54,269 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 15:50:54,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 15:50:54,270 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 15:50:54,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 15:50:54,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 15:50:54,274 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 15:50:54,275 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 15:50:54,275 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 15:50:54,276 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 15:50:54,277 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 15:50:54,277 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 15:50:54,279 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 15:50:54,279 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 15:50:54,280 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3540abfc-9bb1-4428-a6f8-1be2c446154c/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-25 15:50:54,333 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 15:50:54,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 15:50:54,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 15:50:54,334 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 15:50:54,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 15:50:54,336 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 15:50:54,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 15:50:54,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 15:50:54,337 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 15:50:54,338 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 15:50:54,339 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 15:50:54,339 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 15:50:54,340 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 15:50:54,340 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 15:50:54,340 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 15:50:54,341 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 15:50:54,341 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 15:50:54,341 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 15:50:54,342 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 15:50:54,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 15:50:54,342 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 15:50:54,343 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 15:50:54,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 15:50:54,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:50:54,344 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 15:50:54,344 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 15:50:54,344 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 15:50:54,345 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 15:50:54,345 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 15:50:54,346 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 15:50:54,346 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 15:50:54,346 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 15:50:54,347 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 15:50:54,347 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_3540abfc-9bb1-4428-a6f8-1be2c446154c/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_3540abfc-9bb1-4428-a6f8-1be2c446154c/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 -> 51ccbaa2988d04f4dc74974694add0529ac8a83852aa1c5cd464965ea1329ad9 [2022-11-25 15:50:54,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 15:50:54,647 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 15:50:54,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 15:50:54,652 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 15:50:54,653 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 15:50:54,654 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3540abfc-9bb1-4428-a6f8-1be2c446154c/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_15_good.i [2022-11-25 15:50:57,628 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 15:50:58,097 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 15:50:58,098 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3540abfc-9bb1-4428-a6f8-1be2c446154c/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fgets_postdec_15_good.i [2022-11-25 15:50:58,130 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3540abfc-9bb1-4428-a6f8-1be2c446154c/bin/uautomizer-ZsLfNo2U6R/data/315068e99/3ccb2b5e92884e38b5c764865c7d981e/FLAG8bc7d32f6 [2022-11-25 15:50:58,151 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3540abfc-9bb1-4428-a6f8-1be2c446154c/bin/uautomizer-ZsLfNo2U6R/data/315068e99/3ccb2b5e92884e38b5c764865c7d981e [2022-11-25 15:50:58,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 15:50:58,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 15:50:58,160 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 15:50:58,160 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 15:50:58,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 15:50:58,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:50:58" (1/1) ... [2022-11-25 15:50:58,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2f0061 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:58, skipping insertion in model container [2022-11-25 15:50:58,167 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 03:50:58" (1/1) ... [2022-11-25 15:50:58,175 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 15:50:58,268 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 15:50:58,677 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 15:50:59,221 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 15:50:59,232 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 15:50:59,235 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 15:50:59,238 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 15:50:59,239 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 15:50:59,266 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-25 15:50:59,278 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-25 15:50:59,300 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 15:50:59,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:50:59,320 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 15:50:59,359 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 15:50:59,461 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 15:50:59,462 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 15:50:59,463 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 15:50:59,466 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 15:50:59,468 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 15:50:59,481 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-25 15:50:59,485 WARN L623 FunctionHandler]: Unknown extern function fgets [2022-11-25 15:50:59,492 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 15:50:59,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 15:50:59,708 INFO L208 MainTranslator]: Completed translation [2022-11-25 15:50:59,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:59 WrapperNode [2022-11-25 15:50:59,709 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 15:50:59,711 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 15:50:59,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 15:50:59,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 15:50:59,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:59" (1/1) ... [2022-11-25 15:50:59,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:59" (1/1) ... [2022-11-25 15:50:59,815 INFO L138 Inliner]: procedures = 504, calls = 97, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 187 [2022-11-25 15:50:59,815 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 15:50:59,816 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 15:50:59,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 15:50:59,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 15:50:59,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:59" (1/1) ... [2022-11-25 15:50:59,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:59" (1/1) ... [2022-11-25 15:50:59,851 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:59" (1/1) ... [2022-11-25 15:50:59,851 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:59" (1/1) ... [2022-11-25 15:50:59,857 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:59" (1/1) ... [2022-11-25 15:50:59,872 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:59" (1/1) ... [2022-11-25 15:50:59,874 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:59" (1/1) ... [2022-11-25 15:50:59,876 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:59" (1/1) ... [2022-11-25 15:50:59,879 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 15:50:59,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 15:50:59,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 15:50:59,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 15:50:59,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:59" (1/1) ... [2022-11-25 15:50:59,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 15:50:59,909 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3540abfc-9bb1-4428-a6f8-1be2c446154c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 15:50:59,922 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3540abfc-9bb1-4428-a6f8-1be2c446154c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 15:50:59,926 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3540abfc-9bb1-4428-a6f8-1be2c446154c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 15:50:59,964 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-25 15:50:59,964 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-25 15:50:59,964 INFO L130 BoogieDeclarations]: Found specification of procedure fgets [2022-11-25 15:50:59,964 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-25 15:50:59,964 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-25 15:50:59,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 15:50:59,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-25 15:50:59,964 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 15:50:59,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 15:50:59,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 15:50:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 15:50:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-25 15:50:59,965 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 15:51:00,112 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 15:51:00,114 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 15:51:00,482 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 15:51:00,490 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 15:51:00,491 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 15:51:00,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:51:00 BoogieIcfgContainer [2022-11-25 15:51:00,493 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 15:51:00,496 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 15:51:00,496 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 15:51:00,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 15:51:00,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 03:50:58" (1/3) ... [2022-11-25 15:51:00,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2d6c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:51:00, skipping insertion in model container [2022-11-25 15:51:00,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 03:50:59" (2/3) ... [2022-11-25 15:51:00,501 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a2d6c12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 03:51:00, skipping insertion in model container [2022-11-25 15:51:00,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:51:00" (3/3) ... [2022-11-25 15:51:00,502 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fgets_postdec_15_good.i [2022-11-25 15:51:00,523 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 15:51:00,524 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-25 15:51:00,582 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 15:51:00,590 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;@663c334b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 15:51:00,591 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 15:51:00,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 54 states have (on average 1.537037037037037) internal successors, (83), 78 states have internal predecessors, (83), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 18 states have call successors, (18) [2022-11-25 15:51:00,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 15:51:00,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:00,608 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:00,609 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 15:51:00,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:00,618 INFO L85 PathProgramCache]: Analyzing trace with hash 2009313757, now seen corresponding path program 1 times [2022-11-25 15:51:00,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:00,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481093308] [2022-11-25 15:51:00,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:00,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:00,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:01,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:01,043 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 15:51:01,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:01,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481093308] [2022-11-25 15:51:01,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481093308] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:01,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:01,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:01,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151416216] [2022-11-25 15:51:01,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:01,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:01,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:01,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:01,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:01,117 INFO L87 Difference]: Start difference. First operand has 83 states, 54 states have (on average 1.537037037037037) internal successors, (83), 78 states have internal predecessors, (83), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 12 states have call predecessors, (18), 18 states have call successors, (18) 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 15:51:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:01,163 INFO L93 Difference]: Finished difference Result 156 states and 222 transitions. [2022-11-25 15:51:01,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:01,166 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 15:51:01,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:01,176 INFO L225 Difference]: With dead ends: 156 [2022-11-25 15:51:01,176 INFO L226 Difference]: Without dead ends: 70 [2022-11-25 15:51:01,179 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 15:51:01,183 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 4 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 220 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 15:51:01,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 220 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:01,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-25 15:51:01,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-11-25 15:51:01,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 66 states have internal predecessors, (70), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-25 15:51:01,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 98 transitions. [2022-11-25 15:51:01,251 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 98 transitions. Word has length 15 [2022-11-25 15:51:01,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:01,253 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 98 transitions. [2022-11-25 15:51:01,253 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 15:51:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 98 transitions. [2022-11-25 15:51:01,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 15:51:01,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:01,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:01,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 15:51:01,256 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 15:51:01,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:01,257 INFO L85 PathProgramCache]: Analyzing trace with hash -1328587979, now seen corresponding path program 1 times [2022-11-25 15:51:01,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:01,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286432226] [2022-11-25 15:51:01,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:01,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:01,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:01,479 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 15:51:01,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:01,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286432226] [2022-11-25 15:51:01,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286432226] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:01,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:01,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:51:01,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929558002] [2022-11-25 15:51:01,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:01,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:01,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:01,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:01,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:01,484 INFO L87 Difference]: Start difference. First operand 70 states and 98 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 15:51:01,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:01,504 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2022-11-25 15:51:01,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:01,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 16 [2022-11-25 15:51:01,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:01,507 INFO L225 Difference]: With dead ends: 70 [2022-11-25 15:51:01,507 INFO L226 Difference]: Without dead ends: 69 [2022-11-25 15:51:01,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 15:51:01,509 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 2 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 186 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 15:51:01,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 186 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:01,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-25 15:51:01,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2022-11-25 15:51:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.5) internal successors, (69), 65 states have internal predecessors, (69), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-25 15:51:01,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 97 transitions. [2022-11-25 15:51:01,523 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 97 transitions. Word has length 16 [2022-11-25 15:51:01,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:01,524 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 97 transitions. [2022-11-25 15:51:01,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 15:51:01,524 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 97 transitions. [2022-11-25 15:51:01,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 15:51:01,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:01,525 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:01,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 15:51:01,526 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:51:01,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:01,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1763445692, now seen corresponding path program 1 times [2022-11-25 15:51:01,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:01,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261398318] [2022-11-25 15:51:01,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:01,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:01,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:01,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:01,637 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 15:51:01,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:01,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261398318] [2022-11-25 15:51:01,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261398318] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:01,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:01,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:01,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203036521] [2022-11-25 15:51:01,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:01,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:51:01,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:01,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:51:01,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:51:01,642 INFO L87 Difference]: Start difference. First operand 69 states and 97 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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 15:51:01,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:01,679 INFO L93 Difference]: Finished difference Result 69 states and 97 transitions. [2022-11-25 15:51:01,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:51:01,680 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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 17 [2022-11-25 15:51:01,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:01,682 INFO L225 Difference]: With dead ends: 69 [2022-11-25 15:51:01,682 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 15:51:01,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:51:01,684 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:51:01,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 206 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:01,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 15:51:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-25 15:51:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 64 states have internal predecessors, (68), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-25 15:51:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 96 transitions. [2022-11-25 15:51:01,700 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 96 transitions. Word has length 17 [2022-11-25 15:51:01,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:01,700 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 96 transitions. [2022-11-25 15:51:01,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (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 15:51:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 96 transitions. [2022-11-25 15:51:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 15:51:01,703 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:01,703 INFO L195 NwaCegarLoop]: trace histogram [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 15:51:01,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 15:51:01,704 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 15:51:01,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:01,705 INFO L85 PathProgramCache]: Analyzing trace with hash 799401358, now seen corresponding path program 1 times [2022-11-25 15:51:01,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:01,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945387042] [2022-11-25 15:51:01,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:01,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:01,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:01,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:01,763 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 15:51:01,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:01,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945387042] [2022-11-25 15:51:01,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945387042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:01,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:01,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:01,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385622940] [2022-11-25 15:51:01,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:01,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:01,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:01,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:01,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:01,767 INFO L87 Difference]: Start difference. First operand 68 states and 96 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 15:51:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:01,794 INFO L93 Difference]: Finished difference Result 119 states and 166 transitions. [2022-11-25 15:51:01,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:01,795 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 22 [2022-11-25 15:51:01,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:01,797 INFO L225 Difference]: With dead ends: 119 [2022-11-25 15:51:01,797 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 15:51:01,802 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 15:51:01,803 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 176 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 15:51:01,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 176 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:01,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 15:51:01,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-25 15:51:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 63 states have internal predecessors, (67), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 9 states have call predecessors, (14), 14 states have call successors, (14) [2022-11-25 15:51:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 95 transitions. [2022-11-25 15:51:01,822 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 95 transitions. Word has length 22 [2022-11-25 15:51:01,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:01,822 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 95 transitions. [2022-11-25 15:51:01,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 15:51:01,823 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 95 transitions. [2022-11-25 15:51:01,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 15:51:01,829 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:01,829 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 15:51:01,829 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 15:51:01,830 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 15:51:01,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:01,830 INFO L85 PathProgramCache]: Analyzing trace with hash 510911504, now seen corresponding path program 1 times [2022-11-25 15:51:01,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:01,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716734557] [2022-11-25 15:51:01,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:01,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:01,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:01,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:01,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 15:51:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:01,953 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 15:51:01,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:01,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716734557] [2022-11-25 15:51:01,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716734557] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:01,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:01,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:01,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75418979] [2022-11-25 15:51:01,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:01,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:01,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:01,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:01,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:01,965 INFO L87 Difference]: Start difference. First operand 68 states and 95 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 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 15:51:01,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:01,998 INFO L93 Difference]: Finished difference Result 119 states and 165 transitions. [2022-11-25 15:51:01,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:01,999 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), 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 26 [2022-11-25 15:51:02,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:02,001 INFO L225 Difference]: With dead ends: 119 [2022-11-25 15:51:02,003 INFO L226 Difference]: Without dead ends: 67 [2022-11-25 15:51:02,004 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 15:51:02,006 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 0 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 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 15:51:02,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:02,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-25 15:51:02,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-25 15:51:02,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.434782608695652) internal successors, (66), 62 states have internal predecessors, (66), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 9 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 15:51:02,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 92 transitions. [2022-11-25 15:51:02,024 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 92 transitions. Word has length 26 [2022-11-25 15:51:02,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:02,025 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 92 transitions. [2022-11-25 15:51:02,025 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), 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 15:51:02,025 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 92 transitions. [2022-11-25 15:51:02,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 15:51:02,026 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:02,026 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] [2022-11-25 15:51:02,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 15:51:02,027 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 15:51:02,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:02,028 INFO L85 PathProgramCache]: Analyzing trace with hash 612038571, now seen corresponding path program 1 times [2022-11-25 15:51:02,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:02,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111439739] [2022-11-25 15:51:02,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:02,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:51:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,084 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 15:51:02,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:02,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111439739] [2022-11-25 15:51:02,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111439739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:02,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:02,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:02,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915409721] [2022-11-25 15:51:02,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:02,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:02,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:02,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:02,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:02,088 INFO L87 Difference]: Start difference. First operand 67 states and 92 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 15:51:02,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:02,102 INFO L93 Difference]: Finished difference Result 110 states and 149 transitions. [2022-11-25 15:51:02,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:02,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 28 [2022-11-25 15:51:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:02,104 INFO L225 Difference]: With dead ends: 110 [2022-11-25 15:51:02,104 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 15:51:02,105 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 15:51:02,106 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 4 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 166 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 15:51:02,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 166 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 15:51:02,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-25 15:51:02,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 45 states have (on average 1.4) internal successors, (63), 60 states have internal predecessors, (63), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 15:51:02,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2022-11-25 15:51:02,116 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 28 [2022-11-25 15:51:02,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:02,117 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2022-11-25 15:51:02,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 15:51:02,117 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2022-11-25 15:51:02,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 15:51:02,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:02,119 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] [2022-11-25 15:51:02,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 15:51:02,119 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:51:02,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:02,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1126717929, now seen corresponding path program 1 times [2022-11-25 15:51:02,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:02,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276677013] [2022-11-25 15:51:02,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:02,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:02,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:02,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:51:02,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,319 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 15:51:02,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:02,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276677013] [2022-11-25 15:51:02,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276677013] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:02,321 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:02,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 15:51:02,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556187320] [2022-11-25 15:51:02,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:02,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:02,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:02,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:02,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:02,326 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 15:51:02,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:02,349 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-11-25 15:51:02,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:02,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 29 [2022-11-25 15:51:02,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:02,354 INFO L225 Difference]: With dead ends: 65 [2022-11-25 15:51:02,355 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 15:51:02,355 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 15:51:02,358 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 2 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 164 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 15:51:02,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 164 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:02,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 15:51:02,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-25 15:51:02,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 59 states have internal predecessors, (62), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 15:51:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 86 transitions. [2022-11-25 15:51:02,372 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 86 transitions. Word has length 29 [2022-11-25 15:51:02,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:02,373 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 86 transitions. [2022-11-25 15:51:02,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 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 15:51:02,373 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 86 transitions. [2022-11-25 15:51:02,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 15:51:02,374 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:02,374 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] [2022-11-25 15:51:02,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 15:51:02,375 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:51:02,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:02,376 INFO L85 PathProgramCache]: Analyzing trace with hash 568517554, now seen corresponding path program 1 times [2022-11-25 15:51:02,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:02,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486499664] [2022-11-25 15:51:02,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:02,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:02,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:51:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,540 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 15:51:02,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:02,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486499664] [2022-11-25 15:51:02,541 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486499664] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:02,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:02,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:02,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935487069] [2022-11-25 15:51:02,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:02,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:51:02,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:02,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:51:02,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:51:02,543 INFO L87 Difference]: Start difference. First operand 64 states and 86 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 15:51:02,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:02,585 INFO L93 Difference]: Finished difference Result 64 states and 86 transitions. [2022-11-25 15:51:02,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:51:02,586 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 30 [2022-11-25 15:51:02,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:02,589 INFO L225 Difference]: With dead ends: 64 [2022-11-25 15:51:02,589 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 15:51:02,589 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:51:02,595 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 34 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:51:02,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 198 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:02,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 15:51:02,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-25 15:51:02,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 58 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 15:51:02,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 85 transitions. [2022-11-25 15:51:02,607 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 85 transitions. Word has length 30 [2022-11-25 15:51:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:02,607 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 85 transitions. [2022-11-25 15:51:02,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 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 15:51:02,608 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 85 transitions. [2022-11-25 15:51:02,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 15:51:02,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:02,609 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, 1, 1, 1, 1] [2022-11-25 15:51:02,609 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 15:51:02,610 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:51:02,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:02,613 INFO L85 PathProgramCache]: Analyzing trace with hash -243306749, now seen corresponding path program 1 times [2022-11-25 15:51:02,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:02,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47654700] [2022-11-25 15:51:02,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:02,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:51:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,715 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 15:51:02,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:02,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47654700] [2022-11-25 15:51:02,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47654700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:02,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:02,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:02,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813604171] [2022-11-25 15:51:02,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:02,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:02,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:02,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:02,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:02,720 INFO L87 Difference]: Start difference. First operand 63 states and 85 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 15:51:02,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:02,741 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2022-11-25 15:51:02,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:02,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 35 [2022-11-25 15:51:02,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:02,743 INFO L225 Difference]: With dead ends: 95 [2022-11-25 15:51:02,743 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 15:51:02,746 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 15:51:02,749 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 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 15:51:02,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:02,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 15:51:02,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-25 15:51:02,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 55 states have internal predecessors, (58), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 15:51:02,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2022-11-25 15:51:02,770 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 35 [2022-11-25 15:51:02,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:02,773 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2022-11-25 15:51:02,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 15:51:02,773 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2022-11-25 15:51:02,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 15:51:02,774 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:02,774 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] [2022-11-25 15:51:02,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 15:51:02,775 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:51:02,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:02,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1207061858, now seen corresponding path program 1 times [2022-11-25 15:51:02,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:02,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23953343] [2022-11-25 15:51:02,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:02,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:02,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:02,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:51:02,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 15:51:02,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:02,897 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 15:51:02,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:02,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23953343] [2022-11-25 15:51:02,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23953343] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:02,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:02,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:02,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036976063] [2022-11-25 15:51:02,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:02,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:51:02,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:02,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:51:02,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:51:02,905 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 15:51:02,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:02,946 INFO L93 Difference]: Finished difference Result 72 states and 93 transitions. [2022-11-25 15:51:02,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:51:02,947 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 40 [2022-11-25 15:51:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:02,951 INFO L225 Difference]: With dead ends: 72 [2022-11-25 15:51:02,951 INFO L226 Difference]: Without dead ends: 71 [2022-11-25 15:51:02,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:51:02,953 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 22 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:51:02,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 215 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:02,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-11-25 15:51:02,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 60. [2022-11-25 15:51:02,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 54 states have internal predecessors, (57), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 15:51:02,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 79 transitions. [2022-11-25 15:51:02,970 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 79 transitions. Word has length 40 [2022-11-25 15:51:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:02,971 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 79 transitions. [2022-11-25 15:51:02,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 states have internal predecessors, (28), 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 15:51:02,971 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 79 transitions. [2022-11-25 15:51:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 15:51:02,972 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:02,972 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] [2022-11-25 15:51:02,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 15:51:02,973 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 15:51:02,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:02,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1235788226, now seen corresponding path program 1 times [2022-11-25 15:51:02,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:02,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182495142] [2022-11-25 15:51:02,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:02,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:03,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:51:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 15:51:03,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,083 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 15:51:03,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:03,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182495142] [2022-11-25 15:51:03,084 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182495142] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:03,084 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:03,084 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:03,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55211] [2022-11-25 15:51:03,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:03,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:51:03,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:03,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:51:03,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:51:03,087 INFO L87 Difference]: Start difference. First operand 60 states and 79 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 15:51:03,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:03,122 INFO L93 Difference]: Finished difference Result 79 states and 104 transitions. [2022-11-25 15:51:03,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:51:03,122 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 41 [2022-11-25 15:51:03,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:03,124 INFO L225 Difference]: With dead ends: 79 [2022-11-25 15:51:03,124 INFO L226 Difference]: Without dead ends: 78 [2022-11-25 15:51:03,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:51:03,125 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 16 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:51:03,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 231 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:03,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-11-25 15:51:03,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 64. [2022-11-25 15:51:03,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 58 states have internal predecessors, (62), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 15:51:03,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 84 transitions. [2022-11-25 15:51:03,147 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 84 transitions. Word has length 41 [2022-11-25 15:51:03,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:03,149 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 84 transitions. [2022-11-25 15:51:03,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 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 15:51:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 84 transitions. [2022-11-25 15:51:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 15:51:03,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:03,156 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] [2022-11-25 15:51:03,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 15:51:03,156 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:51:03,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:03,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1237635268, now seen corresponding path program 1 times [2022-11-25 15:51:03,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:03,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698554882] [2022-11-25 15:51:03,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:03,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:51:03,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 15:51:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,237 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 15:51:03,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:03,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698554882] [2022-11-25 15:51:03,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698554882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:03,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:03,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:03,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982904102] [2022-11-25 15:51:03,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:03,238 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:03,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:03,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:03,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:03,240 INFO L87 Difference]: Start difference. First operand 64 states and 84 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 15:51:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:03,256 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2022-11-25 15:51:03,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:03,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 41 [2022-11-25 15:51:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:03,257 INFO L225 Difference]: With dead ends: 90 [2022-11-25 15:51:03,258 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 15:51:03,259 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 15:51:03,259 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 149 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 15:51:03,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 149 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:03,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 15:51:03,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-25 15:51:03,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 57 states have internal predecessors, (61), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 15:51:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2022-11-25 15:51:03,280 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 83 transitions. Word has length 41 [2022-11-25 15:51:03,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:03,280 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 83 transitions. [2022-11-25 15:51:03,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 15:51:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 83 transitions. [2022-11-25 15:51:03,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 15:51:03,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:03,284 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, 1, 1, 1, 1] [2022-11-25 15:51:03,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 15:51:03,286 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:51:03,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:03,287 INFO L85 PathProgramCache]: Analyzing trace with hash -2051086297, now seen corresponding path program 1 times [2022-11-25 15:51:03,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:03,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072110862] [2022-11-25 15:51:03,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:03,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:03,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:51:03,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 15:51:03,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 15:51:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,366 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 15:51:03,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:03,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072110862] [2022-11-25 15:51:03,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072110862] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:03,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:03,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:03,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950430094] [2022-11-25 15:51:03,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:03,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:03,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:03,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:03,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:03,369 INFO L87 Difference]: Start difference. First operand 64 states and 83 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 15:51:03,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:03,380 INFO L93 Difference]: Finished difference Result 85 states and 108 transitions. [2022-11-25 15:51:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:03,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 45 [2022-11-25 15:51:03,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:03,382 INFO L225 Difference]: With dead ends: 85 [2022-11-25 15:51:03,382 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 15:51:03,383 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 15:51:03,384 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 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 15:51:03,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:03,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 15:51:03,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-25 15:51:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 52 states have internal predecessors, (54), 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 15:51:03,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 74 transitions. [2022-11-25 15:51:03,390 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 74 transitions. Word has length 45 [2022-11-25 15:51:03,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:03,392 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 74 transitions. [2022-11-25 15:51:03,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 15:51:03,392 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 74 transitions. [2022-11-25 15:51:03,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 15:51:03,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:03,394 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] [2022-11-25 15:51:03,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 15:51:03,395 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:51:03,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:03,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1068830320, now seen corresponding path program 1 times [2022-11-25 15:51:03,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:03,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373034485] [2022-11-25 15:51:03,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:03,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:51:03,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 15:51:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,486 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 15:51:03,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:03,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373034485] [2022-11-25 15:51:03,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373034485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:03,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:03,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:03,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053121755] [2022-11-25 15:51:03,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:03,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:03,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:03,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:03,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:03,489 INFO L87 Difference]: Start difference. First operand 58 states and 74 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 15:51:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:03,507 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2022-11-25 15:51:03,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:03,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 46 [2022-11-25 15:51:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:03,510 INFO L225 Difference]: With dead ends: 73 [2022-11-25 15:51:03,510 INFO L226 Difference]: Without dead ends: 56 [2022-11-25 15:51:03,511 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 15:51:03,512 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 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 15:51:03,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:03,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-25 15:51:03,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-25 15:51:03,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 43 states have (on average 1.186046511627907) internal successors, (51), 49 states have internal predecessors, (51), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 15:51:03,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 69 transitions. [2022-11-25 15:51:03,528 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 69 transitions. Word has length 46 [2022-11-25 15:51:03,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:03,528 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 69 transitions. [2022-11-25 15:51:03,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 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 15:51:03,528 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 69 transitions. [2022-11-25 15:51:03,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 15:51:03,530 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:03,530 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, 1, 1] [2022-11-25 15:51:03,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 15:51:03,530 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:51:03,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:03,531 INFO L85 PathProgramCache]: Analyzing trace with hash -2085155984, now seen corresponding path program 1 times [2022-11-25 15:51:03,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:03,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117703499] [2022-11-25 15:51:03,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:03,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:03,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:51:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 15:51:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 15:51:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,655 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 15:51:03,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:03,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117703499] [2022-11-25 15:51:03,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117703499] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:03,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:03,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:03,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461561823] [2022-11-25 15:51:03,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:03,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:51:03,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:03,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:51:03,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:51:03,659 INFO L87 Difference]: Start difference. First operand 56 states and 69 transitions. Second operand has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:51:03,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:03,676 INFO L93 Difference]: Finished difference Result 56 states and 69 transitions. [2022-11-25 15:51:03,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:51:03,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-11-25 15:51:03,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:03,678 INFO L225 Difference]: With dead ends: 56 [2022-11-25 15:51:03,678 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 15:51:03,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:51:03,680 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 8 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 187 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 15:51:03,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 187 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:03,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 15:51:03,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-25 15:51:03,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 48 states have internal predecessors, (50), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 15:51:03,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2022-11-25 15:51:03,686 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 51 [2022-11-25 15:51:03,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:03,686 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2022-11-25 15:51:03,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.333333333333334) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 15:51:03,687 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-11-25 15:51:03,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 15:51:03,687 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:03,687 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, 1, 1, 1] [2022-11-25 15:51:03,688 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 15:51:03,688 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:51:03,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:03,691 INFO L85 PathProgramCache]: Analyzing trace with hash -215325871, now seen corresponding path program 1 times [2022-11-25 15:51:03,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:03,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298500642] [2022-11-25 15:51:03,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:03,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:03,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:51:03,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 15:51:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 15:51:03,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,815 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 15:51:03,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:03,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298500642] [2022-11-25 15:51:03,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298500642] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:03,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:03,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:03,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70872161] [2022-11-25 15:51:03,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:03,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 15:51:03,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:03,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 15:51:03,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 15:51:03,820 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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 15:51:03,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:03,840 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2022-11-25 15:51:03,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 15:51:03,841 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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 52 [2022-11-25 15:51:03,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:03,841 INFO L225 Difference]: With dead ends: 60 [2022-11-25 15:51:03,841 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 15:51:03,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 15:51:03,842 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 15:51:03,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 195 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:03,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 15:51:03,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-25 15:51:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 48 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 15:51:03,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2022-11-25 15:51:03,850 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 52 [2022-11-25 15:51:03,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:03,851 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2022-11-25 15:51:03,851 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.666666666666666) internal successors, (38), 4 states have internal predecessors, (38), 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 15:51:03,851 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2022-11-25 15:51:03,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 15:51:03,852 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 15:51:03,852 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, 1, 1, 1, 1] [2022-11-25 15:51:03,852 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 15:51:03,853 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 15:51:03,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 15:51:03,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1970152687, now seen corresponding path program 1 times [2022-11-25 15:51:03,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 15:51:03,854 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144127459] [2022-11-25 15:51:03,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 15:51:03,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 15:51:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 15:51:03,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 15:51:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 15:51:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 15:51:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 15:51:03,955 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 15:51:03,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 15:51:03,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144127459] [2022-11-25 15:51:03,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144127459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 15:51:03,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 15:51:03,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 15:51:03,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [551884934] [2022-11-25 15:51:03,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 15:51:03,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 15:51:03,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 15:51:03,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 15:51:03,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 15:51:03,960 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 15:51:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 15:51:03,969 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-11-25 15:51:03,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 15:51:03,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 53 [2022-11-25 15:51:03,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 15:51:03,970 INFO L225 Difference]: With dead ends: 59 [2022-11-25 15:51:03,970 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 15:51:03,971 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 15:51:03,971 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 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 15:51:03,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 15:51:03,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 15:51:03,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 15:51:03,972 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 15:51:03,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 15:51:03,973 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2022-11-25 15:51:03,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 15:51:03,973 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 15:51:03,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 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 15:51:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 15:51:03,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 15:51:03,976 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-25 15:51:03,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-25 15:51:03,977 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-25 15:51:03,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-25 15:51:03,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-25 15:51:03,978 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-25 15:51:03,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-25 15:51:03,980 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-25 15:51:03,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 15:51:03,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 15:51:04,186 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-25 15:51:04,186 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 15:51:04,186 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-25 15:51:04,187 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 15:51:04,187 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 15:51:04,187 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-25 15:51:04,187 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 15:51:04,187 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2022-11-25 15:51:04,188 INFO L899 garLoopResultBuilder]: For program point L1596(line 1596) no Hoare annotation was computed. [2022-11-25 15:51:04,188 INFO L895 garLoopResultBuilder]: At program point L1563(line 1563) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch92#1|) [2022-11-25 15:51:04,188 INFO L899 garLoopResultBuilder]: For program point L1563-1(lines 1557 1564) no Hoare annotation was computed. [2022-11-25 15:51:04,188 INFO L899 garLoopResultBuilder]: For program point L1654(line 1654) no Hoare annotation was computed. [2022-11-25 15:51:04,188 INFO L895 garLoopResultBuilder]: At program point L1613(lines 1613 1630) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 15:51:04,189 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1676) no Hoare annotation was computed. [2022-11-25 15:51:04,189 INFO L899 garLoopResultBuilder]: For program point L1638(line 1638) no Hoare annotation was computed. [2022-11-25 15:51:04,189 INFO L895 garLoopResultBuilder]: At program point L1605(line 1605) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch97#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 15:51:04,189 INFO L899 garLoopResultBuilder]: For program point L1605-1(lines 1599 1606) no Hoare annotation was computed. [2022-11-25 15:51:04,190 INFO L902 garLoopResultBuilder]: At program point L1696(line 1696) the Hoare annotation is: true [2022-11-25 15:51:04,190 INFO L899 garLoopResultBuilder]: For program point L1696-1(line 1696) no Hoare annotation was computed. [2022-11-25 15:51:04,190 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2022-11-25 15:51:04,190 INFO L895 garLoopResultBuilder]: At program point L1663(lines 1663 1671) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_goodG2B2_~data~3#1| 2))) (and (<= 0 .cse0) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (<= .cse0 0))) [2022-11-25 15:51:04,190 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 15:51:04,191 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 15:51:04,191 INFO L895 garLoopResultBuilder]: At program point L1655(line 1655) the Hoare annotation is: false [2022-11-25 15:51:04,191 INFO L899 garLoopResultBuilder]: For program point L1647(line 1647) no Hoare annotation was computed. [2022-11-25 15:51:04,191 INFO L895 garLoopResultBuilder]: At program point L1581(line 1581) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch95#1|) [2022-11-25 15:51:04,191 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1589) no Hoare annotation was computed. [2022-11-25 15:51:04,192 INFO L902 garLoopResultBuilder]: At program point L1672(lines 1672 1684) the Hoare annotation is: true [2022-11-25 15:51:04,192 INFO L895 garLoopResultBuilder]: At program point L1639(line 1639) the Hoare annotation is: false [2022-11-25 15:51:04,192 INFO L899 garLoopResultBuilder]: For program point L1573(line 1573) no Hoare annotation was computed. [2022-11-25 15:51:04,192 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1579) no Hoare annotation was computed. [2022-11-25 15:51:04,192 INFO L899 garLoopResultBuilder]: For program point L1590(lines 1590 1631) no Hoare annotation was computed. [2022-11-25 15:51:04,192 INFO L899 garLoopResultBuilder]: For program point L1557(lines 1557 1564) no Hoare annotation was computed. [2022-11-25 15:51:04,193 INFO L899 garLoopResultBuilder]: For program point L1681(line 1681) no Hoare annotation was computed. [2022-11-25 15:51:04,193 INFO L899 garLoopResultBuilder]: For program point L1615(line 1615) no Hoare annotation was computed. [2022-11-25 15:51:04,193 INFO L895 garLoopResultBuilder]: At program point L1574(line 1574) the Hoare annotation is: false [2022-11-25 15:51:04,193 INFO L902 garLoopResultBuilder]: At program point L1698(line 1698) the Hoare annotation is: true [2022-11-25 15:51:04,193 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2022-11-25 15:51:04,194 INFO L899 garLoopResultBuilder]: For program point L1698-1(line 1698) no Hoare annotation was computed. [2022-11-25 15:51:04,194 INFO L899 garLoopResultBuilder]: For program point L1632(lines 1632 1658) no Hoare annotation was computed. [2022-11-25 15:51:04,194 INFO L899 garLoopResultBuilder]: For program point L1599(lines 1599 1606) no Hoare annotation was computed. [2022-11-25 15:51:04,194 INFO L895 garLoopResultBuilder]: At program point L1624(line 1624) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 15:51:04,194 INFO L902 garLoopResultBuilder]: At program point L1682(line 1682) the Hoare annotation is: true [2022-11-25 15:51:04,195 INFO L899 garLoopResultBuilder]: For program point L1649(line 1649) no Hoare annotation was computed. [2022-11-25 15:51:04,195 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1625) no Hoare annotation was computed. [2022-11-25 15:51:04,195 INFO L899 garLoopResultBuilder]: For program point L1649-1(line 1649) no Hoare annotation was computed. [2022-11-25 15:51:04,195 INFO L899 garLoopResultBuilder]: For program point L1674(line 1674) no Hoare annotation was computed. [2022-11-25 15:51:04,195 INFO L899 garLoopResultBuilder]: For program point L1641(line 1641) no Hoare annotation was computed. [2022-11-25 15:51:04,195 INFO L902 garLoopResultBuilder]: At program point L1699(lines 1693 1700) the Hoare annotation is: true [2022-11-25 15:51:04,196 INFO L899 garLoopResultBuilder]: For program point L1567(line 1567) no Hoare annotation was computed. [2022-11-25 15:51:04,196 INFO L899 garLoopResultBuilder]: For program point L1609(line 1609) no Hoare annotation was computed. [2022-11-25 15:51:04,196 INFO L899 garLoopResultBuilder]: For program point L1576(line 1576) no Hoare annotation was computed. [2022-11-25 15:51:04,196 INFO L895 garLoopResultBuilder]: At program point L1568(line 1568) the Hoare annotation is: false [2022-11-25 15:51:04,196 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 15:51:04,196 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1649) no Hoare annotation was computed. [2022-11-25 15:51:04,197 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1685) no Hoare annotation was computed. [2022-11-25 15:51:04,197 INFO L895 garLoopResultBuilder]: At program point L1651(line 1651) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch103#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 15:51:04,197 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2022-11-25 15:51:04,197 INFO L895 garLoopResultBuilder]: At program point L1585(line 1585) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch95#1|) [2022-11-25 15:51:04,197 INFO L899 garLoopResultBuilder]: For program point L1618-1(line 1618) no Hoare annotation was computed. [2022-11-25 15:51:04,198 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1570) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch92#1|) [2022-11-25 15:51:04,198 INFO L899 garLoopResultBuilder]: For program point L1676(line 1676) no Hoare annotation was computed. [2022-11-25 15:51:04,198 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2022-11-25 15:51:04,198 INFO L895 garLoopResultBuilder]: At program point L1610(line 1610) the Hoare annotation is: false [2022-11-25 15:51:04,198 INFO L899 garLoopResultBuilder]: For program point L1577(lines 1577 1586) no Hoare annotation was computed. [2022-11-25 15:51:04,199 INFO L899 garLoopResultBuilder]: For program point L1668(line 1668) no Hoare annotation was computed. [2022-11-25 15:51:04,199 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 15:51:04,199 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1649) no Hoare annotation was computed. [2022-11-25 15:51:04,199 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2022-11-25 15:51:04,199 INFO L895 garLoopResultBuilder]: At program point L1594(lines 1594 1612) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch97#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 15:51:04,200 INFO L895 garLoopResultBuilder]: At program point L1669(line 1669) the Hoare annotation is: false [2022-11-25 15:51:04,200 INFO L895 garLoopResultBuilder]: At program point L1636(lines 1636 1644) the Hoare annotation is: (let ((.cse0 (+ 2 |ULTIMATE.start_goodG2B1_~data~2#1|))) (and (<= .cse0 0) (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch102#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (<= 0 .cse0))) [2022-11-25 15:51:04,200 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1618) no Hoare annotation was computed. [2022-11-25 15:51:04,200 INFO L895 garLoopResultBuilder]: At program point L1628(line 1628) the Hoare annotation is: false [2022-11-25 15:51:04,200 INFO L899 garLoopResultBuilder]: For program point L1686(lines 1686 1692) no Hoare annotation was computed. [2022-11-25 15:51:04,201 INFO L895 garLoopResultBuilder]: At program point L1620(line 1620) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch100#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 15:51:04,201 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-25 15:51:04,201 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-11-25 15:51:04,201 INFO L895 garLoopResultBuilder]: At program point L1645(lines 1645 1657) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch103#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 15:51:04,201 INFO L899 garLoopResultBuilder]: For program point L1579(line 1579) no Hoare annotation was computed. [2022-11-25 15:51:04,202 INFO L899 garLoopResultBuilder]: For program point L1579-1(line 1579) no Hoare annotation was computed. [2022-11-25 15:51:04,202 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1676) no Hoare annotation was computed. [2022-11-25 15:51:04,202 INFO L895 garLoopResultBuilder]: At program point L1571(lines 1571 1588) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch95#1|) [2022-11-25 15:51:04,206 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 15:51:04,208 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 15:51:04,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 03:51:04 BoogieIcfgContainer [2022-11-25 15:51:04,231 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 15:51:04,232 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 15:51:04,232 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 15:51:04,232 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 15:51:04,233 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 03:51:00" (3/4) ... [2022-11-25 15:51:04,236 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 15:51:04,245 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-25 15:51:04,246 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-25 15:51:04,256 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-11-25 15:51:04,256 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-25 15:51:04,257 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-11-25 15:51:04,257 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-11-25 15:51:04,257 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 15:51:04,329 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3540abfc-9bb1-4428-a6f8-1be2c446154c/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 15:51:04,329 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 15:51:04,331 INFO L158 Benchmark]: Toolchain (without parser) took 6174.15ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 133.2MB in the beginning and 70.0MB in the end (delta: 63.2MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. [2022-11-25 15:51:04,331 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 127.9MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 15:51:04,331 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1550.05ms. Allocated memory is still 165.7MB. Free memory was 133.2MB in the beginning and 117.0MB in the end (delta: 16.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2022-11-25 15:51:04,331 INFO L158 Benchmark]: Boogie Procedure Inliner took 105.14ms. Allocated memory is still 165.7MB. Free memory was 117.0MB in the beginning and 113.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:51:04,332 INFO L158 Benchmark]: Boogie Preprocessor took 62.90ms. Allocated memory is still 165.7MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 15:51:04,332 INFO L158 Benchmark]: RCFGBuilder took 613.37ms. Allocated memory is still 165.7MB. Free memory was 111.8MB in the beginning and 93.0MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 15:51:04,332 INFO L158 Benchmark]: TraceAbstraction took 3735.50ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 93.0MB in the beginning and 75.2MB in the end (delta: 17.8MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. [2022-11-25 15:51:04,333 INFO L158 Benchmark]: Witness Printer took 97.87ms. Allocated memory is still 199.2MB. Free memory was 75.2MB in the beginning and 70.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 15:51:04,334 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.35ms. Allocated memory is still 127.9MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1550.05ms. Allocated memory is still 165.7MB. Free memory was 133.2MB in the beginning and 117.0MB in the end (delta: 16.2MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 105.14ms. Allocated memory is still 165.7MB. Free memory was 117.0MB in the beginning and 113.9MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 62.90ms. Allocated memory is still 165.7MB. Free memory was 113.9MB in the beginning and 111.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 613.37ms. Allocated memory is still 165.7MB. Free memory was 111.8MB in the beginning and 93.0MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3735.50ms. Allocated memory was 165.7MB in the beginning and 199.2MB in the end (delta: 33.6MB). Free memory was 93.0MB in the beginning and 75.2MB in the end (delta: 17.8MB). Peak memory consumption was 54.2MB. Max. memory is 16.1GB. * Witness Printer took 97.87ms. Allocated memory is still 199.2MB. Free memory was 75.2MB in the beginning and 70.0MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1579]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1618]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1649]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1676]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1676]: 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, 83 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.6s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 198 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 161 mSDsluCounter, 3008 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1633 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1375 mSDtfsCounter, 80 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 140 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=0, InterpolantAutomatonStates: 57, 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, 17 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 96 PreInvPairs, 114 NumberOfFragments, 131 HoareAnnotationTreeSize, 96 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 29 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 587 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 570 ConstructedInterpolants, 0 QuantifiedInterpolants, 662 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 128/128 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: 1636]: Loop Invariant Derived loop invariant: (((2 + data <= 0 && data <= 2147483647) && aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = -2; break; }-aux) && data <= 2147483647) && 0 <= 2 + data - InvariantResult [Line: 1571]: Loop Invariant Derived loop invariant: data <= 2147483647 && aux-switch(8) { case 7: printLine("Benign, fixed string"); break; default: if (data > (-0x7fffffff - 1)) { data--; int result = data; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; }-aux - InvariantResult [Line: 1613]: Loop Invariant Derived loop invariant: (aux-switch(7) { case 7: if (data > (-0x7fffffff - 1)) { data--; int result = data; printIntLine(result); } else { printLine("data value is too large to perform arithmetic safely."); } break; default: printLine("Benign, fixed string"); break; }-aux && data <= 2147483647) && data <= 2147483647 - InvariantResult [Line: 1693]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1645]: Loop Invariant Derived loop invariant: (data <= 2147483647 && aux-switch(7) { case 7: { data--; int result = data; printIntLine(result); } break; default: printLine("Benign, fixed string"); break; }-aux) && data <= 2147483647 - InvariantResult [Line: 1594]: Loop Invariant Derived loop invariant: (aux-switch(6) { case 6: { char inputBuffer[(3 * sizeof(data) + 2)] = ""; if (fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0)) { data = atoi(inputBuffer); } else { printLine("fgets() failed."); } } break; default: printLine("Benign, fixed string"); break; }-aux && data <= 2147483647) && data <= 2147483647 - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: data <= 2147483647 && aux-switch(6) { case 6: { char inputBuffer[(3 * sizeof(data) + 2)] = ""; if (fgets(inputBuffer, (3 * sizeof(data) + 2), stdin) != ((void *)0)) { data = atoi(inputBuffer); } else { printLine("fgets() failed."); } } break; default: printLine("Benign, fixed string"); break; }-aux - InvariantResult [Line: 1672]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1663]: Loop Invariant Derived loop invariant: ((0 <= data + 2 && data <= 2147483647) && data <= 2147483647) && data + 2 <= 0 RESULT: Ultimate proved your program to be correct! [2022-11-25 15:51:04,376 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3540abfc-9bb1-4428-a6f8-1be2c446154c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE