./Ultimate.py --spec /storage/repos/svcomp/c/properties/no-overflow.prp --file /storage/repos/svcomp/c/termination-crafted/McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/termination-crafted/McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 871be16186d4378aec884efd2352a47ca4eb57bc ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 21:25:52,637 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 21:25:52,639 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 21:25:52,653 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 21:25:52,653 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 21:25:52,654 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 21:25:52,656 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 21:25:52,658 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 21:25:52,661 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 21:25:52,662 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 21:25:52,663 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 21:25:52,663 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 21:25:52,664 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 21:25:52,665 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 21:25:52,666 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 21:25:52,667 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 21:25:52,667 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 21:25:52,669 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 21:25:52,671 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 21:25:52,673 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 21:25:52,674 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 21:25:52,675 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 21:25:52,677 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 21:25:52,681 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 21:25:52,682 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 21:25:52,683 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 21:25:52,686 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 21:25:52,689 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 21:25:52,690 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 21:25:52,691 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 21:25:52,691 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 21:25:52,691 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 21:25:52,692 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 21:25:52,695 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 21:25:52,696 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 21:25:52,697 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 21:25:52,697 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-64bit-Automizer_Default.epf [2019-01-14 21:25:52,712 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 21:25:52,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 21:25:52,713 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 21:25:52,713 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 21:25:52,713 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 21:25:52,714 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 21:25:52,714 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 21:25:52,714 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 21:25:52,714 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 21:25:52,714 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-14 21:25:52,715 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 21:25:52,715 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-14 21:25:52,715 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2019-01-14 21:25:52,715 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-14 21:25:52,715 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-14 21:25:52,716 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 21:25:52,716 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 21:25:52,716 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 21:25:52,716 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 21:25:52,716 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:25:52,717 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 21:25:52,717 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 21:25:52,717 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-14 21:25:52,717 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 21:25:52,717 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 21:25:52,717 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-14 21:25:52,718 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 871be16186d4378aec884efd2352a47ca4eb57bc [2019-01-14 21:25:52,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 21:25:52,769 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 21:25:52,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 21:25:52,775 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 21:25:52,775 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 21:25:52,776 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-crafted/McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 21:25:52,847 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2121823/f1c120d650c54a599cd2866adb650951/FLAG9722213a2 [2019-01-14 21:25:53,312 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 21:25:53,314 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-crafted/McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 21:25:53,323 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2121823/f1c120d650c54a599cd2866adb650951/FLAG9722213a2 [2019-01-14 21:25:53,627 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de2121823/f1c120d650c54a599cd2866adb650951 [2019-01-14 21:25:53,630 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 21:25:53,633 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-14 21:25:53,634 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 21:25:53,634 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 21:25:53,638 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 21:25:53,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:25:53" (1/1) ... [2019-01-14 21:25:53,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dae10eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:53, skipping insertion in model container [2019-01-14 21:25:53,642 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:25:53" (1/1) ... [2019-01-14 21:25:53,650 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 21:25:53,666 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 21:25:53,854 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:25:53,858 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 21:25:53,875 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:25:53,889 INFO L195 MainTranslator]: Completed translation [2019-01-14 21:25:53,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:53 WrapperNode [2019-01-14 21:25:53,889 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 21:25:53,890 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-14 21:25:53,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-14 21:25:53,890 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-14 21:25:53,899 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:53" (1/1) ... [2019-01-14 21:25:53,904 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:53" (1/1) ... [2019-01-14 21:25:53,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-14 21:25:53,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 21:25:53,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 21:25:53,927 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 21:25:53,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:53" (1/1) ... [2019-01-14 21:25:53,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:53" (1/1) ... [2019-01-14 21:25:53,938 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:53" (1/1) ... [2019-01-14 21:25:53,939 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:53" (1/1) ... [2019-01-14 21:25:53,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:53" (1/1) ... [2019-01-14 21:25:53,942 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:53" (1/1) ... [2019-01-14 21:25:53,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:53" (1/1) ... [2019-01-14 21:25:53,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 21:25:53,945 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 21:25:53,945 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 21:25:53,945 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 21:25:53,946 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-01-14 21:25:54,063 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 21:25:54,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 21:25:54,063 INFO L130 BoogieDeclarations]: Found specification of procedure mc91 [2019-01-14 21:25:54,063 INFO L138 BoogieDeclarations]: Found implementation of procedure mc91 [2019-01-14 21:25:54,269 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 21:25:54,269 INFO L286 CfgBuilder]: Removed 4 assue(true) statements. [2019-01-14 21:25:54,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:25:54 BoogieIcfgContainer [2019-01-14 21:25:54,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 21:25:54,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 21:25:54,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 21:25:54,277 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 21:25:54,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 09:25:53" (1/3) ... [2019-01-14 21:25:54,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62afa07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:25:54, skipping insertion in model container [2019-01-14 21:25:54,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:25:53" (2/3) ... [2019-01-14 21:25:54,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62afa07b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:25:54, skipping insertion in model container [2019-01-14 21:25:54,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:25:54" (3/3) ... [2019-01-14 21:25:54,280 INFO L112 eAbstractionObserver]: Analyzing ICFG McCarthy91_Recursion_true-no-overflow_true-termination_true-valid-memsafety.c [2019-01-14 21:25:54,298 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 21:25:54,309 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-01-14 21:25:54,335 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-01-14 21:25:54,384 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 21:25:54,385 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 21:25:54,385 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-14 21:25:54,385 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 21:25:54,386 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 21:25:54,386 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 21:25:54,386 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 21:25:54,386 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 21:25:54,386 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 21:25:54,405 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-01-14 21:25:54,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 21:25:54,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:54,411 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 21:25:54,418 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:54,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:54,425 INFO L82 PathProgramCache]: Analyzing trace with hash 30304495, now seen corresponding path program 1 times [2019-01-14 21:25:54,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:54,428 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:54,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:54,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:54,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:54,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:54,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:25:54,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:25:54,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:25:54,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:25:54,665 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 5 states. [2019-01-14 21:25:54,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:54,856 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-01-14 21:25:54,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:25:54,858 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-01-14 21:25:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:54,870 INFO L225 Difference]: With dead ends: 40 [2019-01-14 21:25:54,871 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 21:25:54,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:25:54,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 21:25:54,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 27. [2019-01-14 21:25:54,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 21:25:54,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-01-14 21:25:54,928 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 5 [2019-01-14 21:25:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:54,928 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-01-14 21:25:54,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:25:54,929 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-01-14 21:25:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-01-14 21:25:54,929 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:54,929 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-01-14 21:25:54,930 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:54,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:54,931 INFO L82 PathProgramCache]: Analyzing trace with hash 30304655, now seen corresponding path program 1 times [2019-01-14 21:25:54,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:54,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:54,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:54,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:54,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:54,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:55,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:55,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:55,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:25:55,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:25:55,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:25:55,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:25:55,006 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 3 states. [2019-01-14 21:25:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:55,123 INFO L93 Difference]: Finished difference Result 29 states and 37 transitions. [2019-01-14 21:25:55,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:25:55,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-01-14 21:25:55,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:55,127 INFO L225 Difference]: With dead ends: 29 [2019-01-14 21:25:55,128 INFO L226 Difference]: Without dead ends: 28 [2019-01-14 21:25:55,130 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 [2019-01-14 21:25:55,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-01-14 21:25:55,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-01-14 21:25:55,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 21:25:55,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2019-01-14 21:25:55,148 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 5 [2019-01-14 21:25:55,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:55,149 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2019-01-14 21:25:55,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:25:55,149 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2019-01-14 21:25:55,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 21:25:55,149 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:55,150 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 21:25:55,150 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:55,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:55,150 INFO L82 PathProgramCache]: Analyzing trace with hash 939439389, now seen corresponding path program 1 times [2019-01-14 21:25:55,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:55,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:55,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:55,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:55,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:55,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:55,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:55,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:55,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:25:55,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:25:55,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:25:55,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:25:55,186 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2019-01-14 21:25:55,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:55,294 INFO L93 Difference]: Finished difference Result 28 states and 35 transitions. [2019-01-14 21:25:55,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:25:55,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-01-14 21:25:55,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:55,297 INFO L225 Difference]: With dead ends: 28 [2019-01-14 21:25:55,297 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 21:25:55,297 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 [2019-01-14 21:25:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 21:25:55,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2019-01-14 21:25:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-01-14 21:25:55,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-01-14 21:25:55,305 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 6 [2019-01-14 21:25:55,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:55,305 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-01-14 21:25:55,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:25:55,306 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-01-14 21:25:55,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-01-14 21:25:55,307 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:55,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-01-14 21:25:55,307 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:55,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:55,308 INFO L82 PathProgramCache]: Analyzing trace with hash 939444354, now seen corresponding path program 1 times [2019-01-14 21:25:55,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:55,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:55,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:55,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:55,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:55,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:55,482 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:55,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:25:55,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:25:55,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:25:55,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:25:55,483 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 5 states. [2019-01-14 21:25:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:55,724 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2019-01-14 21:25:55,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:25:55,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 6 [2019-01-14 21:25:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:55,727 INFO L225 Difference]: With dead ends: 39 [2019-01-14 21:25:55,727 INFO L226 Difference]: Without dead ends: 38 [2019-01-14 21:25:55,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:25:55,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-01-14 21:25:55,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-01-14 21:25:55,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-01-14 21:25:55,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2019-01-14 21:25:55,741 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 6 [2019-01-14 21:25:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:55,743 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2019-01-14 21:25:55,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:25:55,743 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2019-01-14 21:25:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-01-14 21:25:55,743 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:55,744 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:55,745 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:55,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:55,746 INFO L82 PathProgramCache]: Analyzing trace with hash 312291472, now seen corresponding path program 1 times [2019-01-14 21:25:55,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:55,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:55,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:55,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:55,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:25:55,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:55,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:25:55,835 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:25:55,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:25:55,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:25:55,836 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 5 states. [2019-01-14 21:25:56,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:56,125 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2019-01-14 21:25:56,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:25:56,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-01-14 21:25:56,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:56,128 INFO L225 Difference]: With dead ends: 55 [2019-01-14 21:25:56,128 INFO L226 Difference]: Without dead ends: 54 [2019-01-14 21:25:56,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:25:56,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-01-14 21:25:56,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2019-01-14 21:25:56,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-01-14 21:25:56,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-01-14 21:25:56,143 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 10 [2019-01-14 21:25:56,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:56,144 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-01-14 21:25:56,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:25:56,145 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-01-14 21:25:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-01-14 21:25:56,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:56,146 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:56,146 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:56,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:56,148 INFO L82 PathProgramCache]: Analyzing trace with hash -904725729, now seen corresponding path program 1 times [2019-01-14 21:25:56,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:56,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:56,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:56,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:56,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:56,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 21:25:56,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:56,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:25:56,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:25:56,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:25:56,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:25:56,205 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 5 states. [2019-01-14 21:25:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:56,327 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2019-01-14 21:25:56,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:25:56,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-01-14 21:25:56,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:56,330 INFO L225 Difference]: With dead ends: 52 [2019-01-14 21:25:56,330 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 21:25:56,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:25:56,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 21:25:56,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2019-01-14 21:25:56,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-01-14 21:25:56,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-01-14 21:25:56,342 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 18 [2019-01-14 21:25:56,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:56,342 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-01-14 21:25:56,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:25:56,343 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-01-14 21:25:56,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 21:25:56,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:25:56,344 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:25:56,344 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW, mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2019-01-14 21:25:56,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:25:56,344 INFO L82 PathProgramCache]: Analyzing trace with hash 2018278482, now seen corresponding path program 1 times [2019-01-14 21:25:56,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:25:56,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:25:56,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:56,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:25:56,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:25:56,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:25:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 21:25:56,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:25:56,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:25:56,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:25:56,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:25:56,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:25:56,587 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 5 states. [2019-01-14 21:25:56,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:25:56,817 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2019-01-14 21:25:56,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 21:25:56,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-01-14 21:25:56,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:25:56,819 INFO L225 Difference]: With dead ends: 48 [2019-01-14 21:25:56,819 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 21:25:56,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:25:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 21:25:56,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 21:25:56,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 21:25:56,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 21:25:56,821 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-01-14 21:25:56,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:25:56,821 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 21:25:56,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:25:56,822 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 21:25:56,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 21:25:56,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-14 21:25:57,038 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 16 [2019-01-14 21:25:57,149 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-14 21:25:57,150 INFO L444 ceAbstractionStarter]: At program point L16(line 16) the Hoare annotation is: (and (<= ULTIMATE.start_main_~x~0 2147483647) (<= 0 (+ ULTIMATE.start_main_~x~0 2147483648))) [2019-01-14 21:25:57,150 INFO L448 ceAbstractionStarter]: For program point L16-1(line 16) no Hoare annotation was computed. [2019-01-14 21:25:57,150 INFO L448 ceAbstractionStarter]: For program point L14(lines 14 17) no Hoare annotation was computed. [2019-01-14 21:25:57,150 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-14 21:25:57,150 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-14 21:25:57,151 INFO L448 ceAbstractionStarter]: For program point mc91Err1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 10) no Hoare annotation was computed. [2019-01-14 21:25:57,151 INFO L448 ceAbstractionStarter]: For program point mc91Err0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 10) no Hoare annotation was computed. [2019-01-14 21:25:57,151 INFO L448 ceAbstractionStarter]: For program point mc91FINAL(lines 8 12) no Hoare annotation was computed. [2019-01-14 21:25:57,151 INFO L448 ceAbstractionStarter]: For program point mc91Err2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 11) no Hoare annotation was computed. [2019-01-14 21:25:57,151 INFO L448 ceAbstractionStarter]: For program point mc91Err3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 11) no Hoare annotation was computed. [2019-01-14 21:25:57,151 INFO L448 ceAbstractionStarter]: For program point L11(line 11) no Hoare annotation was computed. [2019-01-14 21:25:57,152 INFO L448 ceAbstractionStarter]: For program point L10(lines 10 11) no Hoare annotation was computed. [2019-01-14 21:25:57,152 INFO L448 ceAbstractionStarter]: For program point L11-1(line 11) no Hoare annotation was computed. [2019-01-14 21:25:57,152 INFO L448 ceAbstractionStarter]: For program point L10-1(line 10) no Hoare annotation was computed. [2019-01-14 21:25:57,152 INFO L444 ceAbstractionStarter]: At program point L11-2(line 11) the Hoare annotation is: (or (< 2147483647 |mc91_#in~n|) (< (+ |mc91_#in~n| 2147483648) 0) (and (<= mc91_~n 100) (<= 0 (+ mc91_~n 2147483648)))) [2019-01-14 21:25:57,152 INFO L448 ceAbstractionStarter]: For program point L10-2(line 10) no Hoare annotation was computed. [2019-01-14 21:25:57,152 INFO L448 ceAbstractionStarter]: For program point L11-3(line 11) no Hoare annotation was computed. [2019-01-14 21:25:57,152 INFO L444 ceAbstractionStarter]: At program point L11-4(line 11) the Hoare annotation is: (or (< 2147483647 |mc91_#in~n|) (< (+ |mc91_#in~n| 2147483648) 0) (and (<= 0 (+ |mc91_#t~ret0| 2147483648)) (<= mc91_~n 100) (<= 0 (+ mc91_~n 2147483648)) (<= |mc91_#t~ret0| 2147483647))) [2019-01-14 21:25:57,153 INFO L451 ceAbstractionStarter]: At program point mc91ENTRY(lines 8 12) the Hoare annotation is: true [2019-01-14 21:25:57,153 INFO L448 ceAbstractionStarter]: For program point L11-5(line 11) no Hoare annotation was computed. [2019-01-14 21:25:57,153 INFO L448 ceAbstractionStarter]: For program point mc91EXIT(lines 8 12) no Hoare annotation was computed. [2019-01-14 21:25:57,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 09:25:57 BoogieIcfgContainer [2019-01-14 21:25:57,156 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 21:25:57,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 21:25:57,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 21:25:57,157 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 21:25:57,158 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:25:54" (3/4) ... [2019-01-14 21:25:57,161 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 21:25:57,168 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure mc91 [2019-01-14 21:25:57,173 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 21:25:57,173 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-14 21:25:57,219 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 21:25:57,219 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 21:25:57,220 INFO L168 Benchmark]: Toolchain (without parser) took 3589.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 951.3 MB in the beginning and 1.0 GB in the end (delta: -66.4 MB). Peak memory consumption was 85.1 MB. Max. memory is 11.5 GB. [2019-01-14 21:25:57,222 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:25:57,222 INFO L168 Benchmark]: CACSL2BoogieTranslator took 256.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 21:25:57,223 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.40 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:25:57,225 INFO L168 Benchmark]: Boogie Preprocessor took 17.44 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:25:57,225 INFO L168 Benchmark]: RCFGBuilder took 327.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-01-14 21:25:57,226 INFO L168 Benchmark]: TraceAbstraction took 2883.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 112.7 MB). Peak memory consumption was 112.7 MB. Max. memory is 11.5 GB. [2019-01-14 21:25:57,227 INFO L168 Benchmark]: Witness Printer took 62.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:25:57,232 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 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 256.13 ms. Allocated memory is still 1.0 GB. Free memory was 951.3 MB in the beginning and 940.6 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 36.40 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.44 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 327.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -189.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2883.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 112.7 MB). Peak memory consumption was 112.7 MB. Max. memory is 11.5 GB. * Witness Printer took 62.88 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 11]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 10]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 22 locations, 4 error locations. SAFE Result, 2.7s OverallTime, 7 OverallIterations, 3 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 122 SDtfs, 124 SDslu, 160 SDs, 0 SdLazy, 204 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=47occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 24 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 28 PreInvPairs, 28 NumberOfFragments, 58 HoareAnnotationTreeSize, 28 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 94 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 69 NumberOfCodeBlocks, 69 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 62 ConstructedInterpolants, 0 QuantifiedInterpolants, 1540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 17/17 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...