./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/busybox-1.22.0/hostid_true-no-overflow_true-valid-memsafety.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9108c249-f630-4ad8-a5a6-cded2f03687a/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9108c249-f630-4ad8-a5a6-cded2f03687a/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9108c249-f630-4ad8-a5a6-cded2f03687a/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9108c249-f630-4ad8-a5a6-cded2f03687a/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/busybox-1.22.0/hostid_true-no-overflow_true-valid-memsafety.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9108c249-f630-4ad8-a5a6-cded2f03687a/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9108c249-f630-4ad8-a5a6-cded2f03687a/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 8604245f5a4dee50703be8e530b281b92acb588c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 14:41:55,268 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 14:41:55,269 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 14:41:55,278 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 14:41:55,278 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 14:41:55,279 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 14:41:55,279 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 14:41:55,281 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 14:41:55,282 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 14:41:55,282 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 14:41:55,283 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 14:41:55,283 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 14:41:55,284 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 14:41:55,285 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 14:41:55,285 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 14:41:55,286 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 14:41:55,286 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 14:41:55,287 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 14:41:55,288 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 14:41:55,288 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 14:41:55,289 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 14:41:55,290 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 14:41:55,291 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 14:41:55,291 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 14:41:55,291 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 14:41:55,291 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 14:41:55,292 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 14:41:55,292 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 14:41:55,293 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 14:41:55,293 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 14:41:55,293 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 14:41:55,294 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 14:41:55,294 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 14:41:55,294 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 14:41:55,294 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 14:41:55,294 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 14:41:55,295 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9108c249-f630-4ad8-a5a6-cded2f03687a/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-12-08 14:41:55,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 14:41:55,302 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 14:41:55,302 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 14:41:55,303 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 14:41:55,303 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 14:41:55,303 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 14:41:55,303 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 14:41:55,303 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 14:41:55,303 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 14:41:55,303 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 14:41:55,303 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 14:41:55,303 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 14:41:55,303 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 14:41:55,304 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 14:41:55,304 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 14:41:55,304 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 14:41:55,304 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 14:41:55,304 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 14:41:55,304 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 14:41:55,304 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 14:41:55,304 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-08 14:41:55,304 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 14:41:55,304 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 14:41:55,304 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 14:41:55,305 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 14:41:55,305 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 14:41:55,305 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 14:41:55,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 14:41:55,305 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 14:41:55,305 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 14:41:55,305 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 14:41:55,305 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 14:41:55,305 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 14:41:55,305 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 14:41:55,305 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 14:41:55,305 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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-vcloud-master/worker/working_dir_9108c249-f630-4ad8-a5a6-cded2f03687a/bin-2019/utaipan 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 -> Taipan 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 -> 8604245f5a4dee50703be8e530b281b92acb588c [2018-12-08 14:41:55,323 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 14:41:55,330 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 14:41:55,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 14:41:55,333 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 14:41:55,333 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 14:41:55,334 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9108c249-f630-4ad8-a5a6-cded2f03687a/bin-2019/utaipan/../../sv-benchmarks/c/busybox-1.22.0/hostid_true-no-overflow_true-valid-memsafety.i [2018-12-08 14:41:55,369 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9108c249-f630-4ad8-a5a6-cded2f03687a/bin-2019/utaipan/data/f99ec70b7/f0765de877af4c86b83052df7c41eb9c/FLAG3719a092d [2018-12-08 14:41:55,822 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 14:41:55,823 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9108c249-f630-4ad8-a5a6-cded2f03687a/sv-benchmarks/c/busybox-1.22.0/hostid_true-no-overflow_true-valid-memsafety.i [2018-12-08 14:41:55,833 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9108c249-f630-4ad8-a5a6-cded2f03687a/bin-2019/utaipan/data/f99ec70b7/f0765de877af4c86b83052df7c41eb9c/FLAG3719a092d [2018-12-08 14:41:55,841 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9108c249-f630-4ad8-a5a6-cded2f03687a/bin-2019/utaipan/data/f99ec70b7/f0765de877af4c86b83052df7c41eb9c [2018-12-08 14:41:55,843 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 14:41:55,844 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 14:41:55,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 14:41:55,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 14:41:55,847 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 14:41:55,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:41:55" (1/1) ... [2018-12-08 14:41:55,849 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7fe5a900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:41:55, skipping insertion in model container [2018-12-08 14:41:55,849 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 02:41:55" (1/1) ... [2018-12-08 14:41:55,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 14:41:55,883 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 14:41:56,392 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:41:56,409 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 14:41:56,458 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 14:41:56,624 INFO L195 MainTranslator]: Completed translation [2018-12-08 14:41:56,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:41:56 WrapperNode [2018-12-08 14:41:56,625 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 14:41:56,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 14:41:56,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 14:41:56,625 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 14:41:56,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:41:56" (1/1) ... [2018-12-08 14:41:56,656 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:41:56" (1/1) ... [2018-12-08 14:41:56,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 14:41:56,668 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 14:41:56,668 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 14:41:56,668 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 14:41:56,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:41:56" (1/1) ... [2018-12-08 14:41:56,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:41:56" (1/1) ... [2018-12-08 14:41:56,680 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:41:56" (1/1) ... [2018-12-08 14:41:56,680 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:41:56" (1/1) ... [2018-12-08 14:41:56,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:41:56" (1/1) ... [2018-12-08 14:41:56,706 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:41:56" (1/1) ... [2018-12-08 14:41:56,709 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:41:56" (1/1) ... [2018-12-08 14:41:56,713 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 14:41:56,714 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 14:41:56,714 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 14:41:56,714 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 14:41:56,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:41:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9108c249-f630-4ad8-a5a6-cded2f03687a/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 14:41:56,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 14:41:56,747 INFO L130 BoogieDeclarations]: Found specification of procedure gethostid [2018-12-08 14:41:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure gethostid [2018-12-08 14:41:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 14:41:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2018-12-08 14:41:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 14:41:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 14:41:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-12-08 14:41:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 14:41:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 14:41:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure __main [2018-12-08 14:41:56,748 INFO L138 BoogieDeclarations]: Found implementation of procedure __main [2018-12-08 14:41:56,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 14:41:56,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 14:41:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-12-08 14:41:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure fflush_all [2018-12-08 14:41:56,749 INFO L138 BoogieDeclarations]: Found implementation of procedure fflush_all [2018-12-08 14:41:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure bb_show_usage [2018-12-08 14:41:56,749 INFO L138 BoogieDeclarations]: Found implementation of procedure bb_show_usage [2018-12-08 14:41:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 14:41:56,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2018-12-08 14:41:57,121 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 14:41:57,121 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-08 14:41:57,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:41:57 BoogieIcfgContainer [2018-12-08 14:41:57,122 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 14:41:57,123 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 14:41:57,123 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 14:41:57,125 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 14:41:57,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 02:41:55" (1/3) ... [2018-12-08 14:41:57,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673dde14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 02:41:57, skipping insertion in model container [2018-12-08 14:41:57,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 02:41:56" (2/3) ... [2018-12-08 14:41:57,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@673dde14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 02:41:57, skipping insertion in model container [2018-12-08 14:41:57,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:41:57" (3/3) ... [2018-12-08 14:41:57,127 INFO L112 eAbstractionObserver]: Analyzing ICFG hostid_true-no-overflow_true-valid-memsafety.i [2018-12-08 14:41:57,134 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 14:41:57,139 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 16 error locations. [2018-12-08 14:41:57,148 INFO L257 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2018-12-08 14:41:57,168 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 14:41:57,168 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 14:41:57,168 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 14:41:57,168 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 14:41:57,168 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 14:41:57,168 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 14:41:57,168 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 14:41:57,169 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 14:41:57,180 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states. [2018-12-08 14:41:57,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-08 14:41:57,183 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:41:57,184 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:57,185 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 14:41:57,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:57,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1226623057, now seen corresponding path program 1 times [2018-12-08 14:41:57,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:41:57,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:57,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:57,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:57,250 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:41:57,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:57,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:41:57,403 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:41:57,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:41:57,403 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:41:57,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:41:57,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:41:57,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:57,415 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 3 states. [2018-12-08 14:41:57,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:57,445 INFO L93 Difference]: Finished difference Result 126 states and 142 transitions. [2018-12-08 14:41:57,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:41:57,446 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-08 14:41:57,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:41:57,452 INFO L225 Difference]: With dead ends: 126 [2018-12-08 14:41:57,452 INFO L226 Difference]: Without dead ends: 63 [2018-12-08 14:41:57,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:57,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-12-08 14:41:57,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-12-08 14:41:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-12-08 14:41:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2018-12-08 14:41:57,479 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 8 [2018-12-08 14:41:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:41:57,479 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2018-12-08 14:41:57,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:41:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2018-12-08 14:41:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-08 14:41:57,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:41:57,480 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:57,481 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 14:41:57,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:57,481 INFO L82 PathProgramCache]: Analyzing trace with hash -629390849, now seen corresponding path program 1 times [2018-12-08 14:41:57,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:41:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:57,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:57,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:57,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:41:57,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:57,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:41:57,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:41:57,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:41:57,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:41:57,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:41:57,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:41:57,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:57,556 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 3 states. [2018-12-08 14:41:57,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:57,577 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2018-12-08 14:41:57,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:41:57,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-08 14:41:57,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:41:57,579 INFO L225 Difference]: With dead ends: 66 [2018-12-08 14:41:57,579 INFO L226 Difference]: Without dead ends: 65 [2018-12-08 14:41:57,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:57,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-08 14:41:57,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-08 14:41:57,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-08 14:41:57,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2018-12-08 14:41:57,585 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 9 [2018-12-08 14:41:57,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:41:57,586 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2018-12-08 14:41:57,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:41:57,586 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2018-12-08 14:41:57,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 14:41:57,586 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:41:57,586 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:57,587 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 14:41:57,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:57,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1644472844, now seen corresponding path program 1 times [2018-12-08 14:41:57,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:41:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:57,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:57,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:57,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:41:57,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:41:57,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:41:57,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:41:57,659 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:41:57,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:41:57,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:41:57,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:57,660 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 3 states. [2018-12-08 14:41:57,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:57,698 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2018-12-08 14:41:57,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:41:57,698 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-08 14:41:57,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:41:57,699 INFO L225 Difference]: With dead ends: 65 [2018-12-08 14:41:57,699 INFO L226 Difference]: Without dead ends: 61 [2018-12-08 14:41:57,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-12-08 14:41:57,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-12-08 14:41:57,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-12-08 14:41:57,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-12-08 14:41:57,702 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 12 [2018-12-08 14:41:57,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:41:57,703 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-12-08 14:41:57,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:41:57,703 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-12-08 14:41:57,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-08 14:41:57,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:41:57,703 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:57,703 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 14:41:57,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:57,704 INFO L82 PathProgramCache]: Analyzing trace with hash 1644474574, now seen corresponding path program 1 times [2018-12-08 14:41:57,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:41:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:57,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:57,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:57,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:41:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:57,750 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 14:41:57,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:41:57,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:41:57,750 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:41:57,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:41:57,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:41:57,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:57,751 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 3 states. [2018-12-08 14:41:57,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:57,763 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-12-08 14:41:57,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:41:57,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-08 14:41:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:41:57,765 INFO L225 Difference]: With dead ends: 61 [2018-12-08 14:41:57,765 INFO L226 Difference]: Without dead ends: 60 [2018-12-08 14:41:57,765 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:57,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-12-08 14:41:57,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-12-08 14:41:57,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-12-08 14:41:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-12-08 14:41:57,770 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 12 [2018-12-08 14:41:57,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:41:57,770 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-12-08 14:41:57,770 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:41:57,771 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-12-08 14:41:57,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 14:41:57,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:41:57,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:57,771 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 14:41:57,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:57,772 INFO L82 PathProgramCache]: Analyzing trace with hash -560949332, now seen corresponding path program 1 times [2018-12-08 14:41:57,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:41:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:57,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:57,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:57,780 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:41:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:57,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:41:57,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:41:57,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:41:57,833 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:41:57,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:41:57,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:41:57,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:57,834 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 3 states. [2018-12-08 14:41:57,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:57,868 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-12-08 14:41:57,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:41:57,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 14:41:57,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:41:57,869 INFO L225 Difference]: With dead ends: 58 [2018-12-08 14:41:57,869 INFO L226 Difference]: Without dead ends: 56 [2018-12-08 14:41:57,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:57,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-08 14:41:57,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2018-12-08 14:41:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-08 14:41:57,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-12-08 14:41:57,874 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 13 [2018-12-08 14:41:57,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:41:57,874 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-12-08 14:41:57,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:41:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-12-08 14:41:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-08 14:41:57,875 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:41:57,875 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:57,875 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 14:41:57,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:57,875 INFO L82 PathProgramCache]: Analyzing trace with hash 2093573102, now seen corresponding path program 1 times [2018-12-08 14:41:57,876 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:41:57,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:57,883 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:57,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:57,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:41:57,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:57,946 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:41:57,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:41:57,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:41:57,946 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:41:57,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:41:57,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:41:57,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:57,947 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 3 states. [2018-12-08 14:41:57,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:57,976 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-12-08 14:41:57,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:41:57,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-08 14:41:57,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:41:57,977 INFO L225 Difference]: With dead ends: 56 [2018-12-08 14:41:57,978 INFO L226 Difference]: Without dead ends: 54 [2018-12-08 14:41:57,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:57,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-12-08 14:41:57,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-12-08 14:41:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-08 14:41:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-12-08 14:41:57,982 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 15 [2018-12-08 14:41:57,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:41:57,982 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-12-08 14:41:57,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:41:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-12-08 14:41:57,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-08 14:41:57,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:41:57,983 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:57,984 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 14:41:57,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:57,984 INFO L82 PathProgramCache]: Analyzing trace with hash 662935014, now seen corresponding path program 1 times [2018-12-08 14:41:57,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:41:57,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:57,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:57,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:57,991 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:41:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:58,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:41:58,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:41:58,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 14:41:58,037 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:41:58,037 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:41:58,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:41:58,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:58,038 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 3 states. [2018-12-08 14:41:58,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:58,058 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2018-12-08 14:41:58,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:41:58,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-08 14:41:58,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:41:58,059 INFO L225 Difference]: With dead ends: 92 [2018-12-08 14:41:58,060 INFO L226 Difference]: Without dead ends: 57 [2018-12-08 14:41:58,060 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:58,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-08 14:41:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-08 14:41:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-08 14:41:58,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 61 transitions. [2018-12-08 14:41:58,063 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 61 transitions. Word has length 22 [2018-12-08 14:41:58,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:41:58,063 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 61 transitions. [2018-12-08 14:41:58,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:41:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 61 transitions. [2018-12-08 14:41:58,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 14:41:58,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:41:58,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:58,065 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 14:41:58,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:58,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1239101736, now seen corresponding path program 1 times [2018-12-08 14:41:58,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:41:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:58,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:41:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:58,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 14:41:58,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:41:58,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 14:41:58,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:41:58,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 14:41:58,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 14:41:58,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 14:41:58,132 INFO L87 Difference]: Start difference. First operand 57 states and 61 transitions. Second operand 4 states. [2018-12-08 14:41:58,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:58,192 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2018-12-08 14:41:58,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 14:41:58,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-12-08 14:41:58,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:41:58,193 INFO L225 Difference]: With dead ends: 65 [2018-12-08 14:41:58,193 INFO L226 Difference]: Without dead ends: 64 [2018-12-08 14:41:58,193 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 14:41:58,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-12-08 14:41:58,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 56. [2018-12-08 14:41:58,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-12-08 14:41:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-12-08 14:41:58,199 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 25 [2018-12-08 14:41:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:41:58,200 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-12-08 14:41:58,200 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 14:41:58,200 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-12-08 14:41:58,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-08 14:41:58,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:41:58,200 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:58,200 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 14:41:58,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:58,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1239101791, now seen corresponding path program 1 times [2018-12-08 14:41:58,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:41:58,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,205 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:58,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:41:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 14:41:58,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:41:58,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:41:58,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:41:58,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:41:58,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:41:58,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:58,247 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 3 states. [2018-12-08 14:41:58,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:58,261 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-12-08 14:41:58,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:41:58,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-08 14:41:58,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:41:58,262 INFO L225 Difference]: With dead ends: 56 [2018-12-08 14:41:58,263 INFO L226 Difference]: Without dead ends: 55 [2018-12-08 14:41:58,263 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:58,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-08 14:41:58,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-12-08 14:41:58,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-12-08 14:41:58,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2018-12-08 14:41:58,267 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 25 [2018-12-08 14:41:58,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:41:58,267 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2018-12-08 14:41:58,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:41:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2018-12-08 14:41:58,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 14:41:58,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:41:58,268 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:58,268 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 14:41:58,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash -242551752, now seen corresponding path program 1 times [2018-12-08 14:41:58,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:41:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:58,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:41:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:58,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 14:41:58,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:41:58,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:41:58,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:41:58,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:41:58,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:41:58,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:58,321 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 3 states. [2018-12-08 14:41:58,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:58,351 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-12-08 14:41:58,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:41:58,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 14:41:58,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:41:58,352 INFO L225 Difference]: With dead ends: 73 [2018-12-08 14:41:58,352 INFO L226 Difference]: Without dead ends: 72 [2018-12-08 14:41:58,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:58,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-08 14:41:58,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 64. [2018-12-08 14:41:58,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-12-08 14:41:58,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 71 transitions. [2018-12-08 14:41:58,357 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 71 transitions. Word has length 26 [2018-12-08 14:41:58,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:41:58,357 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 71 transitions. [2018-12-08 14:41:58,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:41:58,357 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 71 transitions. [2018-12-08 14:41:58,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 14:41:58,358 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:41:58,358 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:58,358 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 14:41:58,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:58,359 INFO L82 PathProgramCache]: Analyzing trace with hash -242550054, now seen corresponding path program 1 times [2018-12-08 14:41:58,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:41:58,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:58,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,366 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:41:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:41:58,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:41:58,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:41:58,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:41:58,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:41:58,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:41:58,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:58,416 INFO L87 Difference]: Start difference. First operand 64 states and 71 transitions. Second operand 3 states. [2018-12-08 14:41:58,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:58,431 INFO L93 Difference]: Finished difference Result 71 states and 79 transitions. [2018-12-08 14:41:58,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:41:58,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 14:41:58,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:41:58,432 INFO L225 Difference]: With dead ends: 71 [2018-12-08 14:41:58,432 INFO L226 Difference]: Without dead ends: 70 [2018-12-08 14:41:58,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:58,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-12-08 14:41:58,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2018-12-08 14:41:58,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-08 14:41:58,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 65 transitions. [2018-12-08 14:41:58,436 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 65 transitions. Word has length 26 [2018-12-08 14:41:58,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:41:58,437 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 65 transitions. [2018-12-08 14:41:58,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:41:58,437 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2018-12-08 14:41:58,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-08 14:41:58,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:41:58,437 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:58,438 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 14:41:58,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:58,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1075791438, now seen corresponding path program 1 times [2018-12-08 14:41:58,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:41:58,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:58,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,445 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:41:58,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:58,513 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 14:41:58,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:41:58,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:41:58,513 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:41:58,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:41:58,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:41:58,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:58,514 INFO L87 Difference]: Start difference. First operand 59 states and 65 transitions. Second operand 3 states. [2018-12-08 14:41:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:58,531 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2018-12-08 14:41:58,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:41:58,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-08 14:41:58,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:41:58,532 INFO L225 Difference]: With dead ends: 59 [2018-12-08 14:41:58,532 INFO L226 Difference]: Without dead ends: 58 [2018-12-08 14:41:58,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-12-08 14:41:58,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 51. [2018-12-08 14:41:58,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-12-08 14:41:58,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-12-08 14:41:58,535 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 33 [2018-12-08 14:41:58,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:41:58,535 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-12-08 14:41:58,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:41:58,535 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-12-08 14:41:58,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 14:41:58,536 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:41:58,536 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:58,536 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 14:41:58,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:58,537 INFO L82 PathProgramCache]: Analyzing trace with hash -820159784, now seen corresponding path program 1 times [2018-12-08 14:41:58,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:41:58,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:58,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:41:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:41:58,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:41:58,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 14:41:58,588 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:41:58,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 14:41:58,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 14:41:58,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 14:41:58,589 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand 4 states. [2018-12-08 14:41:58,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:58,635 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2018-12-08 14:41:58,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 14:41:58,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-08 14:41:58,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:41:58,636 INFO L225 Difference]: With dead ends: 52 [2018-12-08 14:41:58,636 INFO L226 Difference]: Without dead ends: 51 [2018-12-08 14:41:58,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 14:41:58,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-12-08 14:41:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-12-08 14:41:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-08 14:41:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-12-08 14:41:58,639 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 39 [2018-12-08 14:41:58,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:41:58,639 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-12-08 14:41:58,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 14:41:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-12-08 14:41:58,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-08 14:41:58,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:41:58,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:58,640 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 14:41:58,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:58,640 INFO L82 PathProgramCache]: Analyzing trace with hash 344850586, now seen corresponding path program 1 times [2018-12-08 14:41:58,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:41:58,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:58,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,644 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:41:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:58,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:41:58,678 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:41:58,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:41:58,678 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:41:58,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:41:58,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:41:58,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:58,678 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 3 states. [2018-12-08 14:41:58,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:58,691 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-12-08 14:41:58,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:41:58,691 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2018-12-08 14:41:58,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:41:58,692 INFO L225 Difference]: With dead ends: 54 [2018-12-08 14:41:58,692 INFO L226 Difference]: Without dead ends: 53 [2018-12-08 14:41:58,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:58,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-08 14:41:58,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-12-08 14:41:58,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-08 14:41:58,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2018-12-08 14:41:58,694 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 40 [2018-12-08 14:41:58,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:41:58,694 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2018-12-08 14:41:58,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:41:58,695 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2018-12-08 14:41:58,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-08 14:41:58,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 14:41:58,695 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 14:41:58,695 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-08 14:41:58,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 14:41:58,695 INFO L82 PathProgramCache]: Analyzing trace with hash -117856171, now seen corresponding path program 1 times [2018-12-08 14:41:58,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 14:41:58,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 14:41:58,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 14:41:58,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 14:41:58,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 14:41:58,733 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 14:41:58,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 14:41:58,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 14:41:58,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 14:41:58,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 14:41:58,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 14:41:58,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:58,734 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 3 states. [2018-12-08 14:41:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 14:41:58,741 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-12-08 14:41:58,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 14:41:58,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2018-12-08 14:41:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 14:41:58,742 INFO L225 Difference]: With dead ends: 53 [2018-12-08 14:41:58,742 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 14:41:58,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 14:41:58,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 14:41:58,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 14:41:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 14:41:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 14:41:58,743 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 43 [2018-12-08 14:41:58,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 14:41:58,743 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 14:41:58,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 14:41:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 14:41:58,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 14:41:58,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 14:41:58,759 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 14:41:58,760 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 14:41:58,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 14:41:58,763 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-08 14:41:58,962 INFO L448 ceAbstractionStarter]: For program point fflush_allFINAL(lines 1757 1762) no Hoare annotation was computed. [2018-12-08 14:41:58,963 INFO L448 ceAbstractionStarter]: For program point fflush_allEXIT(lines 1757 1762) no Hoare annotation was computed. [2018-12-08 14:41:58,963 INFO L451 ceAbstractionStarter]: At program point fflush_allENTRY(lines 1757 1762) the Hoare annotation is: true [2018-12-08 14:41:58,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-08 14:41:58,963 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-08 14:41:58,963 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 14:41:58,963 INFO L448 ceAbstractionStarter]: For program point bb_show_usageEXIT(lines 1753 1756) no Hoare annotation was computed. [2018-12-08 14:41:58,963 INFO L451 ceAbstractionStarter]: At program point bb_show_usageFINAL(lines 1753 1756) the Hoare annotation is: true [2018-12-08 14:41:58,963 INFO L448 ceAbstractionStarter]: For program point __mainFINAL(lines 1766 1776) no Hoare annotation was computed. [2018-12-08 14:41:58,963 INFO L451 ceAbstractionStarter]: At program point __mainENTRY(lines 1766 1776) the Hoare annotation is: true [2018-12-08 14:41:58,964 INFO L451 ceAbstractionStarter]: At program point L1774(line 1774) the Hoare annotation is: true [2018-12-08 14:41:58,964 INFO L448 ceAbstractionStarter]: For program point L1774-1(line 1774) no Hoare annotation was computed. [2018-12-08 14:41:58,964 INFO L451 ceAbstractionStarter]: At program point L1771(line 1771) the Hoare annotation is: true [2018-12-08 14:41:58,964 INFO L448 ceAbstractionStarter]: For program point L1771-1(line 1771) no Hoare annotation was computed. [2018-12-08 14:41:58,964 INFO L451 ceAbstractionStarter]: At program point L1769(line 1769) the Hoare annotation is: true [2018-12-08 14:41:58,964 INFO L448 ceAbstractionStarter]: For program point L1768(lines 1768 1769) no Hoare annotation was computed. [2018-12-08 14:41:58,964 INFO L448 ceAbstractionStarter]: For program point L1768-1(lines 1768 1769) no Hoare annotation was computed. [2018-12-08 14:41:58,964 INFO L448 ceAbstractionStarter]: For program point __mainEXIT(lines 1766 1776) no Hoare annotation was computed. [2018-12-08 14:41:58,964 INFO L448 ceAbstractionStarter]: For program point gethostidFINAL(lines 1777 1780) no Hoare annotation was computed. [2018-12-08 14:41:58,964 INFO L448 ceAbstractionStarter]: For program point gethostidEXIT(lines 1777 1780) no Hoare annotation was computed. [2018-12-08 14:41:58,964 INFO L451 ceAbstractionStarter]: At program point gethostidENTRY(lines 1777 1780) the Hoare annotation is: true [2018-12-08 14:41:58,964 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 14:41:58,964 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-08 14:41:58,965 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 14:41:58,965 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 14:41:58,965 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2018-12-08 14:41:58,965 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 1861 1890) no Hoare annotation was computed. [2018-12-08 14:41:58,965 INFO L448 ceAbstractionStarter]: For program point L1873(line 1873) no Hoare annotation was computed. [2018-12-08 14:41:58,965 INFO L448 ceAbstractionStarter]: For program point L1873-1(line 1873) no Hoare annotation was computed. [2018-12-08 14:41:58,965 INFO L448 ceAbstractionStarter]: For program point L1873-2(line 1873) no Hoare annotation was computed. [2018-12-08 14:41:58,965 INFO L448 ceAbstractionStarter]: For program point L1873-3(line 1873) no Hoare annotation was computed. [2018-12-08 14:41:58,965 INFO L448 ceAbstractionStarter]: For program point L1865-2(lines 1865 1866) no Hoare annotation was computed. [2018-12-08 14:41:58,965 INFO L448 ceAbstractionStarter]: For program point L1865-3(line 1865) no Hoare annotation was computed. [2018-12-08 14:41:58,965 INFO L444 ceAbstractionStarter]: At program point L1865-4(lines 1865 1866) the Hoare annotation is: (<= 0 (+ main_~i~3 2147483648)) [2018-12-08 14:41:58,966 INFO L448 ceAbstractionStarter]: For program point L1865-5(lines 1865 1866) no Hoare annotation was computed. [2018-12-08 14:41:58,966 INFO L448 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2018-12-08 14:41:58,966 INFO L448 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2018-12-08 14:41:58,966 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1865) no Hoare annotation was computed. [2018-12-08 14:41:58,966 INFO L448 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2018-12-08 14:41:58,966 INFO L448 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2018-12-08 14:41:58,966 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2018-12-08 14:41:58,966 INFO L448 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1884) no Hoare annotation was computed. [2018-12-08 14:41:58,966 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2018-12-08 14:41:58,966 INFO L448 ceAbstractionStarter]: For program point L1883(line 1883) no Hoare annotation was computed. [2018-12-08 14:41:58,967 INFO L448 ceAbstractionStarter]: For program point L1875-2(lines 1875 1882) no Hoare annotation was computed. [2018-12-08 14:41:58,967 INFO L448 ceAbstractionStarter]: For program point L1875-3(line 1875) no Hoare annotation was computed. [2018-12-08 14:41:58,967 INFO L444 ceAbstractionStarter]: At program point L1875-4(lines 1875 1882) the Hoare annotation is: (and (let ((.cse0 (<= 0 (+ main_~i~3 2147483648))) (.cse1 (<= 1 main_~argc~0))) (or (and .cse0 .cse1 (<= 0 (+ main_~j~0 2147483648)) (<= 0 (+ main_~i~4 2147483648))) (and .cse0 .cse1 (= main_~i~4 0)))) (<= main_~argc~0 10000)) [2018-12-08 14:41:58,967 INFO L444 ceAbstractionStarter]: At program point L1875-5(lines 1875 1882) the Hoare annotation is: (and (<= 0 (+ main_~i~3 2147483648)) (<= main_~argc~0 10000) (<= 1 main_~argc~0) (<= 0 (+ main_~i~4 2147483648))) [2018-12-08 14:41:58,967 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 1861 1890) no Hoare annotation was computed. [2018-12-08 14:41:58,967 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2018-12-08 14:41:58,967 INFO L448 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2018-12-08 14:41:58,967 INFO L448 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1880) no Hoare annotation was computed. [2018-12-08 14:41:58,967 INFO L448 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1875) no Hoare annotation was computed. [2018-12-08 14:41:58,968 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2018-12-08 14:41:58,968 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1873) no Hoare annotation was computed. [2018-12-08 14:41:58,968 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 1861 1890) the Hoare annotation is: true [2018-12-08 14:41:58,968 INFO L448 ceAbstractionStarter]: For program point L1884-2(lines 1884 1885) no Hoare annotation was computed. [2018-12-08 14:41:58,968 INFO L448 ceAbstractionStarter]: For program point L1884-3(line 1884) no Hoare annotation was computed. [2018-12-08 14:41:58,968 INFO L444 ceAbstractionStarter]: At program point L1884-4(lines 1884 1885) the Hoare annotation is: (and (<= 0 (+ main_~i~3 2147483648)) (<= main_~argc~0 10000) (<= 1 main_~argc~0) (<= 0 (+ main_~i~5 2147483648)) (<= 0 (+ main_~i~4 2147483648))) [2018-12-08 14:41:58,968 INFO L448 ceAbstractionStarter]: For program point L1884-5(lines 1884 1885) no Hoare annotation was computed. [2018-12-08 14:41:58,968 INFO L448 ceAbstractionStarter]: For program point L1880-2(lines 1880 1881) no Hoare annotation was computed. [2018-12-08 14:41:58,968 INFO L448 ceAbstractionStarter]: For program point L1880-3(line 1880) no Hoare annotation was computed. [2018-12-08 14:41:58,968 INFO L444 ceAbstractionStarter]: At program point L1880-4(lines 1880 1881) the Hoare annotation is: (and (<= 0 (+ main_~i~3 2147483648)) (<= main_~argc~0 10000) (<= 1 main_~argc~0) (<= 0 (+ main_~j~0 2147483648)) (<= main_~i~4 268435453) (<= 0 (+ main_~i~4 2147483648))) [2018-12-08 14:41:58,968 INFO L448 ceAbstractionStarter]: For program point L1872(line 1872) no Hoare annotation was computed. [2018-12-08 14:41:58,969 INFO L448 ceAbstractionStarter]: For program point L1872-1(line 1872) no Hoare annotation was computed. [2018-12-08 14:41:58,969 INFO L448 ceAbstractionStarter]: For program point L1872-2(line 1872) no Hoare annotation was computed. [2018-12-08 14:41:58,969 INFO L448 ceAbstractionStarter]: For program point L1872-3(line 1872) no Hoare annotation was computed. [2018-12-08 14:41:58,969 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 1872) no Hoare annotation was computed. [2018-12-08 14:41:58,981 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 02:41:58 BoogieIcfgContainer [2018-12-08 14:41:58,981 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 14:41:58,981 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 14:41:58,981 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 14:41:58,982 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 14:41:58,982 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 02:41:57" (3/4) ... [2018-12-08 14:41:58,985 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 14:41:58,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 14:41:58,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fflush_all [2018-12-08 14:41:58,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __main [2018-12-08 14:41:58,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure bb_show_usage [2018-12-08 14:41:58,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure gethostid [2018-12-08 14:41:58,991 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 14:41:58,998 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 194 nodes and edges [2018-12-08 14:41:58,998 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 99 nodes and edges [2018-12-08 14:41:58,999 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 46 nodes and edges [2018-12-08 14:41:58,999 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-12-08 14:41:58,999 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2018-12-08 14:41:58,999 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-08 14:41:59,000 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-08 14:41:59,000 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 14:41:59,000 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 14:41:59,042 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9108c249-f630-4ad8-a5a6-cded2f03687a/bin-2019/utaipan/witness.graphml [2018-12-08 14:41:59,042 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 14:41:59,043 INFO L168 Benchmark]: Toolchain (without parser) took 3199.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 185.6 MB). Free memory was 947.9 MB in the beginning and 1.0 GB in the end (delta: -83.9 MB). Peak memory consumption was 101.7 MB. Max. memory is 11.5 GB. [2018-12-08 14:41:59,044 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:41:59,044 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 947.9 MB in the beginning and 979.3 MB in the end (delta: -31.3 MB). Peak memory consumption was 108.8 MB. Max. memory is 11.5 GB. [2018-12-08 14:41:59,044 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.64 ms. Allocated memory is still 1.2 GB. Free memory was 979.3 MB in the beginning and 968.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 14:41:59,044 INFO L168 Benchmark]: Boogie Preprocessor took 45.48 ms. Allocated memory is still 1.2 GB. Free memory was 968.5 MB in the beginning and 965.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 14:41:59,044 INFO L168 Benchmark]: RCFGBuilder took 408.14 ms. Allocated memory is still 1.2 GB. Free memory was 963.2 MB in the beginning and 906.4 MB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. [2018-12-08 14:41:59,044 INFO L168 Benchmark]: TraceAbstraction took 1858.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 906.4 MB in the beginning and 1.0 GB in the end (delta: -130.6 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 14:41:59,044 INFO L168 Benchmark]: Witness Printer took 61.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. [2018-12-08 14:41:59,046 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 780.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.3 MB). Free memory was 947.9 MB in the beginning and 979.3 MB in the end (delta: -31.3 MB). Peak memory consumption was 108.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 42.64 ms. Allocated memory is still 1.2 GB. Free memory was 979.3 MB in the beginning and 968.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.48 ms. Allocated memory is still 1.2 GB. Free memory was 968.5 MB in the beginning and 965.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 408.14 ms. Allocated memory is still 1.2 GB. Free memory was 963.2 MB in the beginning and 906.4 MB in the end (delta: 56.8 MB). Peak memory consumption was 56.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1858.33 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 906.4 MB in the beginning and 1.0 GB in the end (delta: -130.6 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 61.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 5.1 MB). Peak memory consumption was 5.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1884]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1884]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1865]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1880]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1875]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1880]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1875]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1865]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1873]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 1872]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 16 specifications checked. All of them hold - InvariantResult [Line: 1865]: Loop Invariant Derived loop invariant: 0 <= i + 2147483648 - InvariantResult [Line: 1875]: Loop Invariant Derived loop invariant: ((((0 <= i + 2147483648 && 1 <= argc) && 0 <= j + 2147483648) && 0 <= i + 2147483648) || ((0 <= i + 2147483648 && 1 <= argc) && i == 0)) && argc <= 10000 - InvariantResult [Line: 1880]: Loop Invariant Derived loop invariant: ((((0 <= i + 2147483648 && argc <= 10000) && 1 <= argc) && 0 <= j + 2147483648) && i <= 268435453) && 0 <= i + 2147483648 - InvariantResult [Line: 1884]: Loop Invariant Derived loop invariant: (((0 <= i + 2147483648 && argc <= 10000) && 1 <= argc) && 0 <= i + 2147483648) && 0 <= i + 2147483648 - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 68 locations, 16 error locations. SAFE Result, 1.8s OverallTime, 15 OverallIterations, 2 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 767 SDtfs, 194 SDslu, 693 SDs, 0 SdLazy, 152 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=68occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 37 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 30 PreInvPairs, 37 NumberOfFragments, 117 HoareAnnotationTreeSize, 30 FomulaSimplifications, 1060 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 138 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 348 NumberOfCodeBlocks, 348 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 333 ConstructedInterpolants, 0 QuantifiedInterpolants, 13605 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 36/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...