./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 2329fc70 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_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8/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_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 17:34:23,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 17:34:23,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 17:34:23,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 17:34:23,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 17:34:23,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 17:34:23,606 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 17:34:23,607 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 17:34:23,608 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 17:34:23,609 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 17:34:23,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 17:34:23,610 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 17:34:23,610 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 17:34:23,611 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 17:34:23,612 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 17:34:23,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 17:34:23,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 17:34:23,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 17:34:23,615 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 17:34:23,616 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 17:34:23,617 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 17:34:23,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 17:34:23,618 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 17:34:23,619 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 17:34:23,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 17:34:23,621 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 17:34:23,621 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 17:34:23,622 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 17:34:23,622 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 17:34:23,622 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 17:34:23,623 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 17:34:23,623 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 17:34:23,624 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 17:34:23,624 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 17:34:23,625 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 17:34:23,625 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 17:34:23,625 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 17:34:23,625 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 17:34:23,626 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 17:34:23,626 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 17:34:23,627 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 17:34:23,627 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8/config/svcomp-Overflow-64bit-Automizer_Default.epf [2022-12-13 17:34:23,641 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 17:34:23,642 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 17:34:23,642 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 17:34:23,642 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 17:34:23,642 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 17:34:23,642 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 17:34:23,643 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 17:34:23,643 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 17:34:23,643 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 17:34:23,643 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 17:34:23,643 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 17:34:23,643 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 17:34:23,643 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 17:34:23,644 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 17:34:23,644 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 17:34:23,644 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 17:34:23,644 INFO L138 SettingsManager]: * Check absence of signed integer overflows=true [2022-12-13 17:34:23,644 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 17:34:23,644 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 17:34:23,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 17:34:23,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 17:34:23,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 17:34:23,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 17:34:23,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:34:23,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 17:34:23,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 17:34:23,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 17:34:23,645 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 17:34:23,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 17:34:23,645 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 17:34:23,645 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 17:34:23,645 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 17:34:23,645 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 17:34:23,645 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 17:34:23,646 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_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8/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_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8 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-12-13 17:34:23,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 17:34:23,833 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 17:34:23,835 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 17:34:23,836 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 17:34:23,836 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 17:34:23,837 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_15_good.i [2022-12-13 17:34:26,407 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 17:34:26,663 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 17:34:26,663 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c0f053-009c-4d2e-8845-fb1ab61e4091/sv-benchmarks/c/Juliet_Test/CWE190_Integer_Overflow__int_max_multiply_15_good.i [2022-12-13 17:34:26,681 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8/data/78a9cf400/8c849e71d0514a8b9ac545f15860b89c/FLAGba4bd043a [2022-12-13 17:34:26,695 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8/data/78a9cf400/8c849e71d0514a8b9ac545f15860b89c [2022-12-13 17:34:26,697 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 17:34:26,699 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 17:34:26,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 17:34:26,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 17:34:26,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 17:34:26,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:34:26" (1/1) ... [2022-12-13 17:34:26,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78c756f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:34:26, skipping insertion in model container [2022-12-13 17:34:26,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 05:34:26" (1/1) ... [2022-12-13 17:34:26,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 17:34:26,760 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 17:34:27,007 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 17:34:27,291 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-13 17:34:27,295 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 17:34:27,296 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 17:34:27,298 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 17:34:27,299 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 17:34:27,327 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-13 17:34:27,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:34:27,335 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 17:34:27,350 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-12-13 17:34:27,381 WARN L623 FunctionHandler]: Unknown extern function puts [2022-12-13 17:34:27,382 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 17:34:27,383 WARN L623 FunctionHandler]: Unknown extern function __ctype_b_loc [2022-12-13 17:34:27,384 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 17:34:27,385 WARN L623 FunctionHandler]: Unknown extern function iswxdigit [2022-12-13 17:34:27,392 WARN L623 FunctionHandler]: Unknown extern function time [2022-12-13 17:34:27,393 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 17:34:27,510 INFO L208 MainTranslator]: Completed translation [2022-12-13 17:34:27,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:34:27 WrapperNode [2022-12-13 17:34:27,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 17:34:27,511 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 17:34:27,511 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 17:34:27,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 17:34:27,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:34:27" (1/1) ... [2022-12-13 17:34:27,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:34:27" (1/1) ... [2022-12-13 17:34:27,549 INFO L138 Inliner]: procedures = 503, calls = 81, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 149 [2022-12-13 17:34:27,549 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 17:34:27,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 17:34:27,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 17:34:27,550 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 17:34:27,556 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:34:27" (1/1) ... [2022-12-13 17:34:27,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:34:27" (1/1) ... [2022-12-13 17:34:27,558 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:34:27" (1/1) ... [2022-12-13 17:34:27,559 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:34:27" (1/1) ... [2022-12-13 17:34:27,562 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:34:27" (1/1) ... [2022-12-13 17:34:27,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:34:27" (1/1) ... [2022-12-13 17:34:27,565 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:34:27" (1/1) ... [2022-12-13 17:34:27,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:34:27" (1/1) ... [2022-12-13 17:34:27,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 17:34:27,568 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 17:34:27,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 17:34:27,568 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 17:34:27,569 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:34:27" (1/1) ... [2022-12-13 17:34:27,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 17:34:27,582 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 17:34:27,592 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 17:34:27,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 17:34:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure printIntLine [2022-12-13 17:34:27,625 INFO L138 BoogieDeclarations]: Found implementation of procedure printIntLine [2022-12-13 17:34:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure printLine [2022-12-13 17:34:27,625 INFO L138 BoogieDeclarations]: Found implementation of procedure printLine [2022-12-13 17:34:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 17:34:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 17:34:27,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 17:34:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure time [2022-12-13 17:34:27,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 17:34:27,731 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 17:34:27,733 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 17:34:27,901 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 17:34:27,906 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 17:34:27,906 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 17:34:27,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:34:27 BoogieIcfgContainer [2022-12-13 17:34:27,908 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 17:34:27,909 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 17:34:27,910 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 17:34:27,912 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 17:34:27,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 05:34:26" (1/3) ... [2022-12-13 17:34:27,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f528fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:34:27, skipping insertion in model container [2022-12-13 17:34:27,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 05:34:27" (2/3) ... [2022-12-13 17:34:27,913 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f528fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 05:34:27, skipping insertion in model container [2022-12-13 17:34:27,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:34:27" (3/3) ... [2022-12-13 17:34:27,914 INFO L112 eAbstractionObserver]: Analyzing ICFG CWE190_Integer_Overflow__int_max_multiply_15_good.i [2022-12-13 17:34:27,931 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 17:34:27,931 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 8 error locations. [2022-12-13 17:34:27,968 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 17:34:27,972 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;@7404f37b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 17:34:27,972 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-12-13 17:34:27,976 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-12-13 17:34:27,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-12-13 17:34:27,981 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:34:27,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:34:27,982 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-12-13 17:34:27,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:34:27,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1923445095, now seen corresponding path program 1 times [2022-12-13 17:34:27,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:34:27,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468059699] [2022-12-13 17:34:27,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:34:27,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:34:28,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:34:28,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:34:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:34:28,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468059699] [2022-12-13 17:34:28,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468059699] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:34:28,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:34:28,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:34:28,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524184965] [2022-12-13 17:34:28,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:34:28,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:34:28,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:34:28,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:34:28,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:34:28,202 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-12-13 17:34:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:34:28,259 INFO L93 Difference]: Finished difference Result 210 states and 304 transitions. [2022-12-13 17:34:28,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:34:28,261 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-12-13 17:34:28,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:34:28,271 INFO L225 Difference]: With dead ends: 210 [2022-12-13 17:34:28,271 INFO L226 Difference]: Without dead ends: 121 [2022-12-13 17:34:28,274 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-12-13 17:34:28,278 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-12-13 17:34:28,278 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-12-13 17:34:28,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-12-13 17:34:28,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 75. [2022-12-13 17:34:28,314 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-12-13 17:34:28,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 107 transitions. [2022-12-13 17:34:28,317 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 107 transitions. Word has length 15 [2022-12-13 17:34:28,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:34:28,317 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 107 transitions. [2022-12-13 17:34:28,317 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-12-13 17:34:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 107 transitions. [2022-12-13 17:34:28,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 17:34:28,318 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:34:28,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:34:28,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 17:34:28,319 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-12-13 17:34:28,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:34:28,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1033231396, now seen corresponding path program 1 times [2022-12-13 17:34:28,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:34:28,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838371060] [2022-12-13 17:34:28,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:34:28,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:34:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:34:28,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:34:28,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:34:28,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838371060] [2022-12-13 17:34:28,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838371060] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:34:28,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:34:28,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:34:28,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345458443] [2022-12-13 17:34:28,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:34:28,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:34:28,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:34:28,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:34:28,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:34:28,383 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-12-13 17:34:28,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:34:28,394 INFO L93 Difference]: Finished difference Result 128 states and 181 transitions. [2022-12-13 17:34:28,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:34:28,395 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-12-13 17:34:28,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:34:28,395 INFO L225 Difference]: With dead ends: 128 [2022-12-13 17:34:28,395 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 17:34:28,396 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-12-13 17:34:28,397 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-12-13 17:34:28,397 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-12-13 17:34:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 17:34:28,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-12-13 17:34:28,401 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-12-13 17:34:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 87 transitions. [2022-12-13 17:34:28,402 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 87 transitions. Word has length 16 [2022-12-13 17:34:28,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:34:28,402 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 87 transitions. [2022-12-13 17:34:28,402 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-12-13 17:34:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 87 transitions. [2022-12-13 17:34:28,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 17:34:28,403 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:34:28,403 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-12-13 17:34:28,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 17:34:28,403 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-12-13 17:34:28,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:34:28,404 INFO L85 PathProgramCache]: Analyzing trace with hash 426041701, now seen corresponding path program 1 times [2022-12-13 17:34:28,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:34:28,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226343517] [2022-12-13 17:34:28,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:34:28,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:34:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:34:28,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 17:34:28,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:34:28,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226343517] [2022-12-13 17:34:28,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226343517] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:34:28,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:34:28,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:34:28,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835738043] [2022-12-13 17:34:28,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:34:28,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:34:28,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:34:28,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:34:28,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:34:28,440 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-12-13 17:34:28,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:34:28,454 INFO L93 Difference]: Finished difference Result 114 states and 157 transitions. [2022-12-13 17:34:28,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:34:28,454 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-12-13 17:34:28,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:34:28,455 INFO L225 Difference]: With dead ends: 114 [2022-12-13 17:34:28,455 INFO L226 Difference]: Without dead ends: 63 [2022-12-13 17:34:28,455 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-12-13 17:34:28,456 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-12-13 17:34:28,456 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-12-13 17:34:28,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-12-13 17:34:28,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-12-13 17:34:28,461 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-12-13 17:34:28,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2022-12-13 17:34:28,461 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 20 [2022-12-13 17:34:28,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:34:28,462 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2022-12-13 17:34:28,462 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-12-13 17:34:28,462 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2022-12-13 17:34:28,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 17:34:28,462 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:34:28,462 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-12-13 17:34:28,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 17:34:28,463 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-12-13 17:34:28,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:34:28,463 INFO L85 PathProgramCache]: Analyzing trace with hash 433245301, now seen corresponding path program 1 times [2022-12-13 17:34:28,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:34:28,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931153441] [2022-12-13 17:34:28,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:34:28,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:34:28,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:34:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-12-13 17:34:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 17:34:28,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:34:28,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931153441] [2022-12-13 17:34:28,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931153441] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:34:28,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:34:28,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:34:28,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363651331] [2022-12-13 17:34:28,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:34:28,501 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:34:28,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:34:28,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:34:28,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:34:28,502 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-12-13 17:34:28,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:34:28,514 INFO L93 Difference]: Finished difference Result 114 states and 156 transitions. [2022-12-13 17:34:28,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:34:28,514 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-12-13 17:34:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:34:28,515 INFO L225 Difference]: With dead ends: 114 [2022-12-13 17:34:28,515 INFO L226 Difference]: Without dead ends: 62 [2022-12-13 17:34:28,515 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-12-13 17:34:28,516 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-12-13 17:34:28,517 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-12-13 17:34:28,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-12-13 17:34:28,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-12-13 17:34:28,520 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-12-13 17:34:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 83 transitions. [2022-12-13 17:34:28,521 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 83 transitions. Word has length 24 [2022-12-13 17:34:28,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:34:28,521 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 83 transitions. [2022-12-13 17:34:28,522 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-12-13 17:34:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 83 transitions. [2022-12-13 17:34:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 17:34:28,522 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:34:28,522 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-12-13 17:34:28,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 17:34:28,522 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-12-13 17:34:28,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:34:28,523 INFO L85 PathProgramCache]: Analyzing trace with hash 406206194, now seen corresponding path program 1 times [2022-12-13 17:34:28,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:34:28,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889461117] [2022-12-13 17:34:28,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:34:28,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:34:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:34:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:34:28,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 17:34:28,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:34:28,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889461117] [2022-12-13 17:34:28,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889461117] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:34:28,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:34:28,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:34:28,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023451125] [2022-12-13 17:34:28,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:34:28,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:34:28,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:34:28,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:34:28,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:34:28,566 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-12-13 17:34:28,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:34:28,590 INFO L93 Difference]: Finished difference Result 135 states and 182 transitions. [2022-12-13 17:34:28,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:34:28,591 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-12-13 17:34:28,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:34:28,593 INFO L225 Difference]: With dead ends: 135 [2022-12-13 17:34:28,593 INFO L226 Difference]: Without dead ends: 96 [2022-12-13 17:34:28,593 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-12-13 17:34:28,595 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-12-13 17:34:28,595 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-12-13 17:34:28,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-12-13 17:34:28,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2022-12-13 17:34:28,600 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-12-13 17:34:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 88 transitions. [2022-12-13 17:34:28,600 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 88 transitions. Word has length 27 [2022-12-13 17:34:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:34:28,600 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 88 transitions. [2022-12-13 17:34:28,601 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-12-13 17:34:28,601 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 88 transitions. [2022-12-13 17:34:28,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 17:34:28,601 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:34:28,601 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-12-13 17:34:28,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 17:34:28,601 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-12-13 17:34:28,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:34:28,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1422376419, now seen corresponding path program 1 times [2022-12-13 17:34:28,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:34:28,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812928249] [2022-12-13 17:34:28,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:34:28,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:34:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:34:28,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:34:28,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,635 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 17:34:28,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:34:28,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812928249] [2022-12-13 17:34:28,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812928249] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:34:28,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:34:28,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:34:28,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301822104] [2022-12-13 17:34:28,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:34:28,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:34:28,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:34:28,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:34:28,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:34:28,637 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-12-13 17:34:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:34:28,643 INFO L93 Difference]: Finished difference Result 103 states and 137 transitions. [2022-12-13 17:34:28,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:34:28,644 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-12-13 17:34:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:34:28,644 INFO L225 Difference]: With dead ends: 103 [2022-12-13 17:34:28,645 INFO L226 Difference]: Without dead ends: 55 [2022-12-13 17:34:28,645 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-12-13 17:34:28,647 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-12-13 17:34:28,647 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-12-13 17:34:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-12-13 17:34:28,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2022-12-13 17:34:28,650 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-12-13 17:34:28,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2022-12-13 17:34:28,651 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 70 transitions. Word has length 28 [2022-12-13 17:34:28,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:34:28,651 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 70 transitions. [2022-12-13 17:34:28,651 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-12-13 17:34:28,651 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2022-12-13 17:34:28,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-13 17:34:28,652 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:34:28,652 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-12-13 17:34:28,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 17:34:28,652 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-12-13 17:34:28,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:34:28,653 INFO L85 PathProgramCache]: Analyzing trace with hash 91290941, now seen corresponding path program 1 times [2022-12-13 17:34:28,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:34:28,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240346709] [2022-12-13 17:34:28,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:34:28,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:34:28,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:34:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:34:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,683 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-12-13 17:34:28,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:34:28,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240346709] [2022-12-13 17:34:28,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240346709] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:34:28,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:34:28,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:34:28,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904136945] [2022-12-13 17:34:28,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:34:28,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:34:28,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:34:28,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:34:28,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:34:28,685 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-12-13 17:34:28,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:34:28,691 INFO L93 Difference]: Finished difference Result 89 states and 113 transitions. [2022-12-13 17:34:28,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:34:28,692 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-12-13 17:34:28,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:34:28,693 INFO L225 Difference]: With dead ends: 89 [2022-12-13 17:34:28,693 INFO L226 Difference]: Without dead ends: 53 [2022-12-13 17:34:28,694 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-12-13 17:34:28,695 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-12-13 17:34:28,695 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-12-13 17:34:28,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-12-13 17:34:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-12-13 17:34:28,698 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-12-13 17:34:28,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2022-12-13 17:34:28,699 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 33 [2022-12-13 17:34:28,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:34:28,699 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2022-12-13 17:34:28,699 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-12-13 17:34:28,699 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2022-12-13 17:34:28,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 17:34:28,700 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:34:28,700 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-12-13 17:34:28,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 17:34:28,700 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-12-13 17:34:28,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:34:28,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1997145350, now seen corresponding path program 1 times [2022-12-13 17:34:28,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:34:28,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917006604] [2022-12-13 17:34:28,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:34:28,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:34:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:34:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:34:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 17:34:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:34:28,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:34:28,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917006604] [2022-12-13 17:34:28,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917006604] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:34:28,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:34:28,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:34:28,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38675380] [2022-12-13 17:34:28,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:34:28,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:34:28,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:34:28,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:34:28,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:34:28,749 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-12-13 17:34:28,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:34:28,765 INFO L93 Difference]: Finished difference Result 91 states and 112 transitions. [2022-12-13 17:34:28,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:34:28,765 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-12-13 17:34:28,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:34:28,766 INFO L225 Difference]: With dead ends: 91 [2022-12-13 17:34:28,766 INFO L226 Difference]: Without dead ends: 73 [2022-12-13 17:34:28,767 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-12-13 17:34:28,768 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-12-13 17:34:28,768 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-12-13 17:34:28,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-12-13 17:34:28,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 58. [2022-12-13 17:34:28,773 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-12-13 17:34:28,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2022-12-13 17:34:28,774 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 39 [2022-12-13 17:34:28,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:34:28,775 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2022-12-13 17:34:28,775 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-12-13 17:34:28,775 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-12-13 17:34:28,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-12-13 17:34:28,776 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:34:28,776 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-12-13 17:34:28,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 17:34:28,776 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-12-13 17:34:28,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:34:28,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1995298308, now seen corresponding path program 1 times [2022-12-13 17:34:28,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:34:28,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627816004] [2022-12-13 17:34:28,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:34:28,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:34:28,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:34:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:34:28,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 17:34:28,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:34:28,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:34:28,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627816004] [2022-12-13 17:34:28,822 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627816004] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:34:28,822 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:34:28,823 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:34:28,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091643758] [2022-12-13 17:34:28,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:34:28,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:34:28,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:34:28,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:34:28,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:34:28,824 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-12-13 17:34:28,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:34:28,832 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2022-12-13 17:34:28,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:34:28,832 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-12-13 17:34:28,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:34:28,833 INFO L225 Difference]: With dead ends: 87 [2022-12-13 17:34:28,833 INFO L226 Difference]: Without dead ends: 58 [2022-12-13 17:34:28,834 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-12-13 17:34:28,834 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-12-13 17:34:28,835 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-12-13 17:34:28,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-12-13 17:34:28,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2022-12-13 17:34:28,839 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-12-13 17:34:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2022-12-13 17:34:28,840 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 39 [2022-12-13 17:34:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:34:28,841 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2022-12-13 17:34:28,841 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-12-13 17:34:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-12-13 17:34:28,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-12-13 17:34:28,842 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:34:28,842 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-12-13 17:34:28,842 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 17:34:28,842 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-12-13 17:34:28,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:34:28,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1519209323, now seen corresponding path program 1 times [2022-12-13 17:34:28,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:34:28,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170055622] [2022-12-13 17:34:28,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:34:28,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:34:28,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:34:28,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:34:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 17:34:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-12-13 17:34:28,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,892 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-12-13 17:34:28,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:34:28,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170055622] [2022-12-13 17:34:28,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170055622] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:34:28,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:34:28,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:34:28,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815858407] [2022-12-13 17:34:28,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:34:28,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:34:28,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:34:28,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:34:28,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:34:28,894 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-12-13 17:34:28,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:34:28,901 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2022-12-13 17:34:28,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:34:28,901 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-12-13 17:34:28,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:34:28,902 INFO L225 Difference]: With dead ends: 80 [2022-12-13 17:34:28,902 INFO L226 Difference]: Without dead ends: 50 [2022-12-13 17:34:28,902 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-12-13 17:34:28,903 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-12-13 17:34:28,903 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-12-13 17:34:28,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-12-13 17:34:28,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-12-13 17:34:28,907 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-12-13 17:34:28,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 58 transitions. [2022-12-13 17:34:28,908 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 58 transitions. Word has length 43 [2022-12-13 17:34:28,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:34:28,908 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 58 transitions. [2022-12-13 17:34:28,909 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-12-13 17:34:28,909 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 58 transitions. [2022-12-13 17:34:28,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-12-13 17:34:28,910 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:34:28,910 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-12-13 17:34:28,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 17:34:28,911 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-12-13 17:34:28,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:34:28,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1151157231, now seen corresponding path program 1 times [2022-12-13 17:34:28,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:34:28,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404755526] [2022-12-13 17:34:28,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:34:28,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:34:28,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:34:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:34:28,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 17:34:28,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:34:28,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:34:28,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404755526] [2022-12-13 17:34:28,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404755526] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:34:28,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:34:28,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:34:28,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838408394] [2022-12-13 17:34:28,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:34:28,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:34:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:34:28,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:34:28,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:34:28,950 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-12-13 17:34:28,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:34:28,954 INFO L93 Difference]: Finished difference Result 66 states and 76 transitions. [2022-12-13 17:34:28,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:34:28,955 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-12-13 17:34:28,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:34:28,955 INFO L225 Difference]: With dead ends: 66 [2022-12-13 17:34:28,955 INFO L226 Difference]: Without dead ends: 48 [2022-12-13 17:34:28,956 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-12-13 17:34:28,956 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-12-13 17:34:28,956 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-12-13 17:34:28,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-12-13 17:34:28,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-12-13 17:34:28,958 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-12-13 17:34:28,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-12-13 17:34:28,959 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 45 [2022-12-13 17:34:28,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:34:28,959 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-12-13 17:34:28,959 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-12-13 17:34:28,959 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-12-13 17:34:28,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-12-13 17:34:28,959 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:34:28,960 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-12-13 17:34:28,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 17:34:28,960 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-12-13 17:34:28,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:34:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1850334672, now seen corresponding path program 1 times [2022-12-13 17:34:28,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:34:28,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269036005] [2022-12-13 17:34:28,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:34:28,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:34:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:34:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:28,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:34:28,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:29,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 17:34:29,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:29,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 17:34:29,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:34:29,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:34:29,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269036005] [2022-12-13 17:34:29,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269036005] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:34:29,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:34:29,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 17:34:29,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733596338] [2022-12-13 17:34:29,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:34:29,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:34:29,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:34:29,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:34:29,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:34:29,006 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-12-13 17:34:29,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:34:29,017 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2022-12-13 17:34:29,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:34:29,017 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-12-13 17:34:29,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:34:29,018 INFO L225 Difference]: With dead ends: 55 [2022-12-13 17:34:29,018 INFO L226 Difference]: Without dead ends: 48 [2022-12-13 17:34:29,018 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-12-13 17:34:29,019 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-12-13 17:34:29,019 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-12-13 17:34:29,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-12-13 17:34:29,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2022-12-13 17:34:29,021 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-12-13 17:34:29,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-12-13 17:34:29,022 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 51 [2022-12-13 17:34:29,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:34:29,022 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-12-13 17:34:29,022 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-12-13 17:34:29,022 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-12-13 17:34:29,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 17:34:29,023 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 17:34:29,023 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-12-13 17:34:29,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 17:34:29,023 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-12-13 17:34:29,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 17:34:29,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1470480846, now seen corresponding path program 1 times [2022-12-13 17:34:29,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 17:34:29,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999216568] [2022-12-13 17:34:29,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 17:34:29,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 17:34:29,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:29,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 17:34:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-12-13 17:34:29,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:29,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-12-13 17:34:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:29,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-12-13 17:34:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 17:34:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-12-13 17:34:29,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 17:34:29,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999216568] [2022-12-13 17:34:29,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999216568] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 17:34:29,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 17:34:29,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 17:34:29,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917761460] [2022-12-13 17:34:29,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 17:34:29,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 17:34:29,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 17:34:29,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 17:34:29,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 17:34:29,058 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-12-13 17:34:29,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 17:34:29,060 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-12-13 17:34:29,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 17:34:29,060 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-12-13 17:34:29,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 17:34:29,060 INFO L225 Difference]: With dead ends: 52 [2022-12-13 17:34:29,061 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 17:34:29,061 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-12-13 17:34:29,061 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-12-13 17:34:29,061 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-12-13 17:34:29,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 17:34:29,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 17:34:29,062 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-12-13 17:34:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 17:34:29,062 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-12-13 17:34:29,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 17:34:29,062 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 17:34:29,062 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-12-13 17:34:29,062 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 17:34:29,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 17:34:29,064 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 8 remaining) [2022-12-13 17:34:29,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 8 remaining) [2022-12-13 17:34:29,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 8 remaining) [2022-12-13 17:34:29,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 8 remaining) [2022-12-13 17:34:29,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 8 remaining) [2022-12-13 17:34:29,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 8 remaining) [2022-12-13 17:34:29,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 8 remaining) [2022-12-13 17:34:29,065 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 8 remaining) [2022-12-13 17:34:29,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 17:34:29,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 17:34:29,114 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1412 1418) the Hoare annotation is: true [2022-12-13 17:34:29,114 INFO L899 garLoopResultBuilder]: For program point printLineEXIT(lines 1412 1418) no Hoare annotation was computed. [2022-12-13 17:34:29,114 INFO L899 garLoopResultBuilder]: For program point L1414(lines 1414 1417) no Hoare annotation was computed. [2022-12-13 17:34:29,114 INFO L899 garLoopResultBuilder]: For program point L1414-2(lines 1412 1418) no Hoare annotation was computed. [2022-12-13 17:34:29,114 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 1426 1429) the Hoare annotation is: true [2022-12-13 17:34:29,115 INFO L899 garLoopResultBuilder]: For program point printIntLineEXIT(lines 1426 1429) no Hoare annotation was computed. [2022-12-13 17:34:29,115 INFO L899 garLoopResultBuilder]: For program point printIntLineFINAL(lines 1426 1429) no Hoare annotation was computed. [2022-12-13 17:34:29,115 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2022-12-13 17:34:29,115 INFO L902 garLoopResultBuilder]: At program point L1662(line 1662) the Hoare annotation is: true [2022-12-13 17:34:29,115 INFO L895 garLoopResultBuilder]: At program point L1629(lines 1629 1641) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch97#1| [2022-12-13 17:34:29,115 INFO L899 garLoopResultBuilder]: For program point L1563(line 1563) no Hoare annotation was computed. [2022-12-13 17:34:29,115 INFO L899 garLoopResultBuilder]: For program point L1588(line 1588) no Hoare annotation was computed. [2022-12-13 17:34:29,115 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 1677 1684) the Hoare annotation is: true [2022-12-13 17:34:29,115 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-12-13 17:34:29,115 INFO L899 garLoopResultBuilder]: For program point L1638(line 1638) no Hoare annotation was computed. [2022-12-13 17:34:29,115 INFO L895 garLoopResultBuilder]: At program point L1572(line 1572) the Hoare annotation is: false [2022-12-13 17:34:29,116 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2022-12-13 17:34:29,116 INFO L899 garLoopResultBuilder]: For program point L1597(line 1597) no Hoare annotation was computed. [2022-12-13 17:34:29,116 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 17:34:29,116 INFO L895 garLoopResultBuilder]: At program point L1564(line 1564) the Hoare annotation is: false [2022-12-13 17:34:29,116 INFO L899 garLoopResultBuilder]: For program point L1622(line 1622) no Hoare annotation was computed. [2022-12-13 17:34:29,116 INFO L902 garLoopResultBuilder]: At program point L1680(line 1680) the Hoare annotation is: true [2022-12-13 17:34:29,116 INFO L899 garLoopResultBuilder]: For program point L1680-1(line 1680) no Hoare annotation was computed. [2022-12-13 17:34:29,116 INFO L895 garLoopResultBuilder]: At program point L1647(lines 1647 1655) the Hoare annotation is: (= |ULTIMATE.start_goodG2B2_~data~3#1| 2) [2022-12-13 17:34:29,116 INFO L899 garLoopResultBuilder]: For program point L1548(lines 1548 1581) no Hoare annotation was computed. [2022-12-13 17:34:29,116 INFO L895 garLoopResultBuilder]: At program point L1639(line 1639) the Hoare annotation is: false [2022-12-13 17:34:29,116 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1571) no Hoare annotation was computed. [2022-12-13 17:34:29,116 INFO L899 garLoopResultBuilder]: For program point L1631(line 1631) no Hoare annotation was computed. [2022-12-13 17:34:29,116 INFO L899 garLoopResultBuilder]: For program point L1598(lines 1598 1609) no Hoare annotation was computed. [2022-12-13 17:34:29,116 INFO L902 garLoopResultBuilder]: At program point L1656(lines 1656 1668) the Hoare annotation is: true [2022-12-13 17:34:29,116 INFO L895 garLoopResultBuilder]: At program point L1623(line 1623) the Hoare annotation is: false [2022-12-13 17:34:29,116 INFO L899 garLoopResultBuilder]: For program point L1557(line 1557) no Hoare annotation was computed. [2022-12-13 17:34:29,117 INFO L899 garLoopResultBuilder]: For program point L1582(lines 1582 1615) no Hoare annotation was computed. [2022-12-13 17:34:29,117 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 17:34:29,117 INFO L895 garLoopResultBuilder]: At program point L1607(line 1607) the Hoare annotation is: |ULTIMATE.start_goodB2G2_#t~switch95#1| [2022-12-13 17:34:29,117 INFO L899 garLoopResultBuilder]: For program point L1665(line 1665) no Hoare annotation was computed. [2022-12-13 17:34:29,117 INFO L899 garLoopResultBuilder]: For program point L1632(lines 1632 1636) no Hoare annotation was computed. [2022-12-13 17:34:29,117 INFO L899 garLoopResultBuilder]: For program point L1566(line 1566) no Hoare annotation was computed. [2022-12-13 17:34:29,117 INFO L899 garLoopResultBuilder]: For program point L1591(line 1591) no Hoare annotation was computed. [2022-12-13 17:34:29,117 INFO L895 garLoopResultBuilder]: At program point L1558(line 1558) the Hoare annotation is: false [2022-12-13 17:34:29,117 INFO L902 garLoopResultBuilder]: At program point L1682(line 1682) the Hoare annotation is: true [2022-12-13 17:34:29,117 INFO L899 garLoopResultBuilder]: For program point L1649(line 1649) no Hoare annotation was computed. [2022-12-13 17:34:29,117 INFO L899 garLoopResultBuilder]: For program point L1682-1(line 1682) no Hoare annotation was computed. [2022-12-13 17:34:29,117 INFO L899 garLoopResultBuilder]: For program point L1616(lines 1616 1642) no Hoare annotation was computed. [2022-12-13 17:34:29,117 INFO L902 garLoopResultBuilder]: At program point L1666(line 1666) the Hoare annotation is: true [2022-12-13 17:34:29,117 INFO L899 garLoopResultBuilder]: For program point L1600(lines 1600 1608) no Hoare annotation was computed. [2022-12-13 17:34:29,117 INFO L899 garLoopResultBuilder]: For program point L1567(lines 1567 1578) no Hoare annotation was computed. [2022-12-13 17:34:29,117 INFO L899 garLoopResultBuilder]: For program point L1658(line 1658) no Hoare annotation was computed. [2022-12-13 17:34:29,117 INFO L899 garLoopResultBuilder]: For program point L1625(line 1625) no Hoare annotation was computed. [2022-12-13 17:34:29,117 INFO L895 garLoopResultBuilder]: At program point L1592(line 1592) the Hoare annotation is: false [2022-12-13 17:34:29,117 INFO L895 garLoopResultBuilder]: At program point L1576(line 1576) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch93#1| [2022-12-13 17:34:29,118 INFO L899 garLoopResultBuilder]: For program point L1634(line 1634) no Hoare annotation was computed. [2022-12-13 17:34:29,118 INFO L899 garLoopResultBuilder]: For program point L1634-1(line 1634) no Hoare annotation was computed. [2022-12-13 17:34:29,118 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 17:34:29,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2022-12-13 17:34:29,118 INFO L899 garLoopResultBuilder]: For program point L1659(lines 1659 1663) no Hoare annotation was computed. [2022-12-13 17:34:29,118 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-12-13 17:34:29,118 INFO L899 garLoopResultBuilder]: For program point L1643(lines 1643 1669) no Hoare annotation was computed. [2022-12-13 17:34:29,118 INFO L895 garLoopResultBuilder]: At program point L1635(line 1635) the Hoare annotation is: |ULTIMATE.start_goodG2B1_#t~switch97#1| [2022-12-13 17:34:29,118 INFO L899 garLoopResultBuilder]: For program point L1602(line 1602) no Hoare annotation was computed. [2022-12-13 17:34:29,118 INFO L899 garLoopResultBuilder]: For program point L1569(lines 1569 1577) no Hoare annotation was computed. [2022-12-13 17:34:29,118 INFO L899 garLoopResultBuilder]: For program point L1602-1(line 1602) no Hoare annotation was computed. [2022-12-13 17:34:29,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 17:34:29,118 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1634) no Hoare annotation was computed. [2022-12-13 17:34:29,118 INFO L895 garLoopResultBuilder]: At program point L1561(lines 1561 1580) the Hoare annotation is: |ULTIMATE.start_goodB2G1_#t~switch93#1| [2022-12-13 17:34:29,118 INFO L899 garLoopResultBuilder]: For program point L1652(line 1652) no Hoare annotation was computed. [2022-12-13 17:34:29,118 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-12-13 17:34:29,118 INFO L899 garLoopResultBuilder]: For program point L1611(line 1611) no Hoare annotation was computed. [2022-12-13 17:34:29,119 INFO L895 garLoopResultBuilder]: At program point L1603(line 1603) the Hoare annotation is: false [2022-12-13 17:34:29,119 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1602) no Hoare annotation was computed. [2022-12-13 17:34:29,119 INFO L899 garLoopResultBuilder]: For program point L1661(line 1661) no Hoare annotation was computed. [2022-12-13 17:34:29,119 INFO L899 garLoopResultBuilder]: For program point L1661-1(line 1661) no Hoare annotation was computed. [2022-12-13 17:34:29,119 INFO L895 garLoopResultBuilder]: At program point L1595(lines 1595 1614) the Hoare annotation is: |ULTIMATE.start_goodB2G2_#t~switch95#1| [2022-12-13 17:34:29,119 INFO L895 garLoopResultBuilder]: At program point L1653(line 1653) the Hoare annotation is: false [2022-12-13 17:34:29,119 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-12-13 17:34:29,119 INFO L899 garLoopResultBuilder]: For program point L1554(line 1554) no Hoare annotation was computed. [2022-12-13 17:34:29,119 INFO L895 garLoopResultBuilder]: At program point L1612(line 1612) the Hoare annotation is: false [2022-12-13 17:34:29,119 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1661) no Hoare annotation was computed. [2022-12-13 17:34:29,119 INFO L899 garLoopResultBuilder]: For program point L1670(lines 1670 1676) no Hoare annotation was computed. [2022-12-13 17:34:29,119 INFO L899 garLoopResultBuilder]: For program point L1571(line 1571) no Hoare annotation was computed. [2022-12-13 17:34:29,119 INFO L899 garLoopResultBuilder]: For program point L1571-1(line 1571) no Hoare annotation was computed. [2022-12-13 17:34:29,122 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 17:34:29,123 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 17:34:29,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 05:34:29 BoogieIcfgContainer [2022-12-13 17:34:29,134 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 17:34:29,134 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 17:34:29,134 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 17:34:29,134 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 17:34:29,135 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 05:34:27" (3/4) ... [2022-12-13 17:34:29,137 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 17:34:29,142 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printLine [2022-12-13 17:34:29,142 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure printIntLine [2022-12-13 17:34:29,145 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2022-12-13 17:34:29,145 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-12-13 17:34:29,146 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-12-13 17:34:29,146 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 17:34:29,146 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 17:34:29,175 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 17:34:29,175 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 17:34:29,175 INFO L158 Benchmark]: Toolchain (without parser) took 2476.72ms. Allocated memory was 119.5MB in the beginning and 146.8MB in the end (delta: 27.3MB). Free memory was 79.4MB in the beginning and 63.9MB in the end (delta: 15.5MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2022-12-13 17:34:29,175 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 119.5MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:34:29,176 INFO L158 Benchmark]: CACSL2BoogieTranslator took 810.94ms. Allocated memory was 119.5MB in the beginning and 146.8MB in the end (delta: 27.3MB). Free memory was 79.4MB in the beginning and 84.2MB in the end (delta: -4.8MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. [2022-12-13 17:34:29,176 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.85ms. Allocated memory is still 146.8MB. Free memory was 84.2MB in the beginning and 81.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:34:29,176 INFO L158 Benchmark]: Boogie Preprocessor took 17.82ms. Allocated memory is still 146.8MB. Free memory was 81.5MB in the beginning and 79.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 17:34:29,176 INFO L158 Benchmark]: RCFGBuilder took 340.05ms. Allocated memory is still 146.8MB. Free memory was 79.4MB in the beginning and 63.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-12-13 17:34:29,176 INFO L158 Benchmark]: TraceAbstraction took 1224.49ms. Allocated memory is still 146.8MB. Free memory was 63.2MB in the beginning and 69.2MB in the end (delta: -5.9MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 17:34:29,176 INFO L158 Benchmark]: Witness Printer took 40.52ms. Allocated memory is still 146.8MB. Free memory was 69.2MB in the beginning and 63.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 17:34:29,177 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.11ms. Allocated memory is still 119.5MB. Free memory is still 95.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 810.94ms. Allocated memory was 119.5MB in the beginning and 146.8MB in the end (delta: 27.3MB). Free memory was 79.4MB in the beginning and 84.2MB in the end (delta: -4.8MB). Peak memory consumption was 45.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.85ms. Allocated memory is still 146.8MB. Free memory was 84.2MB in the beginning and 81.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.82ms. Allocated memory is still 146.8MB. Free memory was 81.5MB in the beginning and 79.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 340.05ms. Allocated memory is still 146.8MB. Free memory was 79.4MB in the beginning and 63.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1224.49ms. Allocated memory is still 146.8MB. Free memory was 63.2MB in the beginning and 69.2MB in the end (delta: -5.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 40.52ms. Allocated memory is still 146.8MB. Free memory was 69.2MB in the beginning and 63.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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: 1.2s, OverallIterations: 13, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, 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, 0.5s 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: 1677]: Loop Invariant Derived loop invariant: 1 - 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 RESULT: Ultimate proved your program to be correct! [2022-12-13 17:34:29,191 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a8c0f053-009c-4d2e-8845-fb1ab61e4091/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE