./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_postdec_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7712a97-d9eb-44c7-a566-3b9b7052cc10/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7712a97-d9eb-44c7-a566-3b9b7052cc10/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_d7712a97-d9eb-44c7-a566-3b9b7052cc10/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7712a97-d9eb-44c7-a566-3b9b7052cc10/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_postdec_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7712a97-d9eb-44c7-a566-3b9b7052cc10/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_d7712a97-d9eb-44c7-a566-3b9b7052cc10/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 a1dbf7e2eb7d89429a091ba20920f5c1d14c563cd21f76567c8e99a8b1f781b5 --- 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 16:46:59,930 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:46:59,932 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:46:59,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:46:59,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:46:59,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:46:59,972 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:46:59,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:46:59,976 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:46:59,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:46:59,978 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:46:59,979 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:46:59,980 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:46:59,981 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:46:59,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:46:59,984 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:46:59,985 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:46:59,986 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:46:59,988 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:46:59,990 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:46:59,992 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:46:59,993 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:46:59,994 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:46:59,995 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:47:00,000 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:47:00,000 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:47:00,000 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:47:00,002 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:47:00,002 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:47:00,003 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:47:00,004 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:47:00,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:47:00,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:47:00,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:47:00,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:47:00,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:47:00,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:47:00,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:47:00,010 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:47:00,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:47:00,019 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:47:00,020 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7712a97-d9eb-44c7-a566-3b9b7052cc10/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-25 16:47:00,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:47:00,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:47:00,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:47:00,060 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:47:00,061 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:47:00,061 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:47:00,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:47:00,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:47:00,062 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:47:00,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:47:00,064 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:47:00,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:47:00,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:47:00,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:47:00,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:47:00,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:47:00,065 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 16:47:00,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:47:00,065 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:47:00,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:47:00,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:47:00,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:47:00,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:47:00,067 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:47:00,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:47:00,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:47:00,067 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:47:00,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:47:00,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:47:00,068 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:47:00,068 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:47:00,068 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:47:00,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:47:00,069 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_d7712a97-d9eb-44c7-a566-3b9b7052cc10/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_d7712a97-d9eb-44c7-a566-3b9b7052cc10/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 -> a1dbf7e2eb7d89429a091ba20920f5c1d14c563cd21f76567c8e99a8b1f781b5 [2022-11-25 16:47:00,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:47:00,435 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:47:00,438 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:47:00,439 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:47:00,440 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:47:00,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7712a97-d9eb-44c7-a566-3b9b7052cc10/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_postdec_15_good.i [2022-11-25 16:47:03,531 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:47:04,030 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:47:04,030 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7712a97-d9eb-44c7-a566-3b9b7052cc10/sv-benchmarks/c/Juliet_Test/CWE191_Integer_Underflow__int_fscanf_postdec_15_good.i [2022-11-25 16:47:04,059 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7712a97-d9eb-44c7-a566-3b9b7052cc10/bin/uautomizer-ZsLfNo2U6R/data/7b09c3f37/d938d00a9a14402db67f812b7480e5bf/FLAGe7459881e [2022-11-25 16:47:04,074 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7712a97-d9eb-44c7-a566-3b9b7052cc10/bin/uautomizer-ZsLfNo2U6R/data/7b09c3f37/d938d00a9a14402db67f812b7480e5bf [2022-11-25 16:47:04,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:47:04,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:47:04,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:47:04,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:47:04,083 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:47:04,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:47:04" (1/1) ... [2022-11-25 16:47:04,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d165492 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:04, skipping insertion in model container [2022-11-25 16:47:04,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:47:04" (1/1) ... [2022-11-25 16:47:04,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:47:04,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:47:04,507 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 16:47:05,047 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 16:47:05,053 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:47:05,055 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:47:05,057 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:47:05,058 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:47:05,103 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 16:47:05,104 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:47:05,114 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:47:05,135 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 16:47:05,198 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 16:47:05,200 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:47:05,201 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:47:05,203 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:47:05,204 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:47:05,220 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 16:47:05,231 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:47:05,346 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:47:05,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:05 WrapperNode [2022-11-25 16:47:05,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:47:05,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:47:05,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:47:05,348 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:47:05,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:05" (1/1) ... [2022-11-25 16:47:05,401 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:05" (1/1) ... [2022-11-25 16:47:05,433 INFO L138 Inliner]: procedures = 503, calls = 97, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 179 [2022-11-25 16:47:05,434 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:47:05,448 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:47:05,448 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:47:05,449 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:47:05,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:05" (1/1) ... [2022-11-25 16:47:05,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:05" (1/1) ... [2022-11-25 16:47:05,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:05" (1/1) ... [2022-11-25 16:47:05,467 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:05" (1/1) ... [2022-11-25 16:47:05,472 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:05" (1/1) ... [2022-11-25 16:47:05,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:05" (1/1) ... [2022-11-25 16:47:05,476 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:05" (1/1) ... [2022-11-25 16:47:05,477 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:05" (1/1) ... [2022-11-25 16:47:05,480 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:47:05,481 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:47:05,481 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:47:05,481 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:47:05,482 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:05" (1/1) ... [2022-11-25 16:47:05,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:47:05,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7712a97-d9eb-44c7-a566-3b9b7052cc10/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:47:05,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7712a97-d9eb-44c7-a566-3b9b7052cc10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:47:05,526 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7712a97-d9eb-44c7-a566-3b9b7052cc10/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:47:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-25 16:47:05,556 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-25 16:47:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-25 16:47:05,557 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-25 16:47:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 16:47:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 16:47:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:47:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:47:05,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:47:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-25 16:47:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-25 16:47:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 16:47:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:47:05,744 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:47:05,746 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:47:06,037 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:47:06,044 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:47:06,044 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:47:06,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:47:06 BoogieIcfgContainer [2022-11-25 16:47:06,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:47:06,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:47:06,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:47:06,054 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:47:06,063 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:47:04" (1/3) ... [2022-11-25 16:47:06,064 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7289c3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:47:06, skipping insertion in model container [2022-11-25 16:47:06,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:47:05" (2/3) ... [2022-11-25 16:47:06,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7289c3d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:47:06, skipping insertion in model container [2022-11-25 16:47:06,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:47:06" (3/3) ... [2022-11-25 16:47:06,066 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE191_Integer_Underflow__int_fscanf_postdec_15_good.i [2022-11-25 16:47:06,094 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:47:06,094 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-25 16:47:06,147 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:47:06,153 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;@11cde851, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:47:06,153 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 16:47:06,158 INFO L276 IsEmpty]: Start isEmpty. Operand has 77 states, 50 states have (on average 1.54) internal successors, (77), 72 states have internal predecessors, (77), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) [2022-11-25 16:47:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-25 16:47:06,166 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:47:06,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:06,167 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 16:47:06,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:06,173 INFO L85 PathProgramCache]: Analyzing trace with hash -389693070, now seen corresponding path program 1 times [2022-11-25 16:47:06,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:06,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66808707] [2022-11-25 16:47:06,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:06,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:06,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:06,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:47:06,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 16:47:06,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:06,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66808707] [2022-11-25 16:47:06,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66808707] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:06,765 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:06,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:06,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000820117] [2022-11-25 16:47:06,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:06,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:47:06,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:06,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:47:06,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:47:06,804 INFO L87 Difference]: Start difference. First operand has 77 states, 50 states have (on average 1.54) internal successors, (77), 72 states have internal predecessors, (77), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 16:47:06,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:47:06,872 INFO L93 Difference]: Finished difference Result 77 states and 109 transitions. [2022-11-25 16:47:06,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:47:06,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-11-25 16:47:06,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:47:06,884 INFO L225 Difference]: With dead ends: 77 [2022-11-25 16:47:06,884 INFO L226 Difference]: Without dead ends: 65 [2022-11-25 16:47:06,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:47:06,890 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 2 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:47:06,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 298 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:47:06,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-11-25 16:47:06,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-11-25 16:47:06,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 43 states have (on average 1.5348837209302326) internal successors, (66), 61 states have internal predecessors, (66), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 16:47:06,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 92 transitions. [2022-11-25 16:47:06,933 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 92 transitions. Word has length 14 [2022-11-25 16:47:06,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:47:06,934 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 92 transitions. [2022-11-25 16:47:06,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 16:47:06,935 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 92 transitions. [2022-11-25 16:47:06,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 16:47:06,936 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:47:06,936 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:06,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:47:06,937 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:47:06,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:06,938 INFO L85 PathProgramCache]: Analyzing trace with hash 804416791, now seen corresponding path program 1 times [2022-11-25 16:47:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:06,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867737873] [2022-11-25 16:47:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:06,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:07,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:47:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:07,170 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 16:47:07,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:07,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867737873] [2022-11-25 16:47:07,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867737873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:07,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:07,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:07,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856832161] [2022-11-25 16:47:07,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:07,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:47:07,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:07,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:47:07,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:47:07,191 INFO L87 Difference]: Start difference. First operand 65 states and 92 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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 16:47:07,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:47:07,277 INFO L93 Difference]: Finished difference Result 65 states and 92 transitions. [2022-11-25 16:47:07,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:47:07,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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 16:47:07,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:47:07,284 INFO L225 Difference]: With dead ends: 65 [2022-11-25 16:47:07,284 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 16:47:07,285 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 16:47:07,286 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 8 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:47:07,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 231 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:47:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 16:47:07,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-25 16:47:07,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.5116279069767442) internal successors, (65), 60 states have internal predecessors, (65), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 16:47:07,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2022-11-25 16:47:07,313 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 15 [2022-11-25 16:47:07,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:47:07,313 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2022-11-25 16:47:07,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 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 16:47:07,314 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2022-11-25 16:47:07,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 16:47:07,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:47:07,315 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:07,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:47:07,315 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:47:07,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:07,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1566270844, now seen corresponding path program 1 times [2022-11-25 16:47:07,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:07,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450053635] [2022-11-25 16:47:07,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:07,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:07,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:47:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:07,408 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 16:47:07,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:07,409 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450053635] [2022-11-25 16:47:07,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450053635] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:07,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:07,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:07,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703505867] [2022-11-25 16:47:07,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:07,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:47:07,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:07,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:47:07,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:47:07,412 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 16:47:07,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:47:07,430 INFO L93 Difference]: Finished difference Result 112 states and 156 transitions. [2022-11-25 16:47:07,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:47:07,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-11-25 16:47:07,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:47:07,432 INFO L225 Difference]: With dead ends: 112 [2022-11-25 16:47:07,433 INFO L226 Difference]: Without dead ends: 64 [2022-11-25 16:47:07,433 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 16:47:07,435 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 5 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 166 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 16:47:07,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 166 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:47:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-25 16:47:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2022-11-25 16:47:07,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 59 states have internal predecessors, (64), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 8 states have call predecessors, (13), 13 states have call successors, (13) [2022-11-25 16:47:07,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2022-11-25 16:47:07,447 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 19 [2022-11-25 16:47:07,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:47:07,447 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2022-11-25 16:47:07,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 16:47:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2022-11-25 16:47:07,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 16:47:07,449 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:47:07,449 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:07,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:47:07,450 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 16:47:07,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:07,450 INFO L85 PathProgramCache]: Analyzing trace with hash -126826538, now seen corresponding path program 1 times [2022-11-25 16:47:07,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:07,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704874464] [2022-11-25 16:47:07,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:07,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:07,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:07,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:47:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:07,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 16:47:07,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:07,510 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 16:47:07,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:07,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704874464] [2022-11-25 16:47:07,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704874464] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:07,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:07,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:07,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998905154] [2022-11-25 16:47:07,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:07,513 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:47:07,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:07,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:47:07,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:47:07,514 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 16:47:07,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:47:07,531 INFO L93 Difference]: Finished difference Result 112 states and 155 transitions. [2022-11-25 16:47:07,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:47:07,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2022-11-25 16:47:07,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:47:07,533 INFO L225 Difference]: With dead ends: 112 [2022-11-25 16:47:07,533 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 16:47:07,534 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 16:47:07,535 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 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 16:47:07,536 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:47:07,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 16:47:07,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-25 16:47:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 43 states have (on average 1.4651162790697674) internal successors, (63), 58 states have internal predecessors, (63), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 16:47:07,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2022-11-25 16:47:07,545 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 23 [2022-11-25 16:47:07,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:47:07,546 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2022-11-25 16:47:07,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-25 16:47:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-11-25 16:47:07,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 16:47:07,547 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:47:07,548 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:07,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:47:07,548 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 16:47:07,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:07,549 INFO L85 PathProgramCache]: Analyzing trace with hash 745548059, now seen corresponding path program 1 times [2022-11-25 16:47:07,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:07,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646272145] [2022-11-25 16:47:07,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:07,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:07,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:47:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:07,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:47:07,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:07,688 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 16:47:07,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:07,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646272145] [2022-11-25 16:47:07,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646272145] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:07,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:07,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:07,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646850827] [2022-11-25 16:47:07,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:07,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:47:07,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:07,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:47:07,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:47:07,702 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (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 16:47:07,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:47:07,771 INFO L93 Difference]: Finished difference Result 63 states and 87 transitions. [2022-11-25 16:47:07,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:47:07,774 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-11-25 16:47:07,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:47:07,776 INFO L225 Difference]: With dead ends: 63 [2022-11-25 16:47:07,776 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 16:47:07,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:47:07,777 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 2 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 16:47:07,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 232 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 16:47:07,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 16:47:07,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-25 16:47:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 43 states have (on average 1.441860465116279) internal successors, (62), 57 states have internal predecessors, (62), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 16:47:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2022-11-25 16:47:07,793 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 25 [2022-11-25 16:47:07,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:47:07,794 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2022-11-25 16:47:07,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (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 16:47:07,794 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2022-11-25 16:47:07,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-11-25 16:47:07,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:47:07,800 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 16:47:07,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:47:07,801 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:47:07,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:07,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1637153456, now seen corresponding path program 1 times [2022-11-25 16:47:07,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:07,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182896714] [2022-11-25 16:47:07,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:07,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:07,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:47:07,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:07,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:47:07,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:07,994 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 16:47:07,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:07,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182896714] [2022-11-25 16:47:07,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182896714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:07,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:07,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:07,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [482240065] [2022-11-25 16:47:07,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:07,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:47:07,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:07,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:47:07,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:47:07,999 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 16:47:08,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:47:08,068 INFO L93 Difference]: Finished difference Result 62 states and 86 transitions. [2022-11-25 16:47:08,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:47:08,069 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2022-11-25 16:47:08,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:47:08,073 INFO L225 Difference]: With dead ends: 62 [2022-11-25 16:47:08,073 INFO L226 Difference]: Without dead ends: 61 [2022-11-25 16:47:08,073 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 16:47:08,076 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 9 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:47:08,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 213 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:47:08,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-11-25 16:47:08,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-11-25 16:47:08,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.4186046511627908) internal successors, (61), 56 states have internal predecessors, (61), 12 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 8 states have call predecessors, (12), 12 states have call successors, (12) [2022-11-25 16:47:08,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2022-11-25 16:47:08,095 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 26 [2022-11-25 16:47:08,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:47:08,095 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2022-11-25 16:47:08,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 16:47:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2022-11-25 16:47:08,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 16:47:08,097 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:47:08,097 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:08,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:47:08,097 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:47:08,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:08,098 INFO L85 PathProgramCache]: Analyzing trace with hash -332330315, now seen corresponding path program 1 times [2022-11-25 16:47:08,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:08,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170181988] [2022-11-25 16:47:08,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:08,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:08,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:47:08,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:47:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,177 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 16:47:08,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:08,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170181988] [2022-11-25 16:47:08,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170181988] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:08,178 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:08,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:08,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065529875] [2022-11-25 16:47:08,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:08,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:47:08,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:08,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:47:08,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:47:08,180 INFO L87 Difference]: Start difference. First operand 61 states and 85 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 16:47:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:47:08,200 INFO L93 Difference]: Finished difference Result 93 states and 125 transitions. [2022-11-25 16:47:08,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:47:08,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-11-25 16:47:08,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:47:08,203 INFO L225 Difference]: With dead ends: 93 [2022-11-25 16:47:08,203 INFO L226 Difference]: Without dead ends: 59 [2022-11-25 16:47:08,204 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 16:47:08,207 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 5 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:47:08,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 149 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:47:08,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-11-25 16:47:08,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-11-25 16:47:08,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 42 states have (on average 1.380952380952381) internal successors, (58), 53 states have internal predecessors, (58), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 16:47:08,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 80 transitions. [2022-11-25 16:47:08,224 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 80 transitions. Word has length 31 [2022-11-25 16:47:08,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:47:08,225 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 80 transitions. [2022-11-25 16:47:08,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 16:47:08,225 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 80 transitions. [2022-11-25 16:47:08,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-25 16:47:08,226 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:47:08,226 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:08,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:47:08,226 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:47:08,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:08,227 INFO L85 PathProgramCache]: Analyzing trace with hash -1965523148, now seen corresponding path program 1 times [2022-11-25 16:47:08,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:08,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818708347] [2022-11-25 16:47:08,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:08,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:47:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:47:08,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 16:47:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,338 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 16:47:08,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:08,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818708347] [2022-11-25 16:47:08,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818708347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:08,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:08,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:08,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189542576] [2022-11-25 16:47:08,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:08,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:47:08,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:08,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:47:08,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:47:08,342 INFO L87 Difference]: Start difference. First operand 59 states and 80 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 16:47:08,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:47:08,370 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2022-11-25 16:47:08,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:47:08,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2022-11-25 16:47:08,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:47:08,373 INFO L225 Difference]: With dead ends: 70 [2022-11-25 16:47:08,374 INFO L226 Difference]: Without dead ends: 69 [2022-11-25 16:47:08,374 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 16:47:08,375 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 22 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:47:08,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 215 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:47:08,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-11-25 16:47:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 58. [2022-11-25 16:47:08,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 42 states have (on average 1.3571428571428572) internal successors, (57), 52 states have internal predecessors, (57), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 16:47:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2022-11-25 16:47:08,389 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 36 [2022-11-25 16:47:08,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:47:08,391 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2022-11-25 16:47:08,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 16:47:08,392 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2022-11-25 16:47:08,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 16:47:08,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:47:08,395 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:08,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:47:08,395 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:47:08,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:08,396 INFO L85 PathProgramCache]: Analyzing trace with hash -801675300, now seen corresponding path program 1 times [2022-11-25 16:47:08,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:08,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629386768] [2022-11-25 16:47:08,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:08,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:08,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:47:08,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:47:08,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 16:47:08,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,493 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 16:47:08,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:08,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629386768] [2022-11-25 16:47:08,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629386768] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:08,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:08,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:08,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476899453] [2022-11-25 16:47:08,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:08,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:47:08,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:08,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:47:08,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:47:08,496 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (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 16:47:08,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:47:08,528 INFO L93 Difference]: Finished difference Result 77 states and 104 transitions. [2022-11-25 16:47:08,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:47:08,528 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-11-25 16:47:08,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:47:08,532 INFO L225 Difference]: With dead ends: 77 [2022-11-25 16:47:08,532 INFO L226 Difference]: Without dead ends: 76 [2022-11-25 16:47:08,532 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 16:47:08,535 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 16 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:47:08,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 231 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:47:08,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-11-25 16:47:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 62. [2022-11-25 16:47:08,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.3478260869565217) internal successors, (62), 56 states have internal predecessors, (62), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 16:47:08,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 84 transitions. [2022-11-25 16:47:08,551 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 84 transitions. Word has length 37 [2022-11-25 16:47:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:47:08,551 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 84 transitions. [2022-11-25 16:47:08,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (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 16:47:08,551 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2022-11-25 16:47:08,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-25 16:47:08,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:47:08,556 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:08,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:47:08,556 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:47:08,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:08,557 INFO L85 PathProgramCache]: Analyzing trace with hash -799828258, now seen corresponding path program 1 times [2022-11-25 16:47:08,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:08,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581634253] [2022-11-25 16:47:08,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:08,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:47:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:47:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 16:47:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,629 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 16:47:08,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:08,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581634253] [2022-11-25 16:47:08,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581634253] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:08,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:08,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:08,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269995888] [2022-11-25 16:47:08,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:08,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:47:08,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:08,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:47:08,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:47:08,638 INFO L87 Difference]: Start difference. First operand 62 states and 84 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 16:47:08,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:47:08,655 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2022-11-25 16:47:08,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:47:08,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 37 [2022-11-25 16:47:08,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:47:08,658 INFO L225 Difference]: With dead ends: 88 [2022-11-25 16:47:08,658 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 16:47:08,659 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 16:47:08,662 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:47:08,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 149 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:47:08,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 16:47:08,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-25 16:47:08,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 46 states have (on average 1.326086956521739) internal successors, (61), 55 states have internal predecessors, (61), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 8 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 16:47:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2022-11-25 16:47:08,681 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 37 [2022-11-25 16:47:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:47:08,681 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-11-25 16:47:08,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 16:47:08,682 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-11-25 16:47:08,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-25 16:47:08,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:47:08,683 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:08,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:47:08,683 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 16:47:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:08,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1822720215, now seen corresponding path program 1 times [2022-11-25 16:47:08,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:08,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010960033] [2022-11-25 16:47:08,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:08,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:47:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:47:08,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 16:47:08,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 16:47:08,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,750 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 16:47:08,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:08,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010960033] [2022-11-25 16:47:08,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010960033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:08,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:08,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:08,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063623172] [2022-11-25 16:47:08,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:08,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:47:08,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:08,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:47:08,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:47:08,753 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 16:47:08,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:47:08,763 INFO L93 Difference]: Finished difference Result 83 states and 108 transitions. [2022-11-25 16:47:08,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:47:08,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2022-11-25 16:47:08,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:47:08,765 INFO L225 Difference]: With dead ends: 83 [2022-11-25 16:47:08,765 INFO L226 Difference]: Without dead ends: 56 [2022-11-25 16:47:08,765 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 16:47:08,766 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:47:08,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 143 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:47:08,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-11-25 16:47:08,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-11-25 16:47:08,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 50 states have internal predecessors, (54), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 7 states have call predecessors, (10), 10 states have call successors, (10) [2022-11-25 16:47:08,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 74 transitions. [2022-11-25 16:47:08,794 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 74 transitions. Word has length 41 [2022-11-25 16:47:08,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:47:08,795 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 74 transitions. [2022-11-25 16:47:08,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-11-25 16:47:08,795 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 74 transitions. [2022-11-25 16:47:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-11-25 16:47:08,796 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:47:08,796 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:08,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:47:08,797 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:47:08,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:08,798 INFO L85 PathProgramCache]: Analyzing trace with hash 763162534, now seen corresponding path program 1 times [2022-11-25 16:47:08,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:08,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636457882] [2022-11-25 16:47:08,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:08,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:08,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:47:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:47:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 16:47:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,860 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-25 16:47:08,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:08,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636457882] [2022-11-25 16:47:08,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636457882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:08,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:08,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:08,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650151752] [2022-11-25 16:47:08,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:08,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:47:08,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:08,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:47:08,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:47:08,863 INFO L87 Difference]: Start difference. First operand 56 states and 74 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 16:47:08,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:47:08,871 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-11-25 16:47:08,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:47:08,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2022-11-25 16:47:08,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:47:08,872 INFO L225 Difference]: With dead ends: 71 [2022-11-25 16:47:08,873 INFO L226 Difference]: Without dead ends: 54 [2022-11-25 16:47:08,873 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 16:47:08,874 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 3 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:47:08,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:47:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-11-25 16:47:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-11-25 16:47:08,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 41 states have (on average 1.2439024390243902) internal successors, (51), 47 states have internal predecessors, (51), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 16:47:08,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2022-11-25 16:47:08,879 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 42 [2022-11-25 16:47:08,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:47:08,879 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2022-11-25 16:47:08,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-11-25 16:47:08,880 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2022-11-25 16:47:08,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-11-25 16:47:08,880 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:47:08,881 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:08,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:47:08,881 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:47:08,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:08,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1582332810, now seen corresponding path program 1 times [2022-11-25 16:47:08,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:08,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465155817] [2022-11-25 16:47:08,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:08,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:47:08,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:47:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 16:47:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 16:47:08,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:08,972 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 16:47:08,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:08,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465155817] [2022-11-25 16:47:08,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465155817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:08,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:08,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:08,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347789300] [2022-11-25 16:47:08,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:08,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:47:08,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:08,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:47:08,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:47:08,975 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 16:47:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:47:08,990 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2022-11-25 16:47:08,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:47:08,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 47 [2022-11-25 16:47:08,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:47:08,991 INFO L225 Difference]: With dead ends: 54 [2022-11-25 16:47:08,991 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 16:47:08,991 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 16:47:08,992 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 8 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:47:08,992 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 187 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:47:08,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 16:47:08,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-25 16:47:08,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 46 states have internal predecessors, (50), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 16:47:08,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2022-11-25 16:47:08,997 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 47 [2022-11-25 16:47:08,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:47:08,997 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2022-11-25 16:47:08,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 16:47:08,998 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2022-11-25 16:47:08,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-11-25 16:47:08,998 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:47:08,999 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:08,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:47:08,999 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:47:08,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:09,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1807677031, now seen corresponding path program 1 times [2022-11-25 16:47:09,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:09,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052619801] [2022-11-25 16:47:09,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:09,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:09,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:47:09,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:09,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:47:09,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:09,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 16:47:09,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:09,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 16:47:09,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:09,081 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 16:47:09,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:09,081 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052619801] [2022-11-25 16:47:09,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052619801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:09,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:09,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:09,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224984842] [2022-11-25 16:47:09,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:09,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 16:47:09,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:09,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 16:47:09,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 16:47:09,084 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 16:47:09,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:47:09,100 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2022-11-25 16:47:09,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 16:47:09,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 48 [2022-11-25 16:47:09,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:47:09,102 INFO L225 Difference]: With dead ends: 58 [2022-11-25 16:47:09,102 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 16:47:09,102 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 16:47:09,103 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 2 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:47:09,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 195 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:47:09,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 16:47:09,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-25 16:47:09,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 41 states have (on average 1.1951219512195121) internal successors, (49), 46 states have internal predecessors, (49), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-11-25 16:47:09,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2022-11-25 16:47:09,107 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 67 transitions. Word has length 48 [2022-11-25 16:47:09,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:47:09,108 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 67 transitions. [2022-11-25 16:47:09,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.333333333333334) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 16:47:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 67 transitions. [2022-11-25 16:47:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-25 16:47:09,109 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:47:09,109 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:09,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 16:47:09,109 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:47:09,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:47:09,110 INFO L85 PathProgramCache]: Analyzing trace with hash 258733193, now seen corresponding path program 1 times [2022-11-25 16:47:09,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:47:09,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967447650] [2022-11-25 16:47:09,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:47:09,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:47:09,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:09,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:47:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:09,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-25 16:47:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:09,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-25 16:47:09,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:09,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-25 16:47:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:47:09,191 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 16:47:09,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:47:09,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967447650] [2022-11-25 16:47:09,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967447650] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:47:09,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:47:09,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:47:09,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412539552] [2022-11-25 16:47:09,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:47:09,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:47:09,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:47:09,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:47:09,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:47:09,197 INFO L87 Difference]: Start difference. First operand 53 states and 67 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 16:47:09,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:47:09,201 INFO L93 Difference]: Finished difference Result 57 states and 71 transitions. [2022-11-25 16:47:09,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:47:09,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 49 [2022-11-25 16:47:09,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:47:09,202 INFO L225 Difference]: With dead ends: 57 [2022-11-25 16:47:09,202 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 16:47:09,204 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 16:47:09,205 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:47:09,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:47:09,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 16:47:09,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 16:47:09,206 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 16:47:09,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 16:47:09,207 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 49 [2022-11-25 16:47:09,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:47:09,207 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 16:47:09,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 16:47:09,207 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 16:47:09,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 16:47:09,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-25 16:47:09,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-25 16:47:09,211 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-25 16:47:09,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-25 16:47:09,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-25 16:47:09,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-25 16:47:09,212 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-25 16:47:09,213 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-25 16:47:09,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 16:47:09,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 16:47:09,294 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-25 16:47:09,294 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 16:47:09,294 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-25 16:47:09,295 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 16:47:09,295 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 16:47:09,295 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-25 16:47:09,296 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 16:47:09,296 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1598) no Hoare annotation was computed. [2022-11-25 16:47:09,297 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-11-25 16:47:09,297 INFO L899 garLoopResultBuilder]: For program point L1629(line 1629) no Hoare annotation was computed. [2022-11-25 16:47:09,297 INFO L899 garLoopResultBuilder]: For program point L1596(lines 1596 1605) no Hoare annotation was computed. [2022-11-25 16:47:09,297 INFO L899 garLoopResultBuilder]: For program point L1629-1(line 1629) no Hoare annotation was computed. [2022-11-25 16:47:09,297 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-11-25 16:47:09,297 INFO L899 garLoopResultBuilder]: For program point L1654(line 1654) no Hoare annotation was computed. [2022-11-25 16:47:09,298 INFO L899 garLoopResultBuilder]: For program point L1621(line 1621) no Hoare annotation was computed. [2022-11-25 16:47:09,298 INFO L902 garLoopResultBuilder]: At program point L1679(lines 1673 1680) the Hoare annotation is: true [2022-11-25 16:47:09,298 INFO L899 garLoopResultBuilder]: For program point L1580(lines 1580 1611) no Hoare annotation was computed. [2022-11-25 16:47:09,298 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-25 16:47:09,298 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-25 16:47:09,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 16:47:09,299 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 16:47:09,299 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2022-11-25 16:47:09,299 INFO L899 garLoopResultBuilder]: For program point L1589(line 1589) no Hoare annotation was computed. [2022-11-25 16:47:09,299 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1579) no Hoare annotation was computed. [2022-11-25 16:47:09,299 INFO L899 garLoopResultBuilder]: For program point L1639(lines 1639 1665) no Hoare annotation was computed. [2022-11-25 16:47:09,300 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1569) no Hoare annotation was computed. [2022-11-25 16:47:09,300 INFO L895 garLoopResultBuilder]: At program point L1631(line 1631) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch107#1| [2022-11-25 16:47:09,300 INFO L899 garLoopResultBuilder]: For program point L1598(line 1598) no Hoare annotation was computed. [2022-11-25 16:47:09,300 INFO L899 garLoopResultBuilder]: For program point L1598-1(line 1598) no Hoare annotation was computed. [2022-11-25 16:47:09,300 INFO L899 garLoopResultBuilder]: For program point L1656(line 1656) no Hoare annotation was computed. [2022-11-25 16:47:09,301 INFO L899 garLoopResultBuilder]: For program point L1656-1(line 1656) no Hoare annotation was computed. [2022-11-25 16:47:09,301 INFO L895 garLoopResultBuilder]: At program point L1590(line 1590) the Hoare annotation is: (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647) [2022-11-25 16:47:09,302 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-11-25 16:47:09,302 INFO L899 garLoopResultBuilder]: For program point L1648(line 1648) no Hoare annotation was computed. [2022-11-25 16:47:09,302 INFO L899 garLoopResultBuilder]: For program point L1607(line 1607) no Hoare annotation was computed. [2022-11-25 16:47:09,302 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-25 16:47:09,302 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647) [2022-11-25 16:47:09,302 INFO L895 garLoopResultBuilder]: At program point L1649(line 1649) the Hoare annotation is: false [2022-11-25 16:47:09,303 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_goodG2B1_#t~switch106#1| (<= 0 .cse0))) [2022-11-25 16:47:09,303 INFO L895 garLoopResultBuilder]: At program point L1608(line 1608) the Hoare annotation is: false [2022-11-25 16:47:09,303 INFO L895 garLoopResultBuilder]: At program point L1575(line 1575) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch94#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647)) [2022-11-25 16:47:09,304 INFO L899 garLoopResultBuilder]: For program point L1666(lines 1666 1672) no Hoare annotation was computed. [2022-11-25 16:47:09,304 INFO L895 garLoopResultBuilder]: At program point L1600(line 1600) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch101#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647)) [2022-11-25 16:47:09,304 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1576) no Hoare annotation was computed. [2022-11-25 16:47:09,304 INFO L902 garLoopResultBuilder]: At program point L1658(line 1658) the Hoare annotation is: true [2022-11-25 16:47:09,304 INFO L895 garLoopResultBuilder]: At program point L1625(lines 1625 1637) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch107#1| [2022-11-25 16:47:09,304 INFO L895 garLoopResultBuilder]: At program point L1584(lines 1584 1592) the Hoare annotation is: (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647) [2022-11-25 16:47:09,305 INFO L899 garLoopResultBuilder]: For program point L1634(line 1634) no Hoare annotation was computed. [2022-11-25 16:47:09,305 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 16:47:09,305 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-25 16:47:09,306 INFO L895 garLoopResultBuilder]: At program point L1593(lines 1593 1610) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch101#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647)) [2022-11-25 16:47:09,306 INFO L899 garLoopResultBuilder]: For program point L1618(line 1618) no Hoare annotation was computed. [2022-11-25 16:47:09,306 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647) [2022-11-25 16:47:09,306 INFO L902 garLoopResultBuilder]: At program point L1676(line 1676) the Hoare annotation is: true [2022-11-25 16:47:09,306 INFO L899 garLoopResultBuilder]: For program point L1676-1(line 1676) no Hoare annotation was computed. [2022-11-25 16:47:09,307 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) (<= .cse0 0))) [2022-11-25 16:47:09,307 INFO L895 garLoopResultBuilder]: At program point L1635(line 1635) the Hoare annotation is: false [2022-11-25 16:47:09,307 INFO L899 garLoopResultBuilder]: For program point L1569(line 1569) no Hoare annotation was computed. [2022-11-25 16:47:09,307 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 16:47:09,307 INFO L899 garLoopResultBuilder]: For program point L1569-1(line 1569) no Hoare annotation was computed. [2022-11-25 16:47:09,308 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1629) no Hoare annotation was computed. [2022-11-25 16:47:09,309 INFO L899 garLoopResultBuilder]: For program point L1627(line 1627) no Hoare annotation was computed. [2022-11-25 16:47:09,309 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1578) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch94#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647)) [2022-11-25 16:47:09,309 INFO L902 garLoopResultBuilder]: At program point L1652(lines 1652 1664) the Hoare annotation is: true [2022-11-25 16:47:09,309 INFO L895 garLoopResultBuilder]: At program point L1619(line 1619) the Hoare annotation is: false [2022-11-25 16:47:09,309 INFO L899 garLoopResultBuilder]: For program point L1586(line 1586) no Hoare annotation was computed. [2022-11-25 16:47:09,310 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1598) no Hoare annotation was computed. [2022-11-25 16:47:09,310 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-11-25 16:47:09,310 INFO L899 garLoopResultBuilder]: For program point L1595(line 1595) no Hoare annotation was computed. [2022-11-25 16:47:09,310 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-25 16:47:09,310 INFO L902 garLoopResultBuilder]: At program point L1678(line 1678) the Hoare annotation is: true [2022-11-25 16:47:09,311 INFO L899 garLoopResultBuilder]: For program point L1645(line 1645) no Hoare annotation was computed. [2022-11-25 16:47:09,311 INFO L899 garLoopResultBuilder]: For program point L1678-1(line 1678) no Hoare annotation was computed. [2022-11-25 16:47:09,311 INFO L899 garLoopResultBuilder]: For program point L1612(lines 1612 1638) no Hoare annotation was computed. [2022-11-25 16:47:09,311 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1656) no Hoare annotation was computed. [2022-11-25 16:47:09,311 INFO L895 garLoopResultBuilder]: At program point L1604(line 1604) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch101#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G2_~#data~1#1.base|) |ULTIMATE.start_goodB2G2_~#data~1#1.offset|) 2147483647)) [2022-11-25 16:47:09,312 INFO L895 garLoopResultBuilder]: At program point L1571(line 1571) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch94#1| (<= (select (select |#memory_int| |ULTIMATE.start_goodB2G1_~#data~0#1.base|) |ULTIMATE.start_goodB2G1_~#data~0#1.offset|) 2147483647)) [2022-11-25 16:47:09,315 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:47:09,317 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:47:09,341 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:47:09 BoogieIcfgContainer [2022-11-25 16:47:09,341 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:47:09,342 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:47:09,342 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:47:09,342 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:47:09,342 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:47:06" (3/4) ... [2022-11-25 16:47:09,346 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 16:47:09,352 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-25 16:47:09,353 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-25 16:47:09,362 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-11-25 16:47:09,363 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2022-11-25 16:47:09,363 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 16:47:09,364 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 16:47:09,364 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 16:47:09,418 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7712a97-d9eb-44c7-a566-3b9b7052cc10/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 16:47:09,419 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:47:09,419 INFO L158 Benchmark]: Toolchain (without parser) took 5341.68ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 122.8MB in the beginning and 66.4MB in the end (delta: 56.4MB). Peak memory consumption was 93.1MB. Max. memory is 16.1GB. [2022-11-25 16:47:09,420 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 159.4MB. Free memory was 103.6MB in the beginning and 103.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:47:09,420 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1267.82ms. Allocated memory is still 159.4MB. Free memory was 122.4MB in the beginning and 59.7MB in the end (delta: 62.7MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2022-11-25 16:47:09,420 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.57ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 59.7MB in the beginning and 161.2MB in the end (delta: -101.5MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-11-25 16:47:09,421 INFO L158 Benchmark]: Boogie Preprocessor took 32.01ms. Allocated memory is still 195.0MB. Free memory was 162.9MB in the beginning and 161.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:47:09,421 INFO L158 Benchmark]: RCFGBuilder took 566.22ms. Allocated memory is still 195.0MB. Free memory was 161.9MB in the beginning and 143.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 16:47:09,421 INFO L158 Benchmark]: TraceAbstraction took 3291.36ms. Allocated memory is still 195.0MB. Free memory was 143.0MB in the beginning and 70.6MB in the end (delta: 72.4MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. [2022-11-25 16:47:09,422 INFO L158 Benchmark]: Witness Printer took 77.29ms. Allocated memory is still 195.0MB. Free memory was 70.6MB in the beginning and 66.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 16:47:09,423 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.37ms. Allocated memory is still 159.4MB. Free memory was 103.6MB in the beginning and 103.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1267.82ms. Allocated memory is still 159.4MB. Free memory was 122.4MB in the beginning and 59.7MB in the end (delta: 62.7MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.57ms. Allocated memory was 159.4MB in the beginning and 195.0MB in the end (delta: 35.7MB). Free memory was 59.7MB in the beginning and 161.2MB in the end (delta: -101.5MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.01ms. Allocated memory is still 195.0MB. Free memory was 162.9MB in the beginning and 161.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 566.22ms. Allocated memory is still 195.0MB. Free memory was 161.9MB in the beginning and 143.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 3291.36ms. Allocated memory is still 195.0MB. Free memory was 143.0MB in the beginning and 70.6MB in the end (delta: 72.4MB). Peak memory consumption was 72.4MB. Max. memory is 16.1GB. * Witness Printer took 77.29ms. Allocated memory is still 195.0MB. Free memory was 70.6MB in the beginning and 66.4MB 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, 77 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 15, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 105 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 83 mSDsluCounter, 2822 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1658 mSDsCounter, 9 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 140 IncrementalHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 9 mSolverCounterUnsat, 1164 mSDtfsCounter, 140 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 130 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=0, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 25 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 68 PreInvPairs, 78 NumberOfFragments, 120 HoareAnnotationTreeSize, 68 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 490 NumberOfCodeBlocks, 490 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 475 ConstructedInterpolants, 0 QuantifiedInterpolants, 603 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 124/124 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 1616]: Loop Invariant Derived loop invariant: (2 + data <= 0 && aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = -2; break; }-aux) && 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 && unknown-#memory_int-unknown[data][data] <= 2147483647 - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: unknown-#memory_int-unknown[data][data] <= 2147483647 - 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 && unknown-#memory_int-unknown[data][data] <= 2147483647 - InvariantResult [Line: 1643]: Loop Invariant Derived loop invariant: 0 <= data + 2 && data + 2 <= 0 - InvariantResult [Line: 1584]: Loop Invariant Derived loop invariant: unknown-#memory_int-unknown[data][data] <= 2147483647 - InvariantResult [Line: 1625]: Loop Invariant Derived loop invariant: NULL RESULT: Ultimate proved your program to be correct! [2022-11-25 16:47:09,455 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7712a97-d9eb-44c7-a566-3b9b7052cc10/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