./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_15_good.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be5ff21a-9d3e-4138-977b-805849e38352/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be5ff21a-9d3e-4138-977b-805849e38352/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_be5ff21a-9d3e-4138-977b-805849e38352/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be5ff21a-9d3e-4138-977b-805849e38352/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_15_good.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be5ff21a-9d3e-4138-977b-805849e38352/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_be5ff21a-9d3e-4138-977b-805849e38352/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 19c4f50c1c30200713fbcdbec18b529659891db55faddca307b1d283ef9ba238 --- 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:54:55,212 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 16:54:55,215 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 16:54:55,247 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 16:54:55,248 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 16:54:55,249 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 16:54:55,251 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 16:54:55,253 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 16:54:55,256 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 16:54:55,257 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 16:54:55,258 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 16:54:55,260 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 16:54:55,260 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 16:54:55,262 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 16:54:55,263 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 16:54:55,265 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 16:54:55,266 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 16:54:55,267 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 16:54:55,270 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 16:54:55,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 16:54:55,274 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 16:54:55,276 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 16:54:55,277 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 16:54:55,278 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 16:54:55,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 16:54:55,283 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 16:54:55,283 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 16:54:55,284 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 16:54:55,285 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 16:54:55,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 16:54:55,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 16:54:55,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 16:54:55,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 16:54:55,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 16:54:55,291 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 16:54:55,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 16:54:55,293 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 16:54:55,293 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 16:54:55,294 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 16:54:55,295 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 16:54:55,296 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 16:54:55,297 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be5ff21a-9d3e-4138-977b-805849e38352/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-11-25 16:54:55,329 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 16:54:55,329 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 16:54:55,330 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 16:54:55,330 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 16:54:55,331 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 16:54:55,332 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 16:54:55,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 16:54:55,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 16:54:55,333 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 16:54:55,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 16:54:55,334 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-25 16:54:55,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 16:54:55,335 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 16:54:55,335 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 16:54:55,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 16:54:55,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 16:54:55,336 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-11-25 16:54:55,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 16:54:55,337 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 16:54:55,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 16:54:55,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 16:54:55,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 16:54:55,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 16:54:55,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:54:55,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 16:54:55,340 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 16:54:55,340 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 16:54:55,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 16:54:55,340 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 16:54:55,341 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 16:54:55,341 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 16:54:55,341 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 16:54:55,342 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 16:54:55,342 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_be5ff21a-9d3e-4138-977b-805849e38352/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_be5ff21a-9d3e-4138-977b-805849e38352/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 -> 19c4f50c1c30200713fbcdbec18b529659891db55faddca307b1d283ef9ba238 [2022-11-25 16:54:55,659 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 16:54:55,696 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 16:54:55,699 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 16:54:55,701 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 16:54:55,701 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 16:54:55,703 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be5ff21a-9d3e-4138-977b-805849e38352/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_15_good.i [2022-11-25 16:54:59,453 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 16:54:59,989 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 16:54:59,990 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be5ff21a-9d3e-4138-977b-805849e38352/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_15_good.i [2022-11-25 16:55:00,036 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be5ff21a-9d3e-4138-977b-805849e38352/bin/uautomizer-ZsLfNo2U6R/data/c5df93d3f/348182128e4040afa4f484e0887af5bf/FLAG1e987a54e [2022-11-25 16:55:00,060 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be5ff21a-9d3e-4138-977b-805849e38352/bin/uautomizer-ZsLfNo2U6R/data/c5df93d3f/348182128e4040afa4f484e0887af5bf [2022-11-25 16:55:00,067 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 16:55:00,069 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 16:55:00,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 16:55:00,075 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 16:55:00,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 16:55:00,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:55:00" (1/1) ... [2022-11-25 16:55:00,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17f4cf96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:00, skipping insertion in model container [2022-11-25 16:55:00,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 04:55:00" (1/1) ... [2022-11-25 16:55:00,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 16:55:00,189 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 16:55:00,621 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 16:55:01,349 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 16:55:01,357 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:55:01,360 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:55:01,364 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:55:01,365 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:55:01,465 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 16:55:01,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:55:01,491 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 16:55:01,534 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-25 16:55:01,630 WARN L623 FunctionHandler]: Unknown extern function puts [2022-11-25 16:55:01,632 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:55:01,634 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-11-25 16:55:01,637 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:55:01,637 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-11-25 16:55:01,649 WARN L623 FunctionHandler]: Unknown extern function time [2022-11-25 16:55:01,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 16:55:01,814 INFO L208 MainTranslator]: Completed translation [2022-11-25 16:55:01,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:01 WrapperNode [2022-11-25 16:55:01,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 16:55:01,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 16:55:01,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 16:55:01,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 16:55:01,849 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:55:01" (1/1) ... [2022-11-25 16:55:01,880 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:55:01" (1/1) ... [2022-11-25 16:55:01,911 INFO L138 Inliner]: procedures = 503, calls = 81, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2022-11-25 16:55:01,911 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 16:55:01,912 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 16:55:01,912 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 16:55:01,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 16:55:01,925 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:01" (1/1) ... [2022-11-25 16:55:01,926 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:01" (1/1) ... [2022-11-25 16:55:01,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:01" (1/1) ... [2022-11-25 16:55:01,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:01" (1/1) ... [2022-11-25 16:55:01,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:01" (1/1) ... [2022-11-25 16:55:01,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:01" (1/1) ... [2022-11-25 16:55:01,943 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:01" (1/1) ... [2022-11-25 16:55:01,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:01" (1/1) ... [2022-11-25 16:55:01,949 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 16:55:01,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 16:55:01,950 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 16:55:01,950 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 16:55:01,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:01" (1/1) ... [2022-11-25 16:55:01,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 16:55:01,975 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be5ff21a-9d3e-4138-977b-805849e38352/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 16:55:01,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be5ff21a-9d3e-4138-977b-805849e38352/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 16:55:02,002 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be5ff21a-9d3e-4138-977b-805849e38352/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 16:55:02,047 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-11-25 16:55:02,047 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-11-25 16:55:02,047 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-11-25 16:55:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-11-25 16:55:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 16:55:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 16:55:02,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 16:55:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-11-25 16:55:02,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 16:55:02,222 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 16:55:02,225 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 16:55:02,555 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 16:55:02,564 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 16:55:02,565 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-25 16:55:02,567 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:55:02 BoogieIcfgContainer [2022-11-25 16:55:02,568 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 16:55:02,570 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 16:55:02,570 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 16:55:02,575 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 16:55:02,575 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 04:55:00" (1/3) ... [2022-11-25 16:55:02,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e46e34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:55:02, skipping insertion in model container [2022-11-25 16:55:02,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 04:55:01" (2/3) ... [2022-11-25 16:55:02,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74e46e34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 04:55:02, skipping insertion in model container [2022-11-25 16:55:02,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:55:02" (3/3) ... [2022-11-25 16:55:02,579 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_multiply_15_good.i [2022-11-25 16:55:02,611 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 16:55:02,611 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-11-25 16:55:02,679 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 16:55:02,687 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;@2d542bfc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 16:55:02,688 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-25 16:55:02,694 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 76 states have internal predecessors, (85), 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:55:02,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 16:55:02,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:02,707 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:02,708 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:55:02,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:02,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1923445095, now seen corresponding path program 1 times [2022-11-25 16:55:02,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:02,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262452865] [2022-11-25 16:55:02,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:02,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:02,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:03,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:55:03,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:03,245 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:55:03,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:03,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262452865] [2022-11-25 16:55:03,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262452865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:03,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:03,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:55:03,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480472785] [2022-11-25 16:55:03,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:03,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:55:03,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:03,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:55:03,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:03,296 INFO L87 Difference]: Start difference. First operand has 81 states, 54 states have (on average 1.5740740740740742) internal successors, (85), 76 states have internal predecessors, (85), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 10 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 16:55:03,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:03,402 INFO L93 Difference]: Finished difference Result 210 states and 304 transitions. [2022-11-25 16:55:03,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:55:03,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-11-25 16:55:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:03,430 INFO L225 Difference]: With dead ends: 210 [2022-11-25 16:55:03,430 INFO L226 Difference]: Without dead ends: 121 [2022-11-25 16:55:03,439 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:55:03,444 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 62 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 235 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:55:03,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 235 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:55:03,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-11-25 16:55:03,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 75. [2022-11-25 16:55:03,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 52 states have (on average 1.5576923076923077) internal successors, (81), 71 states have internal predecessors, (81), 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:55:03,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 107 transitions. [2022-11-25 16:55:03,506 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 107 transitions. Word has length 15 [2022-11-25 16:55:03,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:03,506 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 107 transitions. [2022-11-25 16:55:03,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 16:55:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 107 transitions. [2022-11-25 16:55:03,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 16:55:03,509 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:03,509 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:03,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 16:55:03,510 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:55:03,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:03,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1033231396, now seen corresponding path program 1 times [2022-11-25 16:55:03,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:03,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867946645] [2022-11-25 16:55:03,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:03,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:03,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:03,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:55:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:03,605 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:55:03,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:03,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867946645] [2022-11-25 16:55:03,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867946645] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:03,606 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:03,606 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:55:03,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717004930] [2022-11-25 16:55:03,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:03,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:55:03,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:03,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:55:03,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:03,610 INFO L87 Difference]: Start difference. First operand 75 states and 107 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 16:55:03,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:03,640 INFO L93 Difference]: Finished difference Result 128 states and 181 transitions. [2022-11-25 16:55:03,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:55:03,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-11-25 16:55:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:03,643 INFO L225 Difference]: With dead ends: 128 [2022-11-25 16:55:03,643 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 16:55:03,644 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:55:03,646 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:03,647 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 170 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:55:03,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 16:55:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-25 16:55:03,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.4772727272727273) internal successors, (65), 59 states have internal predecessors, (65), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 16:55:03,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2022-11-25 16:55:03,659 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 16 [2022-11-25 16:55:03,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:03,660 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2022-11-25 16:55:03,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 16:55:03,661 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-11-25 16:55:03,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-25 16:55:03,662 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:03,662 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:03,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 16:55:03,663 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:55:03,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:03,664 INFO L85 PathProgramCache]: Analyzing trace with hash 426041701, now seen corresponding path program 1 times [2022-11-25 16:55:03,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:03,665 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181106456] [2022-11-25 16:55:03,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:03,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:03,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:03,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:55:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:03,839 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:55:03,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:03,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181106456] [2022-11-25 16:55:03,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181106456] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:03,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:03,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:55:03,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192987759] [2022-11-25 16:55:03,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:03,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:55:03,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:03,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:55:03,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:03,856 INFO L87 Difference]: Start difference. First operand 63 states and 87 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (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:55:03,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:03,890 INFO L93 Difference]: Finished difference Result 114 states and 157 transitions. [2022-11-25 16:55:03,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:55:03,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (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 20 [2022-11-25 16:55:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:03,893 INFO L225 Difference]: With dead ends: 114 [2022-11-25 16:55:03,893 INFO L226 Difference]: Without dead ends: 63 [2022-11-25 16:55:03,894 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:55:03,895 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 3 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 161 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:55:03,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 161 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:55:03,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-11-25 16:55:03,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-11-25 16:55:03,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 44 states have (on average 1.4545454545454546) internal successors, (64), 58 states have internal predecessors, (64), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 7 states have call predecessors, (11), 11 states have call successors, (11) [2022-11-25 16:55:03,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2022-11-25 16:55:03,908 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 20 [2022-11-25 16:55:03,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:03,909 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2022-11-25 16:55:03,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 1 states have call successors, (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:55:03,909 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2022-11-25 16:55:03,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-25 16:55:03,911 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:03,911 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] [2022-11-25 16:55:03,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 16:55:03,912 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:55:03,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:03,913 INFO L85 PathProgramCache]: Analyzing trace with hash 433245301, now seen corresponding path program 1 times [2022-11-25 16:55:03,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:03,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837823565] [2022-11-25 16:55:03,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:03,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:55:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:03,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-25 16:55:03,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:03,993 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:55:03,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:03,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837823565] [2022-11-25 16:55:03,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837823565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:03,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:03,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:55:03,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2990490] [2022-11-25 16:55:03,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:03,995 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:55:03,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:03,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:55:03,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:03,997 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:55:04,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:04,015 INFO L93 Difference]: Finished difference Result 114 states and 156 transitions. [2022-11-25 16:55:04,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:55:04,015 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), 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 24 [2022-11-25 16:55:04,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:04,017 INFO L225 Difference]: With dead ends: 114 [2022-11-25 16:55:04,017 INFO L226 Difference]: Without dead ends: 62 [2022-11-25 16:55:04,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:04,020 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 0 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 160 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:55:04,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 160 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:55:04,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-11-25 16:55:04,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-11-25 16:55:04,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 44 states have (on average 1.4318181818181819) internal successors, (63), 57 states have internal predecessors, (63), 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:55:04,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2022-11-25 16:55:04,031 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 24 [2022-11-25 16:55:04,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:04,032 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-11-25 16:55:04,032 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), 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:55:04,032 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-11-25 16:55:04,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-25 16:55:04,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:04,034 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] [2022-11-25 16:55:04,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 16:55:04,034 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:55:04,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:04,035 INFO L85 PathProgramCache]: Analyzing trace with hash 406206194, now seen corresponding path program 1 times [2022-11-25 16:55:04,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:04,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661831805] [2022-11-25 16:55:04,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:04,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:55:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 16:55:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,110 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:55:04,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:04,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661831805] [2022-11-25 16:55:04,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661831805] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:04,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:04,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:55:04,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460630487] [2022-11-25 16:55:04,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:04,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:55:04,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:04,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:55:04,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:04,114 INFO L87 Difference]: Start difference. First operand 62 states and 83 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (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:55:04,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:04,147 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-11-25 16:55:04,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:55:04,148 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (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 27 [2022-11-25 16:55:04,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:04,150 INFO L225 Difference]: With dead ends: 135 [2022-11-25 16:55:04,150 INFO L226 Difference]: Without dead ends: 96 [2022-11-25 16:55:04,151 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:55:04,152 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 33 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 160 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:55:04,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 160 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:55:04,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-11-25 16:55:04,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2022-11-25 16:55:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.4166666666666667) internal successors, (68), 61 states have internal predecessors, (68), 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:55:04,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2022-11-25 16:55:04,166 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 27 [2022-11-25 16:55:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:04,166 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2022-11-25 16:55:04,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (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:55:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2022-11-25 16:55:04,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 16:55:04,168 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:04,168 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:04,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 16:55:04,169 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:55:04,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:04,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1422376419, now seen corresponding path program 1 times [2022-11-25 16:55:04,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:04,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637385510] [2022-11-25 16:55:04,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:04,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:55:04,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 16:55:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,232 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:55:04,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:04,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637385510] [2022-11-25 16:55:04,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637385510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:04,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:04,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:55:04,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807844040] [2022-11-25 16:55:04,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:04,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:55:04,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:04,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:55:04,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:04,236 INFO L87 Difference]: Start difference. First operand 66 states and 88 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 16:55:04,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:04,248 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2022-11-25 16:55:04,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:55:04,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2022-11-25 16:55:04,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:04,250 INFO L225 Difference]: With dead ends: 103 [2022-11-25 16:55:04,250 INFO L226 Difference]: Without dead ends: 55 [2022-11-25 16:55:04,251 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:55:04,252 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 1 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:04,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 136 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:55:04,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-25 16:55:04,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-11-25 16:55:04,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 50 states have internal predecessors, (54), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-11-25 16:55:04,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-11-25 16:55:04,262 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 28 [2022-11-25 16:55:04,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:04,263 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-11-25 16:55:04,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 16:55:04,264 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-11-25 16:55:04,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-25 16:55:04,265 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:04,265 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:04,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-25 16:55:04,266 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:55:04,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:04,267 INFO L85 PathProgramCache]: Analyzing trace with hash 91290941, now seen corresponding path program 1 times [2022-11-25 16:55:04,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:04,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609887901] [2022-11-25 16:55:04,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:04,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:55:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 16:55:04,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,324 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:55:04,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:04,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609887901] [2022-11-25 16:55:04,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609887901] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:04,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:04,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:55:04,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872430177] [2022-11-25 16:55:04,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:04,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:55:04,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:04,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:55:04,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:04,328 INFO L87 Difference]: Start difference. First operand 55 states and 70 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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:55:04,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:04,338 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2022-11-25 16:55:04,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:55:04,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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 33 [2022-11-25 16:55:04,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:04,340 INFO L225 Difference]: With dead ends: 89 [2022-11-25 16:55:04,340 INFO L226 Difference]: Without dead ends: 53 [2022-11-25 16:55:04,341 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:55:04,343 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 3 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:04,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 122 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:55:04,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-11-25 16:55:04,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-11-25 16:55:04,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 40 states have (on average 1.275) internal successors, (51), 47 states have internal predecessors, (51), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 16:55:04,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2022-11-25 16:55:04,351 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 33 [2022-11-25 16:55:04,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:04,351 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2022-11-25 16:55:04,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (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:55:04,352 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2022-11-25 16:55:04,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 16:55:04,353 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:04,353 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] [2022-11-25 16:55:04,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 16:55:04,354 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:55:04,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:04,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1997145350, now seen corresponding path program 1 times [2022-11-25 16:55:04,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:04,355 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427114422] [2022-11-25 16:55:04,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:04,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:55:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 16:55:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 16:55:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,461 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:55:04,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:04,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427114422] [2022-11-25 16:55:04,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427114422] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:04,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:04,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:55:04,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966359198] [2022-11-25 16:55:04,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:04,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:55:04,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:04,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:55:04,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:04,463 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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:55:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:04,498 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2022-11-25 16:55:04,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:55:04,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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 39 [2022-11-25 16:55:04,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:04,501 INFO L225 Difference]: With dead ends: 91 [2022-11-25 16:55:04,501 INFO L226 Difference]: Without dead ends: 73 [2022-11-25 16:55:04,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:04,503 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 16:55:04,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 122 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:55:04,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-25 16:55:04,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2022-11-25 16:55:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 52 states have internal predecessors, (57), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 16:55:04,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2022-11-25 16:55:04,514 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 39 [2022-11-25 16:55:04,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:04,515 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2022-11-25 16:55:04,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 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:55:04,515 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-11-25 16:55:04,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-25 16:55:04,536 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:04,536 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] [2022-11-25 16:55:04,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 16:55:04,537 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:55:04,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:04,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1995298308, now seen corresponding path program 1 times [2022-11-25 16:55:04,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:04,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967653242] [2022-11-25 16:55:04,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:04,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:55:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 16:55:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 16:55:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,644 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:55:04,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:04,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967653242] [2022-11-25 16:55:04,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967653242] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:04,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:04,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:55:04,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549820476] [2022-11-25 16:55:04,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:04,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:55:04,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:04,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:55:04,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:04,648 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:55:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:04,661 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2022-11-25 16:55:04,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:55:04,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 39 [2022-11-25 16:55:04,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:04,663 INFO L225 Difference]: With dead ends: 87 [2022-11-25 16:55:04,664 INFO L226 Difference]: Without dead ends: 58 [2022-11-25 16:55:04,664 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:55:04,666 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 121 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:55:04,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:55:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-11-25 16:55:04,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-11-25 16:55:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 45 states have (on average 1.2444444444444445) internal successors, (56), 51 states have internal predecessors, (56), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-11-25 16:55:04,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2022-11-25 16:55:04,675 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 39 [2022-11-25 16:55:04,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:04,676 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2022-11-25 16:55:04,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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:55:04,676 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-11-25 16:55:04,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-11-25 16:55:04,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:04,678 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:04,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 16:55:04,679 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:55:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:04,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1519209323, now seen corresponding path program 1 times [2022-11-25 16:55:04,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:04,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069748483] [2022-11-25 16:55:04,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:04,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:55:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 16:55:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 16:55:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 16:55:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,762 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:55:04,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:04,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069748483] [2022-11-25 16:55:04,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069748483] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:04,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:04,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:55:04,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548789250] [2022-11-25 16:55:04,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:04,765 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:55:04,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:04,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:55:04,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:04,767 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:55:04,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:04,778 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2022-11-25 16:55:04,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:55:04,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 43 [2022-11-25 16:55:04,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:04,780 INFO L225 Difference]: With dead ends: 80 [2022-11-25 16:55:04,780 INFO L226 Difference]: Without dead ends: 50 [2022-11-25 16:55:04,781 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:55:04,782 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 111 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:55:04,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:55:04,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-11-25 16:55:04,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-11-25 16:55:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 40 states have (on average 1.15) internal successors, (46), 44 states have internal predecessors, (46), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-11-25 16:55:04,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-11-25 16:55:04,790 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 43 [2022-11-25 16:55:04,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:04,791 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-11-25 16:55:04,791 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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:55:04,791 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-11-25 16:55:04,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-25 16:55:04,793 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:04,793 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] [2022-11-25 16:55:04,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 16:55:04,794 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (and 5 more)] === [2022-11-25 16:55:04,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:04,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1151157231, now seen corresponding path program 1 times [2022-11-25 16:55:04,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:04,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385426697] [2022-11-25 16:55:04,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:04,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:04,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:55:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 16:55:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 16:55:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,859 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:55:04,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:04,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385426697] [2022-11-25 16:55:04,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385426697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:04,860 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:04,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:55:04,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189924673] [2022-11-25 16:55:04,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:04,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:55:04,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:04,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:55:04,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:04,863 INFO L87 Difference]: Start difference. First operand 50 states and 58 transitions. Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:55:04,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:04,871 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-11-25 16:55:04,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:55:04,872 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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 45 [2022-11-25 16:55:04,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:04,873 INFO L225 Difference]: With dead ends: 66 [2022-11-25 16:55:04,873 INFO L226 Difference]: Without dead ends: 48 [2022-11-25 16:55:04,874 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:55:04,875 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 4 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 97 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:55:04,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 97 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:55:04,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-25 16:55:04,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-25 16:55:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 41 states have internal predecessors, (43), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 16:55:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-11-25 16:55:04,881 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 45 [2022-11-25 16:55:04,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:04,882 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-11-25 16:55:04,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 3 states have internal predecessors, (33), 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:55:04,882 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-11-25 16:55:04,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 16:55:04,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:04,884 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:04,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 16:55:04,885 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:55:04,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:04,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1850334672, now seen corresponding path program 1 times [2022-11-25 16:55:04,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:04,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344306011] [2022-11-25 16:55:04,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:04,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:04,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:55:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 16:55:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 16:55:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 16:55:04,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:04,971 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:55:04,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:04,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344306011] [2022-11-25 16:55:04,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344306011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:04,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:04,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 16:55:04,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087653595] [2022-11-25 16:55:04,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:04,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:55:04,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:04,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:55:04,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:04,974 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 16:55:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:04,989 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-11-25 16:55:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:55:04,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 51 [2022-11-25 16:55:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:04,991 INFO L225 Difference]: With dead ends: 55 [2022-11-25 16:55:04,991 INFO L226 Difference]: Without dead ends: 48 [2022-11-25 16:55:04,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:04,992 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 1 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 98 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:55:04,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 98 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:55:04,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-11-25 16:55:04,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-11-25 16:55:04,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 41 states have internal predecessors, (42), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-11-25 16:55:04,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-11-25 16:55:04,998 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 51 [2022-11-25 16:55:04,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:04,999 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-11-25 16:55:04,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 18.5) internal successors, (37), 3 states have internal predecessors, (37), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 16:55:04,999 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-11-25 16:55:05,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-11-25 16:55:05,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 16:55:05,001 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:05,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 16:55:05,002 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:55:05,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 16:55:05,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1470480846, now seen corresponding path program 1 times [2022-11-25 16:55:05,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 16:55:05,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255679625] [2022-11-25 16:55:05,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 16:55:05,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 16:55:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:05,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 16:55:05,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:05,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 16:55:05,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:05,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-25 16:55:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:05,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-25 16:55:05,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 16:55:05,069 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:55:05,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 16:55:05,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255679625] [2022-11-25 16:55:05,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255679625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 16:55:05,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 16:55:05,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 16:55:05,070 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236685758] [2022-11-25 16:55:05,070 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 16:55:05,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 16:55:05,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 16:55:05,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 16:55:05,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 16:55:05,072 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 16:55:05,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 16:55:05,075 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-11-25 16:55:05,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 16:55:05,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 52 [2022-11-25 16:55:05,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 16:55:05,076 INFO L225 Difference]: With dead ends: 52 [2022-11-25 16:55:05,077 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 16:55:05,077 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:55:05,078 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 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:55:05,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 16:55:05,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 16:55:05,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 16:55:05,080 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:55:05,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 16:55:05,080 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-11-25 16:55:05,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 16:55:05,081 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 16:55:05,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 16:55:05,081 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 16:55:05,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 16:55:05,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-11-25 16:55:05,085 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-11-25 16:55:05,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-11-25 16:55:05,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-11-25 16:55:05,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-11-25 16:55:05,086 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-11-25 16:55:05,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-11-25 16:55:05,087 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-11-25 16:55:05,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 16:55:05,090 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 16:55:05,169 INFO L902 garLoopResultBuilder]: At program point printLineENTRY(lines 1412 1418) the Hoare annotation is: true [2022-11-25 16:55:05,170 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 16:55:05,170 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-11-25 16:55:05,170 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-11-25 16:55:05,170 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 16:55:05,170 INFO L902 garLoopResultBuilder]: At program point printIntLineENTRY(lines 1426 1429) the Hoare annotation is: true [2022-11-25 16:55:05,170 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-11-25 16:55:05,171 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2022-11-25 16:55:05,171 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-11-25 16:55:05,171 INFO L895 garLoopResultBuilder]: At program point L1629(lines 1629 1641) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch97#1| [2022-11-25 16:55:05,171 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-11-25 16:55:05,171 INFO L899 garLoopResultBuilder]: For program point L1588(line 1588) no Hoare annotation was computed. [2022-11-25 16:55:05,172 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-11-25 16:55:05,172 INFO L899 garLoopResultBuilder]: For program point L1638(line 1638) no Hoare annotation was computed. [2022-11-25 16:55:05,172 INFO L895 garLoopResultBuilder]: At program point L1572(line 1572) the Hoare annotation is: false [2022-11-25 16:55:05,172 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2022-11-25 16:55:05,172 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 16:55:05,173 INFO L899 garLoopResultBuilder]: For program point L1597(line 1597) no Hoare annotation was computed. [2022-11-25 16:55:05,173 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 16:55:05,173 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2022-11-25 16:55:05,173 INFO L899 garLoopResultBuilder]: For program point L1622(line 1622) no Hoare annotation was computed. [2022-11-25 16:55:05,173 INFO L902 garLoopResultBuilder]: At program point L1680(line 1680) the Hoare annotation is: true [2022-11-25 16:55:05,174 INFO L899 garLoopResultBuilder]: For program point L1680-1(line 1680) no Hoare annotation was computed. [2022-11-25 16:55:05,174 INFO L895 garLoopResultBuilder]: At program point L1647(lines 1647 1655) the Hoare annotation is: (= |ULTIMATE.start_goodG2B2_~data~3#1| 2) [2022-11-25 16:55:05,174 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1581) no Hoare annotation was computed. [2022-11-25 16:55:05,174 INFO L895 garLoopResultBuilder]: At program point L1639(line 1639) the Hoare annotation is: false [2022-11-25 16:55:05,174 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2022-11-25 16:55:05,175 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2022-11-25 16:55:05,175 INFO L899 garLoopResultBuilder]: For program point L1598(lines 1598 1609) no Hoare annotation was computed. [2022-11-25 16:55:05,175 INFO L902 garLoopResultBuilder]: At program point L1656(lines 1656 1668) the Hoare annotation is: true [2022-11-25 16:55:05,175 INFO L895 garLoopResultBuilder]: At program point L1623(line 1623) the Hoare annotation is: false [2022-11-25 16:55:05,175 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-11-25 16:55:05,176 INFO L899 garLoopResultBuilder]: For program point L1582(lines 1582 1615) no Hoare annotation was computed. [2022-11-25 16:55:05,176 INFO L895 garLoopResultBuilder]: At program point L1607(line 1607) the Hoare annotation is: |ULTIMATE.start_goodB2G2_#t~switch95#1| [2022-11-25 16:55:05,176 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2022-11-25 16:55:05,176 INFO L899 garLoopResultBuilder]: For program point L1632(lines 1632 1636) no Hoare annotation was computed. [2022-11-25 16:55:05,176 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-11-25 16:55:05,177 INFO L899 garLoopResultBuilder]: For program point L1591(line 1591) no Hoare annotation was computed. [2022-11-25 16:55:05,177 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2022-11-25 16:55:05,177 INFO L902 garLoopResultBuilder]: At program point L1682(line 1682) the Hoare annotation is: true [2022-11-25 16:55:05,177 INFO L899 garLoopResultBuilder]: For program point L1649(line 1649) no Hoare annotation was computed. [2022-11-25 16:55:05,177 INFO L899 garLoopResultBuilder]: For program point L1682-1(line 1682) no Hoare annotation was computed. [2022-11-25 16:55:05,177 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1642) no Hoare annotation was computed. [2022-11-25 16:55:05,178 INFO L902 garLoopResultBuilder]: At program point L1666(line 1666) the Hoare annotation is: true [2022-11-25 16:55:05,178 INFO L899 garLoopResultBuilder]: For program point L1600(lines 1600 1608) no Hoare annotation was computed. [2022-11-25 16:55:05,178 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1578) no Hoare annotation was computed. [2022-11-25 16:55:05,178 INFO L899 garLoopResultBuilder]: For program point L1658(line 1658) no Hoare annotation was computed. [2022-11-25 16:55:05,178 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-11-25 16:55:05,179 INFO L895 garLoopResultBuilder]: At program point L1592(line 1592) the Hoare annotation is: false [2022-11-25 16:55:05,179 INFO L902 garLoopResultBuilder]: At program point L1683(lines 1677 1684) the Hoare annotation is: true [2022-11-25 16:55:05,179 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch93#1| [2022-11-25 16:55:05,179 INFO L899 garLoopResultBuilder]: For program point L1634(line 1634) no Hoare annotation was computed. [2022-11-25 16:55:05,179 INFO L899 garLoopResultBuilder]: For program point L1634-1(line 1634) no Hoare annotation was computed. [2022-11-25 16:55:05,179 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 16:55:05,180 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2022-11-25 16:55:05,180 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1663) no Hoare annotation was computed. [2022-11-25 16:55:05,180 INFO L895 garLoopResultBuilder]: At program point L1552(lines 1552 1560) the Hoare annotation is: (and |ULTIMATE.start_goodB2G1_#t~switch92#1| (<= 2147483647 |ULTIMATE.start_goodB2G1_~data~0#1|)) [2022-11-25 16:55:05,180 INFO L899 garLoopResultBuilder]: For program point L1643(lines 1643 1669) no Hoare annotation was computed. [2022-11-25 16:55:05,181 INFO L895 garLoopResultBuilder]: At program point L1635(line 1635) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch97#1| [2022-11-25 16:55:05,181 INFO L899 garLoopResultBuilder]: For program point L1602(line 1602) no Hoare annotation was computed. [2022-11-25 16:55:05,181 INFO L899 garLoopResultBuilder]: For program point L1569(lines 1569 1577) no Hoare annotation was computed. [2022-11-25 16:55:05,181 INFO L899 garLoopResultBuilder]: For program point L1602-1(line 1602) no Hoare annotation was computed. [2022-11-25 16:55:05,181 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 16:55:05,181 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2022-11-25 16:55:05,182 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1580) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch93#1| [2022-11-25 16:55:05,182 INFO L899 garLoopResultBuilder]: For program point L1652(line 1652) no Hoare annotation was computed. [2022-11-25 16:55:05,182 INFO L895 garLoopResultBuilder]: At program point L1586(lines 1586 1594) the Hoare annotation is: (and |ULTIMATE.start_goodB2G2_#t~switch94#1| (<= 2147483647 |ULTIMATE.start_goodB2G2_~data~1#1|)) [2022-11-25 16:55:05,182 INFO L899 garLoopResultBuilder]: For program point L1611(line 1611) no Hoare annotation was computed. [2022-11-25 16:55:05,182 INFO L895 garLoopResultBuilder]: At program point L1603(line 1603) the Hoare annotation is: false [2022-11-25 16:55:05,183 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2022-11-25 16:55:05,183 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-11-25 16:55:05,183 INFO L899 garLoopResultBuilder]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2022-11-25 16:55:05,183 INFO L895 garLoopResultBuilder]: At program point L1595(lines 1595 1614) the Hoare annotation is: |ULTIMATE.start_goodB2G2_#t~switch95#1| [2022-11-25 16:55:05,183 INFO L895 garLoopResultBuilder]: At program point L1653(line 1653) the Hoare annotation is: false [2022-11-25 16:55:05,184 INFO L895 garLoopResultBuilder]: At program point L1620(lines 1620 1628) the Hoare annotation is: (and (= 2 |ULTIMATE.start_goodG2B1_~data~2#1|) |ULTIMATE.start_goodG2B1_#t~switch96#1|) [2022-11-25 16:55:05,184 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-11-25 16:55:05,184 INFO L895 garLoopResultBuilder]: At program point L1612(line 1612) the Hoare annotation is: false [2022-11-25 16:55:05,184 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-11-25 16:55:05,184 INFO L899 garLoopResultBuilder]: For program point L1670(lines 1670 1676) no Hoare annotation was computed. [2022-11-25 16:55:05,185 INFO L899 garLoopResultBuilder]: For program point L1571(line 1571) no Hoare annotation was computed. [2022-11-25 16:55:05,185 INFO L899 garLoopResultBuilder]: For program point L1571-1(line 1571) no Hoare annotation was computed. [2022-11-25 16:55:05,189 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 16:55:05,191 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 16:55:05,210 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 04:55:05 BoogieIcfgContainer [2022-11-25 16:55:05,210 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 16:55:05,211 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 16:55:05,211 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 16:55:05,211 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 16:55:05,212 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 04:55:02" (3/4) ... [2022-11-25 16:55:05,216 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 16:55:05,224 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-11-25 16:55:05,224 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-11-25 16:55:05,235 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-11-25 16:55:05,236 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-11-25 16:55:05,236 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 16:55:05,237 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 16:55:05,237 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 16:55:05,325 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be5ff21a-9d3e-4138-977b-805849e38352/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 16:55:05,325 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 16:55:05,326 INFO L158 Benchmark]: Toolchain (without parser) took 5256.86ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 117.2MB in the beginning and 69.8MB in the end (delta: 47.4MB). Peak memory consumption was 81.4MB. Max. memory is 16.1GB. [2022-11-25 16:55:05,326 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 123.7MB. Free memory was 92.7MB in the beginning and 92.7MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 16:55:05,327 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1763.17ms. Allocated memory is still 153.1MB. Free memory was 117.2MB in the beginning and 122.0MB in the end (delta: -4.9MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. [2022-11-25 16:55:05,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.07ms. Allocated memory is still 153.1MB. Free memory was 122.0MB in the beginning and 119.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:55:05,328 INFO L158 Benchmark]: Boogie Preprocessor took 36.87ms. Allocated memory is still 153.1MB. Free memory was 119.0MB in the beginning and 117.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 16:55:05,328 INFO L158 Benchmark]: RCFGBuilder took 617.86ms. Allocated memory is still 153.1MB. Free memory was 117.8MB in the beginning and 101.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 16:55:05,329 INFO L158 Benchmark]: TraceAbstraction took 2640.22ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 101.0MB in the beginning and 74.0MB in the end (delta: 27.0MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. [2022-11-25 16:55:05,329 INFO L158 Benchmark]: Witness Printer took 114.45ms. Allocated memory is still 184.5MB. Free memory was 74.0MB in the beginning and 69.8MB in the end (delta: 4.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 16:55:05,331 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.26ms. Allocated memory is still 123.7MB. Free memory was 92.7MB in the beginning and 92.7MB in the end (delta: 25.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1763.17ms. Allocated memory is still 153.1MB. Free memory was 117.2MB in the beginning and 122.0MB in the end (delta: -4.9MB). Peak memory consumption was 77.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.07ms. Allocated memory is still 153.1MB. Free memory was 122.0MB in the beginning and 119.0MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.87ms. Allocated memory is still 153.1MB. Free memory was 119.0MB in the beginning and 117.8MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 617.86ms. Allocated memory is still 153.1MB. Free memory was 117.8MB in the beginning and 101.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2640.22ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 101.0MB in the beginning and 74.0MB in the end (delta: 27.0MB). Peak memory consumption was 58.4MB. Max. memory is 16.1GB. * Witness Printer took 114.45ms. Allocated memory is still 184.5MB. Free memory was 74.0MB in the beginning and 69.8MB in the end (delta: 4.3MB). 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: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1571]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1602]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1634]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1661]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 81 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 153 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 126 mSDsluCounter, 1774 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 844 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 65 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 930 mSDtfsCounter, 65 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=81occurred in iteration=0, InterpolantAutomatonStates: 39, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 91 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 105 PreInvPairs, 125 NumberOfFragments, 41 HoareAnnotationTreeSize, 105 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 27 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 419 ConstructedInterpolants, 0 QuantifiedInterpolants, 455 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 100/100 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: 1595]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1656]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1629]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1561]: Loop Invariant Derived loop invariant: NULL - InvariantResult [Line: 1552]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: data = 0x7fffffff; break; default: printLine("Benign, fixed string"); break; }-aux && 2147483647 <= data - InvariantResult [Line: 1586]: Loop Invariant Derived loop invariant: aux-switch(6) { case 6: data = 0x7fffffff; break; default: printLine("Benign, fixed string"); break; }-aux && 2147483647 <= data - InvariantResult [Line: 1620]: Loop Invariant Derived loop invariant: 2 == data && aux-switch(5) { case 6: printLine("Benign, fixed string"); break; default: data = 2; break; }-aux - InvariantResult [Line: 1647]: Loop Invariant Derived loop invariant: data == 2 - InvariantResult [Line: 1677]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-11-25 16:55:05,358 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_be5ff21a-9d3e-4138-977b-805849e38352/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE