./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b868d56-9d6b-4a62-9318-728d28db050c/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b868d56-9d6b-4a62-9318-728d28db050c/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_4b868d56-9d6b-4a62-9318-728d28db050c/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b868d56-9d6b-4a62-9318-728d28db050c/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b868d56-9d6b-4a62-9318-728d28db050c/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_4b868d56-9d6b-4a62-9318-728d28db050c/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 9201e7b46e737fc47a8de4643d1149fbe3bbd874a732a4c23bafe97925e39ff6 --- 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 18:16:57,253 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:16:57,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:16:57,306 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:16:57,307 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:16:57,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:16:57,314 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:16:57,318 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:16:57,323 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:16:57,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:16:57,327 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:16:57,330 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:16:57,331 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:16:57,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:16:57,339 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:16:57,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:16:57,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:16:57,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:16:57,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:16:57,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:16:57,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:16:57,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:16:57,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:16:57,362 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:16:57,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:16:57,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:16:57,377 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:16:57,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:16:57,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:16:57,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:16:57,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:16:57,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:16:57,386 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:16:57,389 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:16:57,391 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:16:57,391 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:16:57,392 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:16:57,393 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:16:57,393 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:16:57,395 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:16:57,396 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:16:57,398 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b868d56-9d6b-4a62-9318-728d28db050c/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-25 18:16:57,447 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:16:57,447 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:16:57,448 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:16:57,448 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:16:57,450 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:16:57,450 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:16:57,451 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:16:57,451 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:16:57,451 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:16:57,451 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:16:57,453 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 18:16:57,453 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:16:57,453 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:16:57,453 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:16:57,454 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:16:57,454 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:16:57,454 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 18:16:57,454 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:16:57,454 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:16:57,455 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:16:57,455 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:16:57,455 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:16:57,455 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:16:57,456 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:16:57,456 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:16:57,456 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:16:57,456 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:16:57,457 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:16:57,457 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:16:57,458 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:16:57,458 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:16:57,458 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:16:57,458 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:16:57,459 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_4b868d56-9d6b-4a62-9318-728d28db050c/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_4b868d56-9d6b-4a62-9318-728d28db050c/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 -> 9201e7b46e737fc47a8de4643d1149fbe3bbd874a732a4c23bafe97925e39ff6 [2022-11-25 18:16:57,852 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:16:57,889 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:16:57,892 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:16:57,894 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:16:57,895 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:16:57,897 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b868d56-9d6b-4a62-9318-728d28db050c/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_15_good.i [2022-11-25 18:17:01,741 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:17:02,257 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:17:02,257 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b868d56-9d6b-4a62-9318-728d28db050c/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_rand_postdec_15_good.i [2022-11-25 18:17:02,298 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b868d56-9d6b-4a62-9318-728d28db050c/bin/uautomizer-ZsLfNo2U6R/data/06010b7cc/7c1ae226bbe647a789d97caa5b92ee1d/FLAGe91027009 [2022-11-25 18:17:02,320 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b868d56-9d6b-4a62-9318-728d28db050c/bin/uautomizer-ZsLfNo2U6R/data/06010b7cc/7c1ae226bbe647a789d97caa5b92ee1d [2022-11-25 18:17:02,323 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:17:02,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:17:02,327 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:17:02,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:17:02,332 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:17:02,333 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:17:02" (1/1) ... [2022-11-25 18:17:02,334 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3014ba29 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:17:02, skipping insertion in model container [2022-11-25 18:17:02,334 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:17:02" (1/1) ... [2022-11-25 18:17:02,344 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:17:02,414 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:17:02,997 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 18:17:03,669 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 18:17:03,676 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 18:17:03,679 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 18:17:03,683 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 18:17:03,684 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 18:17:03,746 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 18:17:03,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:17:03,760 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:17:03,785 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 18:17:03,853 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 18:17:03,855 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 18:17:03,857 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 18:17:03,861 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 18:17:03,862 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 18:17:03,896 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 18:17:03,898 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:17:04,103 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:17:04,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:17:04 WrapperNode [2022-11-25 18:17:04,105 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:17:04,106 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:17:04,107 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:17:04,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:17:04,117 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:17:04" (1/1) ... [2022-11-25 18:17:04,179 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:17:04" (1/1) ... [2022-11-25 18:17:04,243 INFO L138 Inliner]: procedures = 503, calls = 81, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 193 [2022-11-25 18:17:04,246 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:17:04,246 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:17:04,248 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:17:04,248 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:17:04,259 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:17:04" (1/1) ... [2022-11-25 18:17:04,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:17:04" (1/1) ... [2022-11-25 18:17:04,279 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:17:04" (1/1) ... [2022-11-25 18:17:04,282 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:17:04" (1/1) ... [2022-11-25 18:17:04,290 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:17:04" (1/1) ... [2022-11-25 18:17:04,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:17:04" (1/1) ... [2022-11-25 18:17:04,306 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:17:04" (1/1) ... [2022-11-25 18:17:04,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:17:04" (1/1) ... [2022-11-25 18:17:04,316 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:17:04,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:17:04,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:17:04,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:17:04,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:17:04" (1/1) ... [2022-11-25 18:17:04,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:17:04,357 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b868d56-9d6b-4a62-9318-728d28db050c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:17:04,373 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b868d56-9d6b-4a62-9318-728d28db050c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:17:04,387 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b868d56-9d6b-4a62-9318-728d28db050c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:17:04,432 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-25 18:17:04,433 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-25 18:17:04,433 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-25 18:17:04,433 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-25 18:17:04,433 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:17:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:17:04,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:17:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-25 18:17:04,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:17:04,652 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:17:04,654 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:17:05,132 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:17:05,141 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:17:05,141 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 18:17:05,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:17:05 BoogieIcfgContainer [2022-11-25 18:17:05,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:17:05,146 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:17:05,147 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:17:05,151 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:17:05,151 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:17:02" (1/3) ... [2022-11-25 18:17:05,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88c3680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:17:05, skipping insertion in model container [2022-11-25 18:17:05,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:17:04" (2/3) ... [2022-11-25 18:17:05,152 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@88c3680 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:17:05, skipping insertion in model container [2022-11-25 18:17:05,152 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:17:05" (3/3) ... [2022-11-25 18:17:05,154 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_rand_postdec_15_good.i [2022-11-25 18:17:05,178 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:17:05,178 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-25 18:17:05,241 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:17:05,249 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;@571458ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:17:05,250 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 18:17:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.537037037037037) internal successors, (83), 76 states have internal predecessors, (83), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 18:17:05,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 18:17:05,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:05,266 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:05,267 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 18:17:05,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:05,274 INFO L85 PathProgramCache]: Analyzing trace with hash 998974264, now seen corresponding path program 1 times [2022-11-25 18:17:05,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:05,286 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507938926] [2022-11-25 18:17:05,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:05,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:05,691 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 18:17:05,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:05,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507938926] [2022-11-25 18:17:05,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507938926] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:05,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:05,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:17:05,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290383627] [2022-11-25 18:17:05,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:05,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:17:05,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:05,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:17:05,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:17:05,772 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.537037037037037) internal successors, (83), 76 states have internal predecessors, (83), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 4.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 18:17:05,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:05,857 INFO L93 Difference]: Finished difference Result 153 states and 216 transitions. [2022-11-25 18:17:05,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:17:05,861 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 18:17:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:05,873 INFO L225 Difference]: With dead ends: 153 [2022-11-25 18:17:05,873 INFO L226 Difference]: Without dead ends: 68 [2022-11-25 18:17:05,880 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 18:17:05,886 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 213 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 18:17:05,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 213 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-11-25 18:17:05,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-11-25 18:17:05,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 46 states have (on average 1.5217391304347827) internal successors, (70), 64 states have internal predecessors, (70), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 18:17:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 94 transitions. [2022-11-25 18:17:05,957 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 94 transitions. Word has length 15 [2022-11-25 18:17:05,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:05,965 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 94 transitions. [2022-11-25 18:17:05,966 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 18:17:05,967 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 94 transitions. [2022-11-25 18:17:05,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 18:17:05,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:05,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:05,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:17:05,971 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 18:17:05,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:05,973 INFO L85 PathProgramCache]: Analyzing trace with hash 45972825, now seen corresponding path program 1 times [2022-11-25 18:17:05,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:05,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802337526] [2022-11-25 18:17:05,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:05,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:06,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:06,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:06,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:06,176 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 18:17:06,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:06,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802337526] [2022-11-25 18:17:06,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802337526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:06,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:06,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:17:06,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676461651] [2022-11-25 18:17:06,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:06,181 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:17:06,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:06,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:17:06,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:17:06,183 INFO L87 Difference]: Start difference. First operand 68 states and 94 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 18:17:06,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:06,203 INFO L93 Difference]: Finished difference Result 68 states and 94 transitions. [2022-11-25 18:17:06,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:17:06,205 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 18:17:06,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:06,207 INFO L225 Difference]: With dead ends: 68 [2022-11-25 18:17:06,207 INFO L226 Difference]: Without dead ends: 67 [2022-11-25 18:17:06,208 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 18:17:06,209 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 2 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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 18:17:06,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 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 18:17:06,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-11-25 18:17:06,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-11-25 18:17:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 46 states have (on average 1.5) internal successors, (69), 63 states have internal predecessors, (69), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 18:17:06,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2022-11-25 18:17:06,226 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 16 [2022-11-25 18:17:06,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:06,226 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2022-11-25 18:17:06,226 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 18:17:06,227 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2022-11-25 18:17:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 18:17:06,228 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:06,228 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 18:17:06,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:17:06,229 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 18:17:06,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:06,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1425157655, now seen corresponding path program 1 times [2022-11-25 18:17:06,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:06,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760958798] [2022-11-25 18:17:06,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:06,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:06,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:06,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:06,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:06,453 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 18:17:06,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:06,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760958798] [2022-11-25 18:17:06,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760958798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:06,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:06,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:17:06,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818505520] [2022-11-25 18:17:06,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:06,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:17:06,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:06,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:17:06,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:17:06,458 INFO L87 Difference]: Start difference. First operand 67 states and 93 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 18:17:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:06,496 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2022-11-25 18:17:06,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:17:06,497 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 18:17:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:06,499 INFO L225 Difference]: With dead ends: 67 [2022-11-25 18:17:06,499 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 18:17:06,500 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 18:17:06,501 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 54 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 196 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 18:17:06,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 196 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:06,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 18:17:06,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-25 18:17:06,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.4782608695652173) internal successors, (68), 62 states have internal predecessors, (68), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 18:17:06,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2022-11-25 18:17:06,515 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 17 [2022-11-25 18:17:06,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:06,516 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2022-11-25 18:17:06,516 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 18:17:06,516 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2022-11-25 18:17:06,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-25 18:17:06,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:06,518 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 18:17:06,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:17:06,519 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 18:17:06,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:06,520 INFO L85 PathProgramCache]: Analyzing trace with hash -674493454, now seen corresponding path program 1 times [2022-11-25 18:17:06,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:06,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821319044] [2022-11-25 18:17:06,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:06,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:06,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:06,591 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 18:17:06,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:06,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821319044] [2022-11-25 18:17:06,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821319044] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:06,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:06,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:17:06,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989820582] [2022-11-25 18:17:06,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:06,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:17:06,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:06,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:17:06,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:17:06,596 INFO L87 Difference]: Start difference. First operand 66 states and 92 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 18:17:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:06,619 INFO L93 Difference]: Finished difference Result 116 states and 160 transitions. [2022-11-25 18:17:06,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:17:06,620 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 18:17:06,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:06,622 INFO L225 Difference]: With dead ends: 116 [2022-11-25 18:17:06,622 INFO L226 Difference]: Without dead ends: 66 [2022-11-25 18:17:06,623 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 18:17:06,625 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 5 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 168 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 18:17:06,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 168 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:06,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-11-25 18:17:06,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-11-25 18:17:06,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 61 states have internal predecessors, (67), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 7 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 18:17:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2022-11-25 18:17:06,639 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 22 [2022-11-25 18:17:06,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:06,640 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2022-11-25 18:17:06,641 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 18:17:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2022-11-25 18:17:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 18:17:06,642 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:06,642 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 18:17:06,643 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 18:17:06,643 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 18:17:06,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:06,644 INFO L85 PathProgramCache]: Analyzing trace with hash -1904871187, now seen corresponding path program 1 times [2022-11-25 18:17:06,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:06,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063489203] [2022-11-25 18:17:06,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:06,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:06,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:06,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 18:17:06,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:06,727 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 18:17:06,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:06,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063489203] [2022-11-25 18:17:06,728 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063489203] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:06,728 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:06,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:17:06,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111600239] [2022-11-25 18:17:06,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:06,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:17:06,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:06,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:17:06,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:17:06,732 INFO L87 Difference]: Start difference. First operand 66 states and 91 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 18:17:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:06,752 INFO L93 Difference]: Finished difference Result 116 states and 159 transitions. [2022-11-25 18:17:06,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:17:06,753 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 18:17:06,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:06,755 INFO L225 Difference]: With dead ends: 116 [2022-11-25 18:17:06,755 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 18:17:06,756 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 18:17:06,758 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 0 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 170 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 18:17:06,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 170 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:06,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 18:17:06,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-25 18:17:06,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 46 states have (on average 1.434782608695652) internal successors, (66), 60 states have internal predecessors, (66), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 18:17:06,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 88 transitions. [2022-11-25 18:17:06,771 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 88 transitions. Word has length 26 [2022-11-25 18:17:06,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:06,771 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 88 transitions. [2022-11-25 18:17:06,772 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 18:17:06,772 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 88 transitions. [2022-11-25 18:17:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 18:17:06,773 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:06,773 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 18:17:06,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 18:17:06,774 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 18:17:06,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:06,775 INFO L85 PathProgramCache]: Analyzing trace with hash 902429544, now seen corresponding path program 1 times [2022-11-25 18:17:06,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:06,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911268512] [2022-11-25 18:17:06,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:06,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:06,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:06,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:17:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:06,849 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 18:17:06,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:06,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911268512] [2022-11-25 18:17:06,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911268512] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:06,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:06,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:17:06,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755151203] [2022-11-25 18:17:06,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:06,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:17:06,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:06,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:17:06,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:17:06,854 INFO L87 Difference]: Start difference. First operand 65 states and 88 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 18:17:06,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:06,867 INFO L93 Difference]: Finished difference Result 108 states and 145 transitions. [2022-11-25 18:17:06,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:17:06,868 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 18:17:06,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:06,870 INFO L225 Difference]: With dead ends: 108 [2022-11-25 18:17:06,870 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 18:17:06,871 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 18:17:06,872 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 159 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 18:17:06,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 159 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:06,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 18:17:06,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-25 18:17:06,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.4) internal successors, (63), 58 states have internal predecessors, (63), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:17:06,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 83 transitions. [2022-11-25 18:17:06,883 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 83 transitions. Word has length 28 [2022-11-25 18:17:06,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:06,884 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 83 transitions. [2022-11-25 18:17:06,884 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 18:17:06,884 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2022-11-25 18:17:06,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-11-25 18:17:06,885 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:06,886 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 18:17:06,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 18:17:06,886 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 18:17:06,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:06,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1839930966, now seen corresponding path program 1 times [2022-11-25 18:17:06,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:06,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322103082] [2022-11-25 18:17:06,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:06,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:17:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,065 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 18:17:07,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:07,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322103082] [2022-11-25 18:17:07,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322103082] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:07,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:07,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 18:17:07,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328886605] [2022-11-25 18:17:07,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:07,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:17:07,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:07,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:17:07,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:17:07,070 INFO L87 Difference]: Start difference. First operand 63 states and 83 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 18:17:07,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:07,085 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-11-25 18:17:07,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:17:07,087 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 18:17:07,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:07,088 INFO L225 Difference]: With dead ends: 63 [2022-11-25 18:17:07,088 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 18:17:07,089 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 18:17:07,090 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 156 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 18:17:07,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 156 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:07,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 18:17:07,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-25 18:17:07,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 57 states have internal predecessors, (62), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:17:07,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2022-11-25 18:17:07,100 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 29 [2022-11-25 18:17:07,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:07,101 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2022-11-25 18:17:07,101 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 18:17:07,102 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2022-11-25 18:17:07,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-25 18:17:07,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:07,103 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 18:17:07,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:17:07,104 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 18:17:07,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:07,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1203284977, now seen corresponding path program 1 times [2022-11-25 18:17:07,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:07,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795402039] [2022-11-25 18:17:07,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:07,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:07,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:17:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,274 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 18:17:07,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:07,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795402039] [2022-11-25 18:17:07,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795402039] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:07,275 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:07,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:17:07,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33381448] [2022-11-25 18:17:07,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:07,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:17:07,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:07,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:17:07,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:17:07,278 INFO L87 Difference]: Start difference. First operand 62 states and 82 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 18:17:07,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:07,306 INFO L93 Difference]: Finished difference Result 62 states and 82 transitions. [2022-11-25 18:17:07,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:17:07,307 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 18:17:07,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:07,309 INFO L225 Difference]: With dead ends: 62 [2022-11-25 18:17:07,309 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 18:17:07,309 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 18:17:07,311 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 35 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 187 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 18:17:07,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 187 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:07,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 18:17:07,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-25 18:17:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 56 states have internal predecessors, (61), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 6 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 18:17:07,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 81 transitions. [2022-11-25 18:17:07,321 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 81 transitions. Word has length 30 [2022-11-25 18:17:07,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:07,321 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 81 transitions. [2022-11-25 18:17:07,322 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 18:17:07,322 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-11-25 18:17:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 18:17:07,323 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:07,324 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 18:17:07,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 18:17:07,324 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 18:17:07,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:07,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1995870532, now seen corresponding path program 1 times [2022-11-25 18:17:07,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:07,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040547062] [2022-11-25 18:17:07,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:07,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:17:07,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,396 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 18:17:07,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:07,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040547062] [2022-11-25 18:17:07,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040547062] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:07,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:07,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:17:07,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11749096] [2022-11-25 18:17:07,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:07,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:17:07,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:07,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:17:07,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:17:07,401 INFO L87 Difference]: Start difference. First operand 61 states and 81 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 18:17:07,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:07,412 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2022-11-25 18:17:07,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:17:07,413 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 18:17:07,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:07,414 INFO L225 Difference]: With dead ends: 93 [2022-11-25 18:17:07,414 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 18:17:07,415 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 18:17:07,416 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 5 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 141 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 18:17:07,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 141 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:07,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 18:17:07,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-25 18:17:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 44 states have (on average 1.3181818181818181) internal successors, (58), 53 states have internal predecessors, (58), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 18:17:07,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 76 transitions. [2022-11-25 18:17:07,427 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 76 transitions. Word has length 35 [2022-11-25 18:17:07,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:07,427 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 76 transitions. [2022-11-25 18:17:07,428 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 18:17:07,428 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 76 transitions. [2022-11-25 18:17:07,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-11-25 18:17:07,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:07,430 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 18:17:07,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 18:17:07,430 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 18:17:07,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:07,431 INFO L85 PathProgramCache]: Analyzing trace with hash -182219195, now seen corresponding path program 1 times [2022-11-25 18:17:07,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:07,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805072066] [2022-11-25 18:17:07,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:07,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:17:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:17:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,539 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 18:17:07,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:07,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805072066] [2022-11-25 18:17:07,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805072066] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:07,541 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:07,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:17:07,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858815301] [2022-11-25 18:17:07,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:07,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:17:07,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:07,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:17:07,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:17:07,543 INFO L87 Difference]: Start difference. First operand 59 states and 76 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 18:17:07,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:07,570 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2022-11-25 18:17:07,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:17:07,571 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 18:17:07,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:07,573 INFO L225 Difference]: With dead ends: 70 [2022-11-25 18:17:07,573 INFO L226 Difference]: Without dead ends: 69 [2022-11-25 18:17:07,574 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 18:17:07,575 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 22 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 203 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 18:17:07,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 203 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:07,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-25 18:17:07,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-11-25 18:17:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 44 states have (on average 1.2954545454545454) internal successors, (57), 52 states have internal predecessors, (57), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 18:17:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 75 transitions. [2022-11-25 18:17:07,586 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 75 transitions. Word has length 40 [2022-11-25 18:17:07,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:07,586 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 75 transitions. [2022-11-25 18:17:07,587 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 18:17:07,587 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 75 transitions. [2022-11-25 18:17:07,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 18:17:07,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:07,588 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 18:17:07,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:17:07,589 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 18:17:07,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:07,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1353827591, now seen corresponding path program 1 times [2022-11-25 18:17:07,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:07,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891662265] [2022-11-25 18:17:07,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:07,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:17:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:17:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,694 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 18:17:07,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:07,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891662265] [2022-11-25 18:17:07,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891662265] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:07,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:07,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:17:07,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487962883] [2022-11-25 18:17:07,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:07,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:17:07,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:07,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:17:07,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:17:07,698 INFO L87 Difference]: Start difference. First operand 58 states and 75 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 18:17:07,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:07,730 INFO L93 Difference]: Finished difference Result 77 states and 100 transitions. [2022-11-25 18:17:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:17:07,731 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 18:17:07,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:07,732 INFO L225 Difference]: With dead ends: 77 [2022-11-25 18:17:07,733 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 18:17:07,733 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 18:17:07,734 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 16 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 219 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 18:17:07,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 219 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 18:17:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-11-25 18:17:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 56 states have internal predecessors, (62), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 18:17:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2022-11-25 18:17:07,745 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 41 [2022-11-25 18:17:07,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:07,746 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2022-11-25 18:17:07,746 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 18:17:07,746 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2022-11-25 18:17:07,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 18:17:07,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:07,748 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 18:17:07,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:17:07,748 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 18:17:07,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:07,749 INFO L85 PathProgramCache]: Analyzing trace with hash -1351980549, now seen corresponding path program 1 times [2022-11-25 18:17:07,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:07,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185218166] [2022-11-25 18:17:07,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:07,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:07,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:17:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:17:07,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,824 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 18:17:07,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:07,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185218166] [2022-11-25 18:17:07,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [185218166] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:07,825 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:07,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:17:07,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974835081] [2022-11-25 18:17:07,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:07,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:17:07,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:07,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:17:07,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:17:07,842 INFO L87 Difference]: Start difference. First operand 62 states and 80 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 18:17:07,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:07,860 INFO L93 Difference]: Finished difference Result 88 states and 111 transitions. [2022-11-25 18:17:07,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:17:07,861 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 18:17:07,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:07,865 INFO L225 Difference]: With dead ends: 88 [2022-11-25 18:17:07,865 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 18:17:07,866 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 18:17:07,869 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 1 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 141 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 18:17:07,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 141 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:07,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 18:17:07,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-25 18:17:07,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 55 states have internal predecessors, (61), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 6 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 18:17:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2022-11-25 18:17:07,894 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 41 [2022-11-25 18:17:07,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:07,895 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2022-11-25 18:17:07,895 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 18:17:07,896 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2022-11-25 18:17:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 18:17:07,903 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:07,904 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 18:17:07,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:17:07,905 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 18:17:07,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash -341539628, now seen corresponding path program 1 times [2022-11-25 18:17:07,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:07,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027214341] [2022-11-25 18:17:07,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:07,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:07,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:07,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:17:07,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:17:08,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 18:17:08,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,015 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 18:17:08,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:08,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027214341] [2022-11-25 18:17:08,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027214341] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:08,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:08,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:17:08,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522156171] [2022-11-25 18:17:08,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:08,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:17:08,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:08,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:17:08,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:17:08,026 INFO L87 Difference]: Start difference. First operand 62 states and 79 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 18:17:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:08,041 INFO L93 Difference]: Finished difference Result 83 states and 104 transitions. [2022-11-25 18:17:08,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:17:08,042 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 18:17:08,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:08,043 INFO L225 Difference]: With dead ends: 83 [2022-11-25 18:17:08,044 INFO L226 Difference]: Without dead ends: 56 [2022-11-25 18:17:08,044 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 18:17:08,048 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 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 18:17:08,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:08,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-25 18:17:08,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-25 18:17:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 50 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 5 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 18:17:08,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2022-11-25 18:17:08,066 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 45 [2022-11-25 18:17:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:08,068 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2022-11-25 18:17:08,068 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 18:17:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2022-11-25 18:17:08,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-11-25 18:17:08,069 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:08,070 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 18:17:08,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:17:08,070 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 18:17:08,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:08,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1929747657, now seen corresponding path program 1 times [2022-11-25 18:17:08,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:08,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870749648] [2022-11-25 18:17:08,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:08,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:08,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:17:08,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:17:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,187 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 18:17:08,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:08,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870749648] [2022-11-25 18:17:08,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870749648] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:08,188 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:08,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:17:08,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421291498] [2022-11-25 18:17:08,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:08,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:17:08,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:08,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:17:08,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:17:08,191 INFO L87 Difference]: Start difference. First operand 56 states and 70 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 18:17:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:08,202 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2022-11-25 18:17:08,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:17:08,203 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 18:17:08,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:08,204 INFO L225 Difference]: With dead ends: 71 [2022-11-25 18:17:08,204 INFO L226 Difference]: Without dead ends: 54 [2022-11-25 18:17:08,205 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 18:17:08,205 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 122 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 18:17:08,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 122 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:08,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-25 18:17:08,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-25 18:17:08,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.186046511627907) internal successors, (51), 47 states have internal predecessors, (51), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 18:17:08,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-11-25 18:17:08,213 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 46 [2022-11-25 18:17:08,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:08,213 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-11-25 18:17:08,214 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 18:17:08,214 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-11-25 18:17:08,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 18:17:08,215 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:08,215 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 18:17:08,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:17:08,216 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 18:17:08,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:08,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1871777561, now seen corresponding path program 1 times [2022-11-25 18:17:08,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:08,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526114201] [2022-11-25 18:17:08,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:08,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:17:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:17:08,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:17:08,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,324 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 18:17:08,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:08,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526114201] [2022-11-25 18:17:08,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526114201] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:08,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:08,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:17:08,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369880001] [2022-11-25 18:17:08,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:08,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:17:08,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:08,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:17:08,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:17:08,328 INFO L87 Difference]: Start difference. First operand 54 states and 65 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 18:17:08,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:08,348 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2022-11-25 18:17:08,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:17:08,349 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 18:17:08,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:08,350 INFO L225 Difference]: With dead ends: 54 [2022-11-25 18:17:08,350 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 18:17:08,350 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 18:17:08,351 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 8 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 175 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 18:17:08,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 175 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:08,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 18:17:08,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-25 18:17:08,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 46 states have internal predecessors, (50), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 18:17:08,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2022-11-25 18:17:08,358 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 51 [2022-11-25 18:17:08,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:08,358 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2022-11-25 18:17:08,359 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 18:17:08,359 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2022-11-25 18:17:08,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 18:17:08,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:08,360 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:17:08,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:17:08,360 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 18:17:08,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:08,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2104437944, now seen corresponding path program 1 times [2022-11-25 18:17:08,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:08,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25976494] [2022-11-25 18:17:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:08,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:17:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:17:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:17:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,536 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 18:17:08,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:08,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25976494] [2022-11-25 18:17:08,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25976494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:08,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:08,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:17:08,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098069881] [2022-11-25 18:17:08,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:08,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:17:08,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:08,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:17:08,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 18:17:08,540 INFO L87 Difference]: Start difference. First operand 53 states and 64 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 18:17:08,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:08,564 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2022-11-25 18:17:08,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:17:08,565 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 18:17:08,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:08,566 INFO L225 Difference]: With dead ends: 58 [2022-11-25 18:17:08,566 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 18:17:08,567 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 18:17:08,567 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 2 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 183 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 18:17:08,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 183 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:08,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 18:17:08,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-25 18:17:08,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 43 states have (on average 1.1395348837209303) internal successors, (49), 46 states have internal predecessors, (49), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 18:17:08,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2022-11-25 18:17:08,574 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 52 [2022-11-25 18:17:08,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:08,575 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2022-11-25 18:17:08,575 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 18:17:08,575 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-11-25 18:17:08,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-11-25 18:17:08,576 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:17:08,576 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 18:17:08,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:17:08,577 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 18:17:08,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:17:08,578 INFO L85 PathProgramCache]: Analyzing trace with hash 868386918, now seen corresponding path program 1 times [2022-11-25 18:17:08,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:17:08,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164322484] [2022-11-25 18:17:08,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:17:08,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:17:08,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 18:17:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 18:17:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-25 18:17:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-25 18:17:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:17:08,651 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 18:17:08,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:17:08,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164322484] [2022-11-25 18:17:08,652 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164322484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:17:08,652 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:17:08,652 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:17:08,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014241177] [2022-11-25 18:17:08,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:17:08,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:17:08,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:17:08,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:17:08,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:17:08,655 INFO L87 Difference]: Start difference. First operand 53 states and 63 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 18:17:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:17:08,660 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-11-25 18:17:08,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:17:08,661 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 18:17:08,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:17:08,661 INFO L225 Difference]: With dead ends: 57 [2022-11-25 18:17:08,661 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 18:17:08,662 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 18:17:08,663 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 107 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 18:17:08,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:17:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 18:17:08,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 18:17:08,665 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 18:17:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 18:17:08,665 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 53 [2022-11-25 18:17:08,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:17:08,665 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 18:17:08,666 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 18:17:08,666 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 18:17:08,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 18:17:08,669 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-25 18:17:08,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-25 18:17:08,670 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-25 18:17:08,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-25 18:17:08,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-25 18:17:08,671 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-25 18:17:08,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-25 18:17:08,672 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-25 18:17:08,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-25 18:17:08,675 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 18:17:08,901 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-25 18:17:08,902 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 18:17:08,902 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-25 18:17:08,902 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 18:17:08,902 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 18:17:08,903 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-25 18:17:08,903 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 18:17:08,903 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1598) no Hoare annotation was computed. [2022-11-25 18:17:08,903 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-11-25 18:17:08,904 INFO L899 garLoopResultBuilder]: For program point L1629(line 1629) no Hoare annotation was computed. [2022-11-25 18:17:08,904 INFO L899 garLoopResultBuilder]: For program point L1596(lines 1596 1605) no Hoare annotation was computed. [2022-11-25 18:17:08,904 INFO L899 garLoopResultBuilder]: For program point L1629-1(line 1629) no Hoare annotation was computed. [2022-11-25 18:17:08,904 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-11-25 18:17:08,904 INFO L899 garLoopResultBuilder]: For program point L1654(line 1654) no Hoare annotation was computed. [2022-11-25 18:17:08,905 INFO L899 garLoopResultBuilder]: For program point L1621(line 1621) no Hoare annotation was computed. [2022-11-25 18:17:08,905 INFO L899 garLoopResultBuilder]: For program point L1555(line 1555) no Hoare annotation was computed. [2022-11-25 18:17:08,905 INFO L899 garLoopResultBuilder]: For program point L1555-2(line 1555) no Hoare annotation was computed. [2022-11-25 18:17:08,905 INFO L902 garLoopResultBuilder]: At program point L1679(lines 1673 1680) the Hoare annotation is: true [2022-11-25 18:17:08,905 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1611) no Hoare annotation was computed. [2022-11-25 18:17:08,906 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-25 18:17:08,906 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-25 18:17:08,906 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 18:17:08,906 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 18:17:08,907 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2022-11-25 18:17:08,907 INFO L899 garLoopResultBuilder]: For program point L1589(line 1589) no Hoare annotation was computed. [2022-11-25 18:17:08,907 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1579) no Hoare annotation was computed. [2022-11-25 18:17:08,907 INFO L899 garLoopResultBuilder]: For program point L1639(lines 1639 1665) no Hoare annotation was computed. [2022-11-25 18:17:08,908 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-25 18:17:08,909 INFO L895 garLoopResultBuilder]: At program point L1631(line 1631) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch115#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 18:17:08,909 INFO L899 garLoopResultBuilder]: For program point L1598(line 1598) no Hoare annotation was computed. [2022-11-25 18:17:08,909 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2022-11-25 18:17:08,909 INFO L899 garLoopResultBuilder]: For program point L1656(line 1656) no Hoare annotation was computed. [2022-11-25 18:17:08,910 INFO L899 garLoopResultBuilder]: For program point L1656-1(line 1656) no Hoare annotation was computed. [2022-11-25 18:17:08,910 INFO L895 garLoopResultBuilder]: At program point L1590(line 1590) the Hoare annotation is: false [2022-11-25 18:17:08,910 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-11-25 18:17:08,911 INFO L899 garLoopResultBuilder]: For program point L1648(line 1648) no Hoare annotation was computed. [2022-11-25 18:17:08,912 INFO L899 garLoopResultBuilder]: For program point L1607(line 1607) no Hoare annotation was computed. [2022-11-25 18:17:08,912 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-25 18:17:08,912 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2022-11-25 18:17:08,913 INFO L895 garLoopResultBuilder]: At program point L1649(line 1649) the Hoare annotation is: false [2022-11-25 18:17:08,913 INFO L895 garLoopResultBuilder]: At program point L1616(lines 1616 1624) 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~switch114#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647) (<= 0 .cse0))) [2022-11-25 18:17:08,913 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) the Hoare annotation is: false [2022-11-25 18:17:08,914 INFO L895 garLoopResultBuilder]: At program point L1575(line 1575) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch101#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) [2022-11-25 18:17:08,914 INFO L899 garLoopResultBuilder]: For program point L1666(lines 1666 1672) no Hoare annotation was computed. [2022-11-25 18:17:08,914 INFO L895 garLoopResultBuilder]: At program point L1600(line 1600) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch112#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 18:17:08,915 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1576) no Hoare annotation was computed. [2022-11-25 18:17:08,915 INFO L902 garLoopResultBuilder]: At program point L1658(line 1658) the Hoare annotation is: true [2022-11-25 18:17:08,915 INFO L895 garLoopResultBuilder]: At program point L1625(lines 1625 1637) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodG2B1_#t~switch115#1| (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 18:17:08,915 INFO L895 garLoopResultBuilder]: At program point L1584(lines 1584 1592) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch103#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 18:17:08,916 INFO L899 garLoopResultBuilder]: For program point L1634(line 1634) no Hoare annotation was computed. [2022-11-25 18:17:08,916 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 18:17:08,916 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-25 18:17:08,916 INFO L895 garLoopResultBuilder]: At program point L1593(lines 1593 1610) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch112#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 18:17:08,917 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2022-11-25 18:17:08,917 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: (and (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) |ULTIMATE.start_goodB2G1_#t~switch92#1|) [2022-11-25 18:17:08,917 INFO L902 garLoopResultBuilder]: At program point L1676(line 1676) the Hoare annotation is: true [2022-11-25 18:17:08,917 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2022-11-25 18:17:08,917 INFO L895 garLoopResultBuilder]: At program point L1643(lines 1643 1651) 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 18:17:08,918 INFO L895 garLoopResultBuilder]: At program point L1635(line 1635) the Hoare annotation is: false [2022-11-25 18:17:08,918 INFO L899 garLoopResultBuilder]: For program point L1569(line 1569) no Hoare annotation was computed. [2022-11-25 18:17:08,918 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 18:17:08,918 INFO L899 garLoopResultBuilder]: For program point L1569-1(line 1569) no Hoare annotation was computed. [2022-11-25 18:17:08,919 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-25 18:17:08,919 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2022-11-25 18:17:08,919 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1578) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch101#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) [2022-11-25 18:17:08,919 INFO L902 garLoopResultBuilder]: At program point L1652(lines 1652 1664) the Hoare annotation is: true [2022-11-25 18:17:08,919 INFO L895 garLoopResultBuilder]: At program point L1619(line 1619) the Hoare annotation is: false [2022-11-25 18:17:08,920 INFO L899 garLoopResultBuilder]: For program point L1586(line 1586) no Hoare annotation was computed. [2022-11-25 18:17:08,920 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1598) no Hoare annotation was computed. [2022-11-25 18:17:08,920 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-11-25 18:17:08,921 INFO L899 garLoopResultBuilder]: For program point L1595(line 1595) no Hoare annotation was computed. [2022-11-25 18:17:08,921 INFO L899 garLoopResultBuilder]: For program point L1587(line 1587) no Hoare annotation was computed. [2022-11-25 18:17:08,921 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-25 18:17:08,921 INFO L899 garLoopResultBuilder]: For program point L1587-2(line 1587) no Hoare annotation was computed. [2022-11-25 18:17:08,922 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-11-25 18:17:08,922 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-25 18:17:08,922 INFO L899 garLoopResultBuilder]: For program point L1678-1(line 1678) no Hoare annotation was computed. [2022-11-25 18:17:08,922 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1638) no Hoare annotation was computed. [2022-11-25 18:17:08,922 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-25 18:17:08,923 INFO L895 garLoopResultBuilder]: At program point L1604(line 1604) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch112#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647) (<= |ULTIMATE.start_goodB2G2_~data~1#1| 2147483647)) [2022-11-25 18:17:08,923 INFO L895 garLoopResultBuilder]: At program point L1571(line 1571) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch101#1| (<= |ULTIMATE.start_goodB2G1_~data~0#1| 2147483647)) [2022-11-25 18:17:08,929 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 18:17:08,933 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:17:08,962 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:17:08 BoogieIcfgContainer [2022-11-25 18:17:08,962 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:17:08,963 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:17:08,963 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:17:08,963 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:17:08,964 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:17:05" (3/4) ... [2022-11-25 18:17:08,968 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 18:17:08,977 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-25 18:17:08,977 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-25 18:17:08,989 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-25 18:17:08,990 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-25 18:17:08,990 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 18:17:08,991 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 18:17:08,991 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 18:17:09,084 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b868d56-9d6b-4a62-9318-728d28db050c/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:17:09,085 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:17:09,085 INFO L158 Benchmark]: Toolchain (without parser) took 6760.16ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 112.9MB in the beginning and 74.8MB in the end (delta: 38.1MB). Peak memory consumption was 108.6MB. Max. memory is 16.1GB. [2022-11-25 18:17:09,086 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 102.8MB. Free memory is still 54.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:17:09,086 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1778.09ms. Allocated memory is still 159.4MB. Free memory was 112.9MB in the beginning and 111.6MB in the end (delta: 1.3MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. [2022-11-25 18:17:09,086 INFO L158 Benchmark]: Boogie Procedure Inliner took 139.63ms. Allocated memory is still 159.4MB. Free memory was 111.6MB in the beginning and 107.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:17:09,087 INFO L158 Benchmark]: Boogie Preprocessor took 80.01ms. Allocated memory is still 159.4MB. Free memory was 107.4MB in the beginning and 106.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 18:17:09,087 INFO L158 Benchmark]: RCFGBuilder took 816.40ms. Allocated memory is still 159.4MB. Free memory was 106.0MB in the beginning and 85.7MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 18:17:09,087 INFO L158 Benchmark]: TraceAbstraction took 3815.63ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 85.0MB in the beginning and 80.0MB in the end (delta: 5.0MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. [2022-11-25 18:17:09,088 INFO L158 Benchmark]: Witness Printer took 122.06ms. Allocated memory is still 228.6MB. Free memory was 79.0MB in the beginning and 74.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:17:09,090 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.39ms. Allocated memory is still 102.8MB. Free memory is still 54.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1778.09ms. Allocated memory is still 159.4MB. Free memory was 112.9MB in the beginning and 111.6MB in the end (delta: 1.3MB). Peak memory consumption was 60.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 139.63ms. Allocated memory is still 159.4MB. Free memory was 111.6MB in the beginning and 107.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.01ms. Allocated memory is still 159.4MB. Free memory was 107.4MB in the beginning and 106.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 816.40ms. Allocated memory is still 159.4MB. Free memory was 106.0MB in the beginning and 85.7MB in the end (delta: 20.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3815.63ms. Allocated memory was 159.4MB in the beginning and 228.6MB in the end (delta: 69.2MB). Free memory was 85.0MB in the beginning and 80.0MB in the end (delta: 5.0MB). Peak memory consumption was 73.8MB. Max. memory is 16.1GB. * Witness Printer took 122.06ms. Allocated memory is still 228.6MB. Free memory was 79.0MB in the beginning and 74.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1569]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1598]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1629]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1656]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.7s, OverallIterations: 17, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 195 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 163 mSDsluCounter, 2853 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1546 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 80 IncrementalHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1307 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=81occurred 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, 27 LocationsWithAnnotation, 89 PreInvPairs, 106 NumberOfFragments, 118 HoareAnnotationTreeSize, 89 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 587 NumberOfCodeBlocks, 587 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 570 ConstructedInterpolants, 0 QuantifiedInterpolants, 658 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: 1616]: 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: 1652]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1673]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1561]: Loop Invariant Derived loop invariant: 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 && data <= 2147483647 - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: data <= 2147483647 && aux-switch(6) { case 6: data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)); break; default: printLine("Benign, fixed string"); break; }-aux - InvariantResult [Line: 1593]: 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: 1643]: Loop Invariant Derived loop invariant: ((0 <= data + 2 && data <= 2147483647) && data <= 2147483647) && data + 2 <= 0 - InvariantResult [Line: 1584]: Loop Invariant Derived loop invariant: (aux-switch(6) { case 6: data = ((int)(rand() & 1 ? (((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) : -(((unsigned)rand()<<30) ^ ((unsigned)rand()<<15) ^ rand()) - 1)); break; default: printLine("Benign, fixed string"); break; }-aux && data <= 2147483647) && data <= 2147483647 - InvariantResult [Line: 1625]: 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 RESULT: Ultimate proved your program to be correct! [2022-11-25 18:17:09,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4b868d56-9d6b-4a62-9318-728d28db050c/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