./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c --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_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c -s /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cb528549fa76ae8087cf7043645dfa20323a0116 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 04:13:50,205 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:13:50,206 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:13:50,212 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:13:50,212 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:13:50,213 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:13:50,214 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:13:50,215 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:13:50,215 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:13:50,216 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:13:50,216 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:13:50,217 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:13:50,217 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:13:50,218 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:13:50,218 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:13:50,219 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:13:50,219 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:13:50,220 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:13:50,221 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:13:50,222 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:13:50,222 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:13:50,223 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:13:50,224 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:13:50,224 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:13:50,225 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:13:50,225 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:13:50,226 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:13:50,226 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:13:50,227 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:13:50,227 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:13:50,228 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:13:50,228 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:13:50,228 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:13:50,228 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:13:50,229 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:13:50,229 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:13:50,229 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/config/svcomp-Overflow-64bit-Automizer_Default.epf [2018-12-09 04:13:50,237 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:13:50,237 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:13:50,237 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 04:13:50,238 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 04:13:50,238 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 04:13:50,238 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 04:13:50,238 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 04:13:50,238 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:13:50,238 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 04:13:50,238 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:13:50,239 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:13:50,239 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 04:13:50,239 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 04:13:50,239 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 04:13:50,239 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-09 04:13:50,239 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 04:13:50,239 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 04:13:50,239 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 04:13:50,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:13:50,240 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:13:50,240 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 04:13:50,240 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 04:13:50,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:13:50,240 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:13:50,240 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 04:13:50,240 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 04:13:50,240 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 04:13:50,240 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 04:13:50,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 04:13:50,241 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb528549fa76ae8087cf7043645dfa20323a0116 [2018-12-09 04:13:50,259 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:13:50,268 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:13:50,271 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:13:50,272 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:13:50,272 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:13:50,273 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/../../sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-09 04:13:50,313 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/data/d76480675/aac558137125421488ee387a942b8234/FLAGa6f4f641d [2018-12-09 04:13:50,653 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:13:50,654 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/sv-benchmarks/c/termination-crafted/NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-09 04:13:50,657 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/data/d76480675/aac558137125421488ee387a942b8234/FLAGa6f4f641d [2018-12-09 04:13:50,665 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/data/d76480675/aac558137125421488ee387a942b8234 [2018-12-09 04:13:50,667 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:13:50,667 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:13:50,668 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:13:50,668 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:13:50,670 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:13:50,670 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:13:50" (1/1) ... [2018-12-09 04:13:50,672 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b1a052f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:50, skipping insertion in model container [2018-12-09 04:13:50,672 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:13:50" (1/1) ... [2018-12-09 04:13:50,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:13:50,685 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:13:50,771 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:13:50,773 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:13:50,782 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:13:50,790 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:13:50,790 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:50 WrapperNode [2018-12-09 04:13:50,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:13:50,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:13:50,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:13:50,791 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:13:50,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:50" (1/1) ... [2018-12-09 04:13:50,798 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:50" (1/1) ... [2018-12-09 04:13:50,802 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:13:50,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:13:50,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:13:50,802 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:13:50,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:50" (1/1) ... [2018-12-09 04:13:50,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:50" (1/1) ... [2018-12-09 04:13:50,808 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:50" (1/1) ... [2018-12-09 04:13:50,808 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:50" (1/1) ... [2018-12-09 04:13:50,810 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:50" (1/1) ... [2018-12-09 04:13:50,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:50" (1/1) ... [2018-12-09 04:13:50,812 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:50" (1/1) ... [2018-12-09 04:13:50,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:13:50,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:13:50,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:13:50,813 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:13:50,813 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/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-09 04:13:50,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 04:13:50,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 04:13:50,878 INFO L130 BoogieDeclarations]: Found specification of procedure rec1 [2018-12-09 04:13:50,878 INFO L138 BoogieDeclarations]: Found implementation of procedure rec1 [2018-12-09 04:13:50,878 INFO L130 BoogieDeclarations]: Found specification of procedure rec2 [2018-12-09 04:13:50,878 INFO L138 BoogieDeclarations]: Found implementation of procedure rec2 [2018-12-09 04:13:50,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:13:50,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:13:50,878 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 04:13:50,878 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 04:13:50,985 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:13:50,985 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-09 04:13:50,985 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:13:50 BoogieIcfgContainer [2018-12-09 04:13:50,985 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:13:50,986 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 04:13:50,986 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 04:13:50,989 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 04:13:50,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:13:50" (1/3) ... [2018-12-09 04:13:50,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547d207c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:13:50, skipping insertion in model container [2018-12-09 04:13:50,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:13:50" (2/3) ... [2018-12-09 04:13:50,991 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@547d207c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:13:50, skipping insertion in model container [2018-12-09 04:13:50,991 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:13:50" (3/3) ... [2018-12-09 04:13:50,992 INFO L112 eAbstractionObserver]: Analyzing ICFG NestedRecursion_1b_true-no-overflow_true-termination_true-valid-memsafety.c [2018-12-09 04:13:50,999 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 04:13:51,003 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-12-09 04:13:51,013 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-12-09 04:13:51,031 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 04:13:51,031 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 04:13:51,032 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 04:13:51,032 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 04:13:51,032 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:13:51,032 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:13:51,032 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 04:13:51,032 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:13:51,032 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 04:13:51,050 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-12-09 04:13:51,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 04:13:51,054 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:51,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:13:51,056 INFO L423 AbstractCegarLoop]: === Iteration 1 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:51,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:51,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1147028286, now seen corresponding path program 1 times [2018-12-09 04:13:51,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:51,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:51,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:51,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:51,167 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-09 04:13:51,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:51,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:13:51,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:13:51,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:13:51,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:13:51,180 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 5 states. [2018-12-09 04:13:51,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:51,243 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-12-09 04:13:51,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:13:51,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2018-12-09 04:13:51,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:51,251 INFO L225 Difference]: With dead ends: 67 [2018-12-09 04:13:51,251 INFO L226 Difference]: Without dead ends: 59 [2018-12-09 04:13:51,253 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:51,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-12-09 04:13:51,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2018-12-09 04:13:51,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-09 04:13:51,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-12-09 04:13:51,279 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 9 [2018-12-09 04:13:51,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:51,280 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-12-09 04:13:51,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:13:51,280 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-12-09 04:13:51,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 04:13:51,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:51,280 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:13:51,280 INFO L423 AbstractCegarLoop]: === Iteration 2 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:51,281 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:51,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1198138435, now seen corresponding path program 1 times [2018-12-09 04:13:51,281 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:51,281 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:51,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:51,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:51,297 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-09 04:13:51,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:51,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 04:13:51,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:13:51,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:13:51,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:13:51,299 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 3 states. [2018-12-09 04:13:51,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:51,311 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-12-09 04:13:51,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:13:51,311 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 04:13:51,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:51,312 INFO L225 Difference]: With dead ends: 56 [2018-12-09 04:13:51,312 INFO L226 Difference]: Without dead ends: 55 [2018-12-09 04:13:51,313 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-09 04:13:51,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-12-09 04:13:51,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2018-12-09 04:13:51,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-09 04:13:51,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-12-09 04:13:51,318 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 10 [2018-12-09 04:13:51,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:51,318 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-12-09 04:13:51,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:13:51,318 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-12-09 04:13:51,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 04:13:51,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:51,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:13:51,319 INFO L423 AbstractCegarLoop]: === Iteration 3 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:51,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:51,319 INFO L82 PathProgramCache]: Analyzing trace with hash 2126464488, now seen corresponding path program 1 times [2018-12-09 04:13:51,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:51,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:51,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:51,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:51,338 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-09 04:13:51,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:51,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:13:51,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:13:51,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:13:51,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:13:51,338 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 5 states. [2018-12-09 04:13:51,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:51,388 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-12-09 04:13:51,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:13:51,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-12-09 04:13:51,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:51,389 INFO L225 Difference]: With dead ends: 77 [2018-12-09 04:13:51,389 INFO L226 Difference]: Without dead ends: 76 [2018-12-09 04:13:51,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:51,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-12-09 04:13:51,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-12-09 04:13:51,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-09 04:13:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2018-12-09 04:13:51,396 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 14 [2018-12-09 04:13:51,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:51,397 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2018-12-09 04:13:51,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:13:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2018-12-09 04:13:51,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-09 04:13:51,397 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:51,397 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:13:51,397 INFO L423 AbstractCegarLoop]: === Iteration 4 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:51,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:51,398 INFO L82 PathProgramCache]: Analyzing trace with hash 1495889727, now seen corresponding path program 1 times [2018-12-09 04:13:51,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:51,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,398 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:51,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:51,409 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-09 04:13:51,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:51,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 04:13:51,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:13:51,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:13:51,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:13:51,410 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 3 states. [2018-12-09 04:13:51,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:51,418 INFO L93 Difference]: Finished difference Result 73 states and 95 transitions. [2018-12-09 04:13:51,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:13:51,419 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-09 04:13:51,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:51,419 INFO L225 Difference]: With dead ends: 73 [2018-12-09 04:13:51,419 INFO L226 Difference]: Without dead ends: 72 [2018-12-09 04:13:51,420 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-09 04:13:51,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-12-09 04:13:51,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 68. [2018-12-09 04:13:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-12-09 04:13:51,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2018-12-09 04:13:51,426 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 15 [2018-12-09 04:13:51,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:51,426 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2018-12-09 04:13:51,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:13:51,426 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2018-12-09 04:13:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-09 04:13:51,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:51,427 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:13:51,427 INFO L423 AbstractCegarLoop]: === Iteration 5 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:51,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:51,427 INFO L82 PathProgramCache]: Analyzing trace with hash -440899931, now seen corresponding path program 1 times [2018-12-09 04:13:51,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:51,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:51,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:51,448 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-09 04:13:51,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:51,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:13:51,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:13:51,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:13:51,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:13:51,449 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand 5 states. [2018-12-09 04:13:51,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:51,481 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2018-12-09 04:13:51,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:13:51,481 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-12-09 04:13:51,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:51,482 INFO L225 Difference]: With dead ends: 70 [2018-12-09 04:13:51,482 INFO L226 Difference]: Without dead ends: 69 [2018-12-09 04:13:51,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:13:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-09 04:13:51,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2018-12-09 04:13:51,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-09 04:13:51,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 82 transitions. [2018-12-09 04:13:51,488 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 82 transitions. Word has length 20 [2018-12-09 04:13:51,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:51,488 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 82 transitions. [2018-12-09 04:13:51,488 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:13:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 82 transitions. [2018-12-09 04:13:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-09 04:13:51,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:51,489 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] [2018-12-09 04:13:51,489 INFO L423 AbstractCegarLoop]: === Iteration 6 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:51,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1311878191, now seen corresponding path program 1 times [2018-12-09 04:13:51,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:51,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:51,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:51,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:51,509 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-09 04:13:51,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:51,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 04:13:51,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:13:51,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:13:51,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:13:51,510 INFO L87 Difference]: Start difference. First operand 67 states and 82 transitions. Second operand 3 states. [2018-12-09 04:13:51,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:51,518 INFO L93 Difference]: Finished difference Result 67 states and 82 transitions. [2018-12-09 04:13:51,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:13:51,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-12-09 04:13:51,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:51,519 INFO L225 Difference]: With dead ends: 67 [2018-12-09 04:13:51,519 INFO L226 Difference]: Without dead ends: 66 [2018-12-09 04:13:51,519 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-09 04:13:51,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-12-09 04:13:51,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-12-09 04:13:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-09 04:13:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-12-09 04:13:51,524 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 22 [2018-12-09 04:13:51,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:51,524 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2018-12-09 04:13:51,524 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:13:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-12-09 04:13:51,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 04:13:51,524 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:51,525 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] [2018-12-09 04:13:51,525 INFO L423 AbstractCegarLoop]: === Iteration 7 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:51,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:51,525 INFO L82 PathProgramCache]: Analyzing trace with hash -840361398, now seen corresponding path program 1 times [2018-12-09 04:13:51,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:51,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:51,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:51,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:51,538 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-09 04:13:51,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:51,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 04:13:51,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:13:51,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:13:51,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:13:51,538 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 3 states. [2018-12-09 04:13:51,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:51,544 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-12-09 04:13:51,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:13:51,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-09 04:13:51,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:51,544 INFO L225 Difference]: With dead ends: 66 [2018-12-09 04:13:51,545 INFO L226 Difference]: Without dead ends: 65 [2018-12-09 04:13:51,545 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-09 04:13:51,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-09 04:13:51,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-12-09 04:13:51,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-12-09 04:13:51,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2018-12-09 04:13:51,549 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 23 [2018-12-09 04:13:51,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:51,549 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2018-12-09 04:13:51,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:13:51,549 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2018-12-09 04:13:51,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-09 04:13:51,549 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:51,550 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] [2018-12-09 04:13:51,550 INFO L423 AbstractCegarLoop]: === Iteration 8 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:51,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:51,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2013518212, now seen corresponding path program 1 times [2018-12-09 04:13:51,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:51,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:51,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:51,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:51,573 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-09 04:13:51,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:51,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:13:51,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:13:51,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:13:51,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:13:51,574 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 4 states. [2018-12-09 04:13:51,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:51,583 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2018-12-09 04:13:51,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:13:51,584 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-12-09 04:13:51,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:51,584 INFO L225 Difference]: With dead ends: 90 [2018-12-09 04:13:51,584 INFO L226 Difference]: Without dead ends: 89 [2018-12-09 04:13:51,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:13:51,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-12-09 04:13:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-12-09 04:13:51,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-09 04:13:51,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2018-12-09 04:13:51,590 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 23 [2018-12-09 04:13:51,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:51,590 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2018-12-09 04:13:51,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:13:51,590 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2018-12-09 04:13:51,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-09 04:13:51,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:51,591 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] [2018-12-09 04:13:51,591 INFO L423 AbstractCegarLoop]: === Iteration 9 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:51,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:51,591 INFO L82 PathProgramCache]: Analyzing trace with hash -281399491, now seen corresponding path program 1 times [2018-12-09 04:13:51,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:51,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:51,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:51,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:51,604 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-09 04:13:51,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:51,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:13:51,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:13:51,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:13:51,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:13:51,605 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand 4 states. [2018-12-09 04:13:51,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:51,622 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2018-12-09 04:13:51,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:13:51,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-12-09 04:13:51,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:51,623 INFO L225 Difference]: With dead ends: 84 [2018-12-09 04:13:51,623 INFO L226 Difference]: Without dead ends: 80 [2018-12-09 04:13:51,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:13:51,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-09 04:13:51,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-09 04:13:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-09 04:13:51,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 99 transitions. [2018-12-09 04:13:51,631 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 99 transitions. Word has length 24 [2018-12-09 04:13:51,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:51,631 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 99 transitions. [2018-12-09 04:13:51,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:13:51,631 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 99 transitions. [2018-12-09 04:13:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 04:13:51,632 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:51,632 INFO L402 BasicCegarLoop]: trace histogram [3, 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-09 04:13:51,632 INFO L423 AbstractCegarLoop]: === Iteration 10 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:51,633 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:51,633 INFO L82 PathProgramCache]: Analyzing trace with hash 1215449003, now seen corresponding path program 1 times [2018-12-09 04:13:51,633 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:51,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:51,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:51,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 04:13:51,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:51,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:13:51,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:13:51,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:13:51,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:13:51,656 INFO L87 Difference]: Start difference. First operand 80 states and 99 transitions. Second operand 5 states. [2018-12-09 04:13:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:51,700 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2018-12-09 04:13:51,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:13:51,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-12-09 04:13:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:51,701 INFO L225 Difference]: With dead ends: 105 [2018-12-09 04:13:51,701 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 04:13:51,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:13:51,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 04:13:51,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-12-09 04:13:51,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-12-09 04:13:51,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 128 transitions. [2018-12-09 04:13:51,707 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 128 transitions. Word has length 27 [2018-12-09 04:13:51,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:51,708 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 128 transitions. [2018-12-09 04:13:51,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:13:51,708 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 128 transitions. [2018-12-09 04:13:51,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 04:13:51,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:51,709 INFO L402 BasicCegarLoop]: trace histogram [5, 3, 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] [2018-12-09 04:13:51,709 INFO L423 AbstractCegarLoop]: === Iteration 11 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:51,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:51,709 INFO L82 PathProgramCache]: Analyzing trace with hash 505515198, now seen corresponding path program 1 times [2018-12-09 04:13:51,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:51,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:51,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:51,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:51,728 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-09 04:13:51,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:51,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:13:51,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:13:51,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:13:51,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:13:51,729 INFO L87 Difference]: Start difference. First operand 101 states and 128 transitions. Second operand 5 states. [2018-12-09 04:13:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:51,782 INFO L93 Difference]: Finished difference Result 104 states and 128 transitions. [2018-12-09 04:13:51,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:13:51,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2018-12-09 04:13:51,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:51,783 INFO L225 Difference]: With dead ends: 104 [2018-12-09 04:13:51,783 INFO L226 Difference]: Without dead ends: 103 [2018-12-09 04:13:51,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:13:51,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-12-09 04:13:51,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2018-12-09 04:13:51,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 04:13:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 127 transitions. [2018-12-09 04:13:51,789 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 127 transitions. Word has length 38 [2018-12-09 04:13:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:51,789 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 127 transitions. [2018-12-09 04:13:51,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:13:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 127 transitions. [2018-12-09 04:13:51,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 04:13:51,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:51,790 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:13:51,790 INFO L423 AbstractCegarLoop]: === Iteration 12 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:51,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:51,790 INFO L82 PathProgramCache]: Analyzing trace with hash -30814145, now seen corresponding path program 1 times [2018-12-09 04:13:51,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:51,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:51,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:51,808 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 04:13:51,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:51,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:13:51,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:13:51,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:13:51,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:13:51,809 INFO L87 Difference]: Start difference. First operand 100 states and 127 transitions. Second operand 4 states. [2018-12-09 04:13:51,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:51,824 INFO L93 Difference]: Finished difference Result 110 states and 142 transitions. [2018-12-09 04:13:51,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:13:51,824 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-09 04:13:51,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:51,825 INFO L225 Difference]: With dead ends: 110 [2018-12-09 04:13:51,825 INFO L226 Difference]: Without dead ends: 109 [2018-12-09 04:13:51,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:13:51,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-12-09 04:13:51,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-12-09 04:13:51,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-09 04:13:51,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 133 transitions. [2018-12-09 04:13:51,834 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 133 transitions. Word has length 36 [2018-12-09 04:13:51,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:51,835 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 133 transitions. [2018-12-09 04:13:51,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:13:51,835 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 133 transitions. [2018-12-09 04:13:51,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 04:13:51,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:51,837 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 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, 1, 1, 1, 1] [2018-12-09 04:13:51,837 INFO L423 AbstractCegarLoop]: === Iteration 13 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:51,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:51,837 INFO L82 PathProgramCache]: Analyzing trace with hash -204013767, now seen corresponding path program 1 times [2018-12-09 04:13:51,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:51,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:51,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:51,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:51,860 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-09 04:13:51,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:51,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 04:13:51,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:13:51,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:13:51,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:13:51,861 INFO L87 Difference]: Start difference. First operand 106 states and 133 transitions. Second operand 3 states. [2018-12-09 04:13:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:51,868 INFO L93 Difference]: Finished difference Result 106 states and 133 transitions. [2018-12-09 04:13:51,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:13:51,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2018-12-09 04:13:51,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:51,869 INFO L225 Difference]: With dead ends: 106 [2018-12-09 04:13:51,869 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 04:13:51,870 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-09 04:13:51,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 04:13:51,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-12-09 04:13:51,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-12-09 04:13:51,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 130 transitions. [2018-12-09 04:13:51,874 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 130 transitions. Word has length 48 [2018-12-09 04:13:51,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:51,875 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 130 transitions. [2018-12-09 04:13:51,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:13:51,875 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 130 transitions. [2018-12-09 04:13:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-09 04:13:51,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:51,876 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:13:51,876 INFO L423 AbstractCegarLoop]: === Iteration 14 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:51,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:51,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1915961670, now seen corresponding path program 1 times [2018-12-09 04:13:51,876 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:51,876 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:51,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:51,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:51,911 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 04:13:51,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:13:51,911 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:13:51,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:51,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:13:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 9 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 04:13:51,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:13:51,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-09 04:13:51,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:13:51,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:13:51,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:51,975 INFO L87 Difference]: Start difference. First operand 105 states and 130 transitions. Second operand 6 states. [2018-12-09 04:13:52,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:52,016 INFO L93 Difference]: Finished difference Result 121 states and 152 transitions. [2018-12-09 04:13:52,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:13:52,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-12-09 04:13:52,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:52,017 INFO L225 Difference]: With dead ends: 121 [2018-12-09 04:13:52,018 INFO L226 Difference]: Without dead ends: 112 [2018-12-09 04:13:52,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:13:52,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-12-09 04:13:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-12-09 04:13:52,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-09 04:13:52,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2018-12-09 04:13:52,023 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 40 [2018-12-09 04:13:52,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:52,024 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2018-12-09 04:13:52,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:13:52,024 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2018-12-09 04:13:52,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 04:13:52,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:52,025 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 4, 2, 2, 2, 2, 2, 2, 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] [2018-12-09 04:13:52,025 INFO L423 AbstractCegarLoop]: === Iteration 15 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:52,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:52,025 INFO L82 PathProgramCache]: Analyzing trace with hash 541352037, now seen corresponding path program 1 times [2018-12-09 04:13:52,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:52,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:52,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:52,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:52,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:52,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:52,050 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2018-12-09 04:13:52,050 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:13:52,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:13:52,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:13:52,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:13:52,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:13:52,050 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand 5 states. [2018-12-09 04:13:52,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:52,070 INFO L93 Difference]: Finished difference Result 109 states and 135 transitions. [2018-12-09 04:13:52,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:13:52,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-09 04:13:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:52,071 INFO L225 Difference]: With dead ends: 109 [2018-12-09 04:13:52,071 INFO L226 Difference]: Without dead ends: 108 [2018-12-09 04:13:52,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:52,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-12-09 04:13:52,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 97. [2018-12-09 04:13:52,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-09 04:13:52,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 118 transitions. [2018-12-09 04:13:52,076 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 118 transitions. Word has length 58 [2018-12-09 04:13:52,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:52,076 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 118 transitions. [2018-12-09 04:13:52,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:13:52,076 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 118 transitions. [2018-12-09 04:13:52,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 04:13:52,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:52,078 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 8, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:13:52,078 INFO L423 AbstractCegarLoop]: === Iteration 16 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:52,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:52,078 INFO L82 PathProgramCache]: Analyzing trace with hash 705211226, now seen corresponding path program 1 times [2018-12-09 04:13:52,078 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:52,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:52,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:52,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:52,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:52,116 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 19 proven. 38 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2018-12-09 04:13:52,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:13:52,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:13:52,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:52,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:13:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 182 trivial. 0 not checked. [2018-12-09 04:13:52,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-12-09 04:13:52,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 6 [2018-12-09 04:13:52,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:13:52,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:13:52,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:52,168 INFO L87 Difference]: Start difference. First operand 97 states and 118 transitions. Second operand 6 states. [2018-12-09 04:13:52,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:52,194 INFO L93 Difference]: Finished difference Result 185 states and 227 transitions. [2018-12-09 04:13:52,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:13:52,194 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-12-09 04:13:52,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:52,195 INFO L225 Difference]: With dead ends: 185 [2018-12-09 04:13:52,195 INFO L226 Difference]: Without dead ends: 104 [2018-12-09 04:13:52,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:13:52,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-12-09 04:13:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2018-12-09 04:13:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-09 04:13:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 118 transitions. [2018-12-09 04:13:52,201 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 118 transitions. Word has length 110 [2018-12-09 04:13:52,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:52,201 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 118 transitions. [2018-12-09 04:13:52,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:13:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 118 transitions. [2018-12-09 04:13:52,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-09 04:13:52,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:52,202 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:13:52,203 INFO L423 AbstractCegarLoop]: === Iteration 17 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:52,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:52,203 INFO L82 PathProgramCache]: Analyzing trace with hash 814042608, now seen corresponding path program 1 times [2018-12-09 04:13:52,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:52,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:52,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:52,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:52,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:52,246 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 58 proven. 13 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2018-12-09 04:13:52,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:13:52,246 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:13:52,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:52,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:52,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:13:52,341 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 152 proven. 2 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2018-12-09 04:13:52,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:13:52,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 13 [2018-12-09 04:13:52,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 04:13:52,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 04:13:52,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-09 04:13:52,357 INFO L87 Difference]: Start difference. First operand 99 states and 118 transitions. Second operand 13 states. [2018-12-09 04:13:52,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:52,592 INFO L93 Difference]: Finished difference Result 249 states and 323 transitions. [2018-12-09 04:13:52,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 04:13:52,593 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2018-12-09 04:13:52,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:52,593 INFO L225 Difference]: With dead ends: 249 [2018-12-09 04:13:52,593 INFO L226 Difference]: Without dead ends: 161 [2018-12-09 04:13:52,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=421, Unknown=0, NotChecked=0, Total=506 [2018-12-09 04:13:52,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-12-09 04:13:52,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 136. [2018-12-09 04:13:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-09 04:13:52,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 165 transitions. [2018-12-09 04:13:52,600 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 165 transitions. Word has length 95 [2018-12-09 04:13:52,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:52,600 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 165 transitions. [2018-12-09 04:13:52,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 04:13:52,600 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 165 transitions. [2018-12-09 04:13:52,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 04:13:52,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:52,601 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2018-12-09 04:13:52,601 INFO L423 AbstractCegarLoop]: === Iteration 18 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:52,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:52,601 INFO L82 PathProgramCache]: Analyzing trace with hash 77369472, now seen corresponding path program 2 times [2018-12-09 04:13:52,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:52,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:52,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:52,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:52,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:52,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:52,623 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-09 04:13:52,623 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:13:52,623 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:13:52,631 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 04:13:52,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 04:13:52,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:13:52,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:13:52,654 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-12-09 04:13:52,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:13:52,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-12-09 04:13:52,671 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:13:52,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:13:52,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:52,672 INFO L87 Difference]: Start difference. First operand 136 states and 165 transitions. Second operand 6 states. [2018-12-09 04:13:52,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:52,690 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2018-12-09 04:13:52,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:13:52,690 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 04:13:52,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:52,691 INFO L225 Difference]: With dead ends: 145 [2018-12-09 04:13:52,692 INFO L226 Difference]: Without dead ends: 139 [2018-12-09 04:13:52,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:52,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-12-09 04:13:52,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-12-09 04:13:52,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-12-09 04:13:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 166 transitions. [2018-12-09 04:13:52,699 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 166 transitions. Word has length 64 [2018-12-09 04:13:52,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:52,700 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 166 transitions. [2018-12-09 04:13:52,700 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:13:52,700 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 166 transitions. [2018-12-09 04:13:52,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-12-09 04:13:52,701 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:52,701 INFO L402 BasicCegarLoop]: trace histogram [11, 9, 7, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:13:52,701 INFO L423 AbstractCegarLoop]: === Iteration 19 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:52,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:52,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1460603397, now seen corresponding path program 1 times [2018-12-09 04:13:52,702 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:52,702 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:52,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:52,702 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:13:52,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:52,743 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 21 proven. 53 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-12-09 04:13:52,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:13:52,743 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:13:52,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:52,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:52,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:13:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 137 proven. 15 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-12-09 04:13:52,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:13:52,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-12-09 04:13:52,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:13:52,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:13:52,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:13:52,790 INFO L87 Difference]: Start difference. First operand 139 states and 166 transitions. Second operand 6 states. [2018-12-09 04:13:52,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:52,862 INFO L93 Difference]: Finished difference Result 294 states and 375 transitions. [2018-12-09 04:13:52,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:13:52,863 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2018-12-09 04:13:52,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:52,864 INFO L225 Difference]: With dead ends: 294 [2018-12-09 04:13:52,864 INFO L226 Difference]: Without dead ends: 166 [2018-12-09 04:13:52,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:13:52,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-12-09 04:13:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 151. [2018-12-09 04:13:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-12-09 04:13:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 181 transitions. [2018-12-09 04:13:52,874 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 181 transitions. Word has length 89 [2018-12-09 04:13:52,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:52,874 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 181 transitions. [2018-12-09 04:13:52,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:13:52,875 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 181 transitions. [2018-12-09 04:13:52,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-12-09 04:13:52,876 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:13:52,876 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 9, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:13:52,876 INFO L423 AbstractCegarLoop]: === Iteration 20 === [rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW, rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 04:13:52,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:13:52,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1524494125, now seen corresponding path program 2 times [2018-12-09 04:13:52,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:13:52,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:13:52,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:52,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:13:52,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:13:52,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:13:52,917 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 49 proven. 77 refuted. 0 times theorem prover too weak. 231 trivial. 0 not checked. [2018-12-09 04:13:52,917 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:13:52,917 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:13:52,925 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 04:13:52,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 04:13:52,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:13:52,945 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:13:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 214 proven. 28 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2018-12-09 04:13:52,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:13:52,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-12-09 04:13:52,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 04:13:52,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 04:13:52,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:13:52,980 INFO L87 Difference]: Start difference. First operand 151 states and 181 transitions. Second operand 8 states. [2018-12-09 04:13:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:13:53,048 INFO L93 Difference]: Finished difference Result 199 states and 243 transitions. [2018-12-09 04:13:53,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:13:53,048 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2018-12-09 04:13:53,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:13:53,048 INFO L225 Difference]: With dead ends: 199 [2018-12-09 04:13:53,048 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 04:13:53,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 04:13:53,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 04:13:53,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 04:13:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 04:13:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 04:13:53,050 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2018-12-09 04:13:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:13:53,050 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 04:13:53,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 04:13:53,050 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 04:13:53,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 04:13:53,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 04:13:53,088 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 04:13:53,091 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 04:13:53,119 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 04:13:53,125 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-09 04:13:53,290 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 04:13:53,290 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 04:13:53,290 INFO L448 ceAbstractionStarter]: For program point rec1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 04:13:53,290 INFO L448 ceAbstractionStarter]: For program point rec1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 04:13:53,290 INFO L448 ceAbstractionStarter]: For program point rec1FINAL(lines 11 15) no Hoare annotation was computed. [2018-12-09 04:13:53,290 INFO L448 ceAbstractionStarter]: For program point rec1EXIT(lines 11 15) no Hoare annotation was computed. [2018-12-09 04:13:53,291 INFO L448 ceAbstractionStarter]: For program point rec1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 04:13:53,291 INFO L448 ceAbstractionStarter]: For program point L14(line 14) no Hoare annotation was computed. [2018-12-09 04:13:53,291 INFO L448 ceAbstractionStarter]: For program point rec1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 04:13:53,291 INFO L451 ceAbstractionStarter]: At program point rec1ENTRY(lines 11 15) the Hoare annotation is: true [2018-12-09 04:13:53,291 INFO L448 ceAbstractionStarter]: For program point L14-1(line 14) no Hoare annotation was computed. [2018-12-09 04:13:53,291 INFO L448 ceAbstractionStarter]: For program point L12(lines 12 13) no Hoare annotation was computed. [2018-12-09 04:13:53,291 INFO L444 ceAbstractionStarter]: At program point L14-2(line 14) the Hoare annotation is: (or (< 2147483647 |rec1_#in~i|) (and (<= rec1_~i |rec1_#in~i|) (<= 1 rec1_~i))) [2018-12-09 04:13:53,291 INFO L448 ceAbstractionStarter]: For program point L14-3(line 14) no Hoare annotation was computed. [2018-12-09 04:13:53,291 INFO L448 ceAbstractionStarter]: For program point L14-4(line 14) no Hoare annotation was computed. [2018-12-09 04:13:53,291 INFO L448 ceAbstractionStarter]: For program point L14-5(line 14) no Hoare annotation was computed. [2018-12-09 04:13:53,291 INFO L444 ceAbstractionStarter]: At program point L14-6(line 14) the Hoare annotation is: (and (or (<= rec1_~i |rec1_#in~i|) (< 2147483646 |rec1_#in~i|)) (or (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (<= rec1_~i 2147483647) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i)) (< 2147483647 |rec1_#in~i|))) [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point rec1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point L14-7(line 14) no Hoare annotation was computed. [2018-12-09 04:13:53,292 INFO L444 ceAbstractionStarter]: At program point L14-8(line 14) the Hoare annotation is: (or (< 2147483647 |rec1_#in~i|) (and (<= 0 (+ |rec1_#t~ret0| 2147483647)) (<= rec1_~i |rec1_#in~i|) (<= |rec1_#t~ret1| 0) (<= |rec1_#t~ret0| 1) (<= 1 rec1_~i))) [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point L14-9(line 14) no Hoare annotation was computed. [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point L14-10(line 14) no Hoare annotation was computed. [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point rec1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 14) no Hoare annotation was computed. [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point L14-11(line 14) no Hoare annotation was computed. [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point rec2FINAL(lines 17 21) no Hoare annotation was computed. [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point rec2EXIT(lines 17 21) no Hoare annotation was computed. [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point rec2Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point L18(lines 18 19) no Hoare annotation was computed. [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point rec2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-09 04:13:53,292 INFO L444 ceAbstractionStarter]: At program point L20-2(line 20) the Hoare annotation is: (or (and (<= rec2_~j |rec2_#in~j|) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point L20-3(line 20) no Hoare annotation was computed. [2018-12-09 04:13:53,292 INFO L444 ceAbstractionStarter]: At program point L20-4(line 20) the Hoare annotation is: (and (or (and (<= rec2_~j |rec2_#in~j|) (<= |rec2_#t~ret3| 1) (<= 1 rec2_~j)) (< 2147483647 |rec2_#in~j|)) (or (<= |rec2_#t~ret3| 0) (< 1 |rec2_#in~j|))) [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point L20-5(line 20) no Hoare annotation was computed. [2018-12-09 04:13:53,292 INFO L448 ceAbstractionStarter]: For program point L20-6(line 20) no Hoare annotation was computed. [2018-12-09 04:13:53,293 INFO L448 ceAbstractionStarter]: For program point L20-7(line 20) no Hoare annotation was computed. [2018-12-09 04:13:53,293 INFO L451 ceAbstractionStarter]: At program point rec2ENTRY(lines 17 21) the Hoare annotation is: true [2018-12-09 04:13:53,293 INFO L448 ceAbstractionStarter]: For program point rec2Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-09 04:13:53,293 INFO L448 ceAbstractionStarter]: For program point rec2Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-09 04:13:53,293 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 04:13:53,293 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 04:13:53,293 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 04:13:53,293 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 04:13:53,293 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 23 26) the Hoare annotation is: true [2018-12-09 04:13:53,293 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 23 26) no Hoare annotation was computed. [2018-12-09 04:13:53,293 INFO L444 ceAbstractionStarter]: At program point L25(line 25) the Hoare annotation is: (<= main_~x~0 2147483647) [2018-12-09 04:13:53,293 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 23 26) no Hoare annotation was computed. [2018-12-09 04:13:53,293 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-12-09 04:13:53,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:13:53 BoogieIcfgContainer [2018-12-09 04:13:53,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 04:13:53,295 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:13:53,295 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:13:53,296 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:13:53,296 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:13:50" (3/4) ... [2018-12-09 04:13:53,298 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 04:13:53,302 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 04:13:53,302 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec1 [2018-12-09 04:13:53,303 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure rec2 [2018-12-09 04:13:53,303 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 04:13:53,305 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2018-12-09 04:13:53,306 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 04:13:53,306 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 04:13:53,333 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_28283751-8118-4250-800c-7f317b20f3af/bin-2019/uautomizer/witness.graphml [2018-12-09 04:13:53,333 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:13:53,333 INFO L168 Benchmark]: Toolchain (without parser) took 2666.42 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.1 MB). Free memory was 960.3 MB in the beginning and 891.4 MB in the end (delta: 68.9 MB). Peak memory consumption was 287.0 MB. Max. memory is 11.5 GB. [2018-12-09 04:13:53,334 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:13:53,334 INFO L168 Benchmark]: CACSL2BoogieTranslator took 122.24 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 04:13:53,334 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.31 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:13:53,335 INFO L168 Benchmark]: Boogie Preprocessor took 10.67 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:13:53,335 INFO L168 Benchmark]: RCFGBuilder took 172.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-09 04:13:53,335 INFO L168 Benchmark]: TraceAbstraction took 2308.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 891.4 MB in the end (delta: 230.4 MB). Peak memory consumption was 305.9 MB. Max. memory is 11.5 GB. [2018-12-09 04:13:53,335 INFO L168 Benchmark]: Witness Printer took 37.46 ms. Allocated memory is still 1.2 GB. Free memory is still 891.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:13:53,336 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 122.24 ms. Allocated memory is still 1.0 GB. Free memory was 960.3 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.31 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.67 ms. Allocated memory is still 1.0 GB. Free memory is still 949.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 172.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -172.2 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2308.90 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 75.5 MB). Free memory was 1.1 GB in the beginning and 891.4 MB in the end (delta: 230.4 MB). Peak memory consumption was 305.9 MB. Max. memory is 11.5 GB. * Witness Printer took 37.46 ms. Allocated memory is still 1.2 GB. Free memory is still 891.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 14]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 49 locations, 10 error locations. SAFE Result, 2.2s OverallTime, 20 OverallIterations, 13 TraceHistogramMax, 0.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 822 SDtfs, 325 SDslu, 1945 SDs, 0 SdLazy, 799 SolverSat, 102 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 619 GetRequests, 527 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=151occurred in iteration=19, 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.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 102 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 299 PreInvPairs, 337 NumberOfFragments, 109 HoareAnnotationTreeSize, 299 FomulaSimplifications, 1341 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 459 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1379 NumberOfCodeBlocks, 1379 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1353 ConstructedInterpolants, 0 QuantifiedInterpolants, 140007 SizeOfPredicates, 9 NumberOfNonLiveVariables, 1044 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 26 InterpolantComputations, 15 PerfectInterpolantSequences, 2203/2449 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...